A systematic approach to MDD-based constraint programming

Authors:
Samid Hoda;Willem-Jan Van Hoeve;J. N. Hooker
Affiliations:
Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA;Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA;Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA
Venue:
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Year:
2010

Citing 7
Cited 4

Approximate Compilation of Constraints into Multivalued Decision Diagrams

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
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
New filtering algorithms for combinations of among constraints

Constraints
Solving set constraint satisfaction problems using ROBDDs

Journal of Artificial Intelligence Research
Enhanced Inference for the Market Split Problem

ICTAI '09 Proceedings of the 2009 21st IEEE International Conference on Tools with Artificial Intelligence
A constraint store based on multivalued decision diagrams

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Propagating separable equalities in an MDD store

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems

Manipulating MDD relaxations for combinatorial optimization

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
MDD propagators with explanation

Constraints
Variable ordering for the application of BDDs to the maximum independent set problem

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
BDD-based heuristics for binary optimization

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fixed-width MDDs were introduced recently as a more refined alternative for the domain store to represent partial solutions to CSPs. In this work, we present a systematic approach to MDD-based constraint programming. First, we introduce a generic scheme for constraint propagation in MDDs. We show that all previously known propagation algorithms for MDDs can be expressed using this scheme. Moreover, we use the scheme to produce algorithms for a number of other constraints, including Among, Element, and unary resource constraints. Finally, we discuss an implementation of our MDD-based CP solver, and provide experimental evidence of the benefits of MDD-based constraint programming.