Propagating separable equalities in an MDD store

Authors:
T. Hadzic;J. N. Hooker;P. Tiedemann
Affiliations:
University College Cork;Carnegie Mellon University;IT University of Copenhagen
Venue:
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Year:
2008

Citing 1
Cited 1

A constraint store based on multivalued decision diagrams

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

A systematic approach to MDD-based constraint programming

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time.We integrate the propagator into a constraint solver based on an MDD store introduced in [1]. Our experiments show that the new propagator provides substantial computational advantage over propagation of two inequality constraints, and that the advantage increases when the maximum width of the MDD store increases.