Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)

Authors:
Robert Mateescu;Rina Dechter
Affiliations:
Donald Bren School of Information and Computer Science, University of California, Irvine, CA;Donald Bren School of Information and Computer Science, University of California, Irvine, CA
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 18
Cited 12

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Tree clustering for constraint networks (research note)

Artificial Intelligence
The disjunctive decomposition of logic functions

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Bucket elimination: a unifying framework for reasoning

Artificial Intelligence
Model checking

Model checking
Recursive conditioning

Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Symbolic Model Checking

Symbolic Model Checking
Nonserial Dynamic Programming

Nonserial Dynamic Programming
Hierarchical Representations of Discrete Functions, with Application to Model Checking

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Compiling CSPs into Tree-Driven Automata for Interactive Solving

Constraints
Mixtures of deterministic-probabilistic networks and their AND/OR search space

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Case-factor diagrams for structured probabilistic modeling

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
AND/OR search spaces for graphical models

Artificial Intelligence
A knowledge compilation map

Journal of Artificial Intelligence Research
Taking advantage of stable sets of variables in constraint satisfaction problems

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
DPLL with a trace: from SAT to knowledge compilation

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Decision diagrams for the computation of semiring valuations

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

AND/OR search spaces for graphical models

Artificial Intelligence
AND/OR Multi-valued Decision Diagrams for Constraint Networks

Concurrency, Graphs and Models
Approximate Compilation of Constraints into Multivalued Decision Diagrams

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Knowledge compilation properties of tree-of-BDDs

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Approximate inference in probabilistic graphical models with determinism

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
H-DPOP: using hard constraints for search space pruning in DCOP

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
New compilation languages based on structured decomposability

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
AND/OR multi-valued decision diagrams for constraint optimization

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Compiling solution configurations in semiring valuation systems

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
On Decomposability and Interaction Functions

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Representing CSPs with set-labeled diagrams: a compilation map

GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function decomposition structure. This yields AND/OR multi-valued decision diagram (AOMDD) which compiles a constraint network into a canonical form that supports polynomial time queries such as solution counting, solution enumeration or equivalence of constraint networks. We provide a compilation algorithm based on Variable Elimination for assembling an AOMDD for a constraint network starting from the AOMDDs for its constraints. The algorithm uses the apply operator which combines two AOMDDs by a given operation. This guarantees the complexity upper bound for the compilation time and the size of the AOMDD to be exponential in the treewidth of the constraint graph, rather than pathwidth as is known for ordered binary decision diagrams (OBDDs).