Representing CSPs with Set-Labeled Diagrams: A Compilation Map


Constraint Satisfaction Problems (CSPs) offer a powerful framework for representing a great variety of problems. Unfortunately, most of the operations associated with CSPs are NP-hard. As some of these operations must be addressed online, compilation structures for CSPs have been proposed, e.g. finitestate automata and Multivalued Decision Diagrams (MDDs… (More)
DOI: 10.1007/978-3-642-29449-5_6


6 Figures and Tables