MDD propagators with explanation

Authors:
Graeme Gange;Peter J. Stuckey;Radoslaw Szymanek
Affiliations:
National ICT Australia, Victoria Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Victoria, Australia 3010;National ICT Australia, Victoria Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Victoria, Australia 3010;Artificial Intelligence Laboratory (LIA), École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland 1015
Venue:
Constraints
Year:
2011

Citing 16
Cited 2

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Propagation via lazy clause generation

Constraints
SLIDE: A Useful Special Case of the CARDPATH Constraint

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Fast Set Bounds Propagation using BDDs

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Solving set constraint satisfaction problems using ROBDDs

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
Encodings of the SEQUENCE constraint

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Decomposing global grammar constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Efficient reasoning for nogoods in constraint solvers with BDDs

PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
A systematic approach to MDD-based constraint programming

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Revisiting the sequence constraint

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Global grammar constraints

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A hybrid BDD and SAT finite domain constraint solver

PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages

Explaining propagators for s-DNNF circuits

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Optimal and efficient filtering algorithms for table constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-valued decision diagrams (MDDs) are a convenient approach to representing many kinds of constraints including table constraints, regular constraints, complex set and multiset constraints, as well as ad-hoc problem specific constraints. This paper introduces an incremental propagation algorithm for MDDs, and explores several methods for incorporating explanations with MDD-based propagators. We demonstrate that these techniques can provide significantly improved performance when solving a variety of problems.