A Constraint Store Based on Multivalued Decision Diagrams

The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-width multivalued decision diagram (MDD). It reduces to a traditional domain store when the maximum width is one but allows greater pruning of the search tree for larger widths. MDD propagation algorithms can be developed to exploit the structure of particular constraints, much as is done for domain filtering algorithms. We propose specialized propagation algorithms for alldiff and inequality constraints. Preliminary experiments show that MDD propagation solves multiple alldiff problems an order of magnitude more rapidly than traditional domain propagation. It also significantly reduces the search tree for inequality problems, but additional research is needed to reduce the computation time.

• Type: Conference
• Year: 2007
• Where: CP
• Authors: Henrik Reif Andersen, Tarik Hadzic, John N. Hooker, Peter Tiedemann
• Keywords: CP 2007, MDD Propagation, MDD Propagation Algorithms, Programming Languages, Propagation Algorithms