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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hadzic, T., Hooker, J. N., & Tiedemann, P. (2008). Propagating separable equalities in an MDD store. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5015 LNCS, pp. 318–322). https://doi.org/10.1007/978-3-540-68155-7_30
Mendeley helps you to discover research relevant for your work.