Abstract
When BDDs are used for propagation in a constraint solver with nogood recording, it is necessary to find a small subset of a given set of variable assignments that is enough for a BDD to imply a new variable assignment. We show that the task of finding such a minimum subset is NP-complete by reduction from the hitting set problem. We present a new algorithm for finding such a minimal subset, which runs in time linear in the size of the BDD representation. In our experiments, the new method is up to ten times faster than the previous method, thereby reducing the solution time by even more than 80%. Due to linear time complexity the new method is able to scale well.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bryant, R.E.: Graph-based algorithms for boolean function manipulation. Transactions on Computers 8, 677–691 (1986)
Bouquet, F., Jégou, P.: Using OBDDs to handle dynamic constraints. Information Processing Letters 62, 111–120 (1997)
Hadzic, T., Subbarayan, S., Jensen, R.M., Andersen, H.R., Møller, J., Hulgaard, H.: Fast backtrack-free product configuration using a precompiled solution space representation. In: PETO, pp. 131–138 (2004)
van der Meer, E.R., Andersen, H.R.: BDD-based recursive and conditional modular interactive product configuration. In: CP 2004 CSPIA Workshop, pp. 112–126 (2004)
Subbarayan, S., Jensen, R.M., Hadzic, T., Andersen, H.R., Hulgaard, H., Møller, J.: Comparing two implementations of a complete and backtrack-free interactive configurator. In: CP 2004 CSPIA Workshop, pp. 97–111 (2004)
Lagoon, V., Stuckey, P.: Set domain propagation using ROBDDs. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 347–361. Springer, Heidelberg (2004)
Hawkins, P., Stuckey, P.J.: A hybrid BDD and SAT finite domain constraint solver. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol. 3819, pp. 103–117. Springer, Heidelberg (2005)
Cheng, K.C.K., Yap, R.H.C.: Maintaining generalized arc consistency on ad-hoc n-ary Boolean constraints. In: ECAI, pp. 78–82 (2006)
Dechter, R.: Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence 41, 273–312 (1990)
Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problems. International Journal of Artificial Intelligence Tools 3, 187–207 (1994)
Katsirelos, G., Bacchus, F.: Unrestricted nogood recording in CSP search. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 873–877. Springer, Heidelberg (2003)
Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD, pp. 279–285 (2001)
Garey, M.R., Johnson, D.S.: Computers and Intractability-A Guide to the Theory of NP-Completeness. W.H. Freeman and Co (1979)
Damiano, R.F., Kukula, J.H.: Checking satisfiability of a conjunction of BDDs. In: DAC, pp. 818–823 (2003)
Jensen, R.M.: CLab: A C++ library for fast backtrack-free interactive product configuration. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, p. 816. Springer, Heidelberg (2004), http://www.itu.dk/people/rmj/clab/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Subbarayan, S. (2007). Efficient Reasoning for Nogoods in Constraint Solvers with BDDs. In: Hudak, P., Warren, D.S. (eds) Practical Aspects of Declarative Languages. PADL 2008. Lecture Notes in Computer Science, vol 4902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77442-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-77442-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77441-9
Online ISBN: 978-3-540-77442-6
eBook Packages: Computer ScienceComputer Science (R0)