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.
Similar content being viewed by others
References
Andersen, H. R., Hadzic, T., Hooker, J. N., & Tiedemann, P. (2007). A constraint store based on multivalued decision diagrams. In Proceedings of the 13th international conference on principles and practice of constraint programming. LNCS (Vol. 4741, pp. 118–132). Springer-Verlag.
Beldiceanu, N., Carlsson, M., & Rampon, J. X. (2010). Global constraint catalog (2nd ed.). SICS Technical Report T2010:07, Swedish Institute of Computer Science.
Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., & Walsh, T. (2008). SLIDE: A useful special case of the CARDPATH constraint. In 18th European conference on artificial intelligence (pp. 475–479).
Brand, S., Narodytska, N., Quimper, C., Stuckey, P., & Walsh, T. (2007). Encodings of the sequence constraint. In Proceedings of the 13th international conference on principles and practice of constraint programming. LNCS (Vol. 4741, pp. 210–224).
Bryant, R. E. (1986). Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 35(8), 677–691.
Cheng, K., & Yap, R. H. C. (2008). Maintaining generalized arc consistency on ad hoc r-ary constraints. In 14th international conference on principles and process of constraint programming. LNCS (Vol. 5202, pp. 509–523).
Gange, G., Lagoon, V., & Stuckey, P. J. (2008). Fast set bounds propagation using BDDs. In 18th European conference on artificial intelligence (pp. 505–509).
Hawkins, P., & Stuckey, P. J. (2006). A hybrid BDD and SAT finite domain constraint solver. In Proceedings of the 8th international symposium on practical aspects of declarative languages. LNCS (Vol. 3819, pp. 103–117).
Hawkins, P., Lagoon, V., & Stuckey, P. J. (2005). Solving set constraint satisfaction problems using ROBDDs. Journal of Artificial Intelligence Research, 24, 109–156.
Hoda, S., van Hoeve, W. J., & Hooker, J. (2010). A systematic approach to MDD-based constraint programming. In Proceedings of the 16th international conference on principles and practice of constraint programming. LNCS (Vol. 6308, pp. 266–280).
Lagerkvist, M. Z. (2008). Techniques for efficient constraint propagation. PhD thesis, Kungliga Tekniska, Stockholm.
Lagerkvist, M. Z., & Pesant, G. (2008). Modeling irregular shape placement problems with regular constraints. In First workshop on bin packing and placement constraints BPCC’08.
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT solver. In 38th design automation conference (pp. 530–535).
Ohrimenko, O., Stuckey, P. J., & Codish, M. (2009). Propagation via lazy clause generation. Constraints, 14(3), 357–391.
Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In M. Wallace (Ed.), Proceedings of the 10th international conference on principles and practice of constraint programming. LNCS (Vol. 3258, pp. 482–495). Springer-Verlag.
Quimper, C. G., & Walsh, T. (2006). Global grammar constraints. In Proceedings of the 12th international conference on principles and practice of constraint programming. LNCS (Vol. 4204, pp. 751–755).
Quimper, C. G., & Walsh, T. (2007). Decomposing global grammar constraints. In Proceedings of the 13th international conference on principles and practice of constraint programming. LNCS (Vol. 4741, pp. 590–604).
Srinivasan, A., Ham, T., Malik, S., & Brayton, R. K. (1990). Algorithms for discrete function manipulation. In 1990 IEEE international conference on computer-aided design. ICCAD-90. Digest of technical papers (pp. 92–95).
Subbarayan, S. (2008). Efficent reasoning for nogoods in constraint solvers with BDDs. In Proceedings of tenth international symposium on practical aspects of declarative languages. LNCS (Vol. 4902, pp. 53–57).
van Dongen, M. R. C., Lecoutre, C., & Roussel, O. (2010). Third international CSP solver competition. Online, accessed Sept 2010. http://www.cril.univ-artois.fr/CPAI08/.
van Hoeve, W. J., Pesant, G., Rousseau, L. M., & Sabharwal, A. (2006). Revisiting the sequence constraint. In Proceedings of the 12th international conference on principles and practice of constraint programming. LNCS (Vol. 4204, pp. 620–634).
Vanhoucke, M., & Maenhout, B. (2010). The nurse scheduling problem (NSP). Online, accessed Oct 2010. http://www.projectmanagement.ugent.be/nsp.php.
Wolter, J. (2010). Comparison of solvers on the n-dom puzzles. Online, accessed Sept 2010. http://webpbn.com/survey/dom.html.
Wolter, J. (2010). Survey of paint-by-numbers puzzle solvers. Online, accessed Sept 2010. http://webpbn.com/survey/.
Zhang, L., Madigan, C. F., Moskewicz, M. H., & Malik, S. (2001). Efficient conflict driven learning in a Boolean satisfiability solver. In Proceedings of the 2001 IEEE/ACM international conference on computer-aided design (pp. 279–285).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gange, G., Stuckey, P.J. & Szymanek, R. MDD propagators with explanation. Constraints 16, 407–429 (2011). https://doi.org/10.1007/s10601-011-9111-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-011-9111-x