Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Decomposable negation normal form
Journal of the ACM (JACM)
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Synthesis of Finite State Machines: Functional Optimization
Synthesis of Finite State Machines: Functional Optimization
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
FA Minimisation Heuristics for a Class of Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
New compilation languages based on structured decomposability
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
A constraint store based on multivalued decision diagrams
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Knowledge Compilation Using Interval Automata and Applications to Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Solving constraint satisfaction problems using finite state automata
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Forming concepts for fast inference
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
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. finite-state automata and Multivalued Decision Diagrams (MDDs). The aim of this paper is to draw a compilation map of these structures. We cast all of them as fragments of a more general framework that we call Set-labeled Diagrams (SDs), as they are rooted, directed acyclic graphs with variable-labeled nodes and set-labeled edges; contrary to MDDs and Binary Decision Diagrams, SDs are not required to be deterministic (the sets labeling the edges going out of a node are not necessarily disjoint), ordered nor even read-once. We study the relative succinctness of different subclasses of SDs, as well as the complexity of classically considered queries and transformations. We show that a particular subset of SDs, satisfying a focusing property, has theoretical capabilities very close to those of Decomposable Negation Normal Forms (DNNFs), although they do not satisfy the decomposability property stricto sensu.