Compiling CSPs into tree-driven automata for interactive solving

DOI10.1023/B:CONS.0000049204.75635.7EzbMATH Open1101.68088OpenAlexW2044058055MaRDI QIDQ2386699FDOQ2386699

Authors Marie-Catherine Vilarem, Hélène Fargier

Publication date 25 August 2005

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:cons.0000049204.75635.7e

zbMATH Keywords

tree automataconfigurationtree clusteringCSP compilationinteractive constraint solving

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Consistency restoration and explanations in dynamic CSPs---Application to configuration
• Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems
• Compiling constraint satisfaction problems
• Interactive Cost Configuration Over Decision Diagrams
• Computing and restoring global inverse consistency in interactive constraint satisfaction

Cited in

(7)

• Sufficient and necessary conditions for solution finding in valuation-based systems
• scientific article; zbMATH DE number 475414 (Why is no real title available?)
• Consistency restoration and explanations in dynamic CSPs---Application to configuration
• Knowledge compilation using interval automata and applications to planning
• Computing and restoring global inverse consistency in interactive constraint satisfaction
• Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems
• AND/OR search spaces for graphical models

This page was built for publication: Compiling CSPs into tree-driven automata for interactive solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386699)