# zbMATH — the first resource for mathematics

Propagation via lazy clause generation. (English) Zbl 1192.68654
Summary: Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we describe how to mimic a finite domain propagation engine, by mapping propagators into clauses in a SAT solver. This immediately results in strong nogoods for finite domain propagation. But a naive static translation is impractical except in limited cases. We show how to convert propagators to lazy clause generators for a SAT solver. The resulting system introduces flexibility in modelling since variables are modelled dually in the propagation engine and the SAT solver, and we explore various approaches to the dual modelling. We show that the resulting system solves many finite domain problems significantly faster than other techniques.

##### MSC:
 68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
##### Keywords:
finite domain propagation; Boolean variables; SAT solver
##### Software:
cc(FD); Chaff; Gecode; MiniSat; SOFT; Sugar; zChaff
Full Text:
##### References:
 [1] Ansótegui, C., & Manyá, F. (2004). Mapping problems with finite-domain variables into problems with Boolean variables. In Proceedings of the seventh international conference on theory and applications of satisfiability testing (SAT’04). LNCS (Vol. 3542, pp. 1–15). · Zbl 1122.68582 [2] Bailleux, O., & Boufkhad, Y. (2003). Efficient CNF encoding of Boolean cardinality constraints. In F. Rossi (Ed.), Proceedings of the 9th international conference on principles and practice of constraint programming (CP2003). LNCS (Vol. 2833, pp. 108–122). · Zbl 1273.68332 [3] Barcelogic for SMT. www.lsi.upc.es/liveras/bclt-main.html . Accessed 07 February. [4] Benchmarks for Lazy Clause Generation. http://www.cs.mu.oz.au/$$\sim$$olgao/benchmarks.htm . Accessed 07 December. [5] Cabon, B., de Givrey, S., Lobjois, L., Schiex, T., & Warners, L.P. (1999). Radio link frequency assignment. Constraints, 4(1), 78–89. · Zbl 1020.94500 · doi:10.1023/A:1009812409930 [6] Choi, C.W., Lee, J.H.M., & Stuckey, P.J. (2003). Propagation redundancy in redundant modelling. In F. Rossi (Ed.), Proceedings of the ninth international conference on principles and practices of constraint programming (CP2003). LNCS (Vol. 2833, pp. 229–243). · Zbl 1273.68340 [7] Choi, C.W., Lee, J.H.M., & Stuckey, P.J. (2007). Removing propagation redundant constraints in redundant modeling. ACM Transactions on Computational Logic, 8(4), article 23. · Zbl 1367.68262 [8] Crawford, J., & Baker, A. (1994). Experimental results on the application of satisfiability algorithms to scheduling problems. In Proceedings of the 12th national conference on artificial intelligence (AAAI’94) (pp. 1092–1097). [9] Cryptarithmetic puzzles. http://www.tkcs-collins.com/truman/alphamet/alphamet.shtml . Accessed 07 December. [10] CSP competition (2006). http://cpai.ucc.ie/06/Competition.html . Accessed 07 June. [11] CSP2SAT. http://bach.istc.kobe-u.ac.jp/csp2sat/ . 06 December. [12] Davis, M., Logemman, G., & Loveland, D. (1962). A machine program for theorem proving. Communications of the ACM, 5(7), 394–397. · Zbl 0217.54002 · doi:10.1145/368273.368557 [13] Dechter, R. (2003). Constraint processing. San Francisco: Morgan Kaufmann. · Zbl 1057.68114 [14] Eén, N., & Sörensson, N. (2006). Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2, 1–26. · Zbl 1116.68083 [15] Gent, I. P. (2002). Arc consistency in SAT. In Proceedings of the 15th Eureopean conference on artificial intelligence, ECAI’2002, Lyon, France, July 2002 (pp. 121–125). [16] GECODE. www.gecode.org . Accessed 07 February. [17] Hawkins, P., & Stuckey, P.J. (2006). A hybrid BDD and SAT finite domain constraint solver. In P. Van Hentenryck (Ed.), Proceedings of the practical applications of declarative programming (PADL’06). LNCS (Vol. 3819, pp. 103–117). [18] Kasif, S. (1990). On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence, 45, 275–286. · Zbl 0717.68043 · doi:10.1016/0004-3702(90)90009-O [19] Katsirelos, G., & Bacchus, F. (2003). Unrestricted nogood recording in CSP search. In F. Rossi (Ed.), Proceedings of the 9th international conference on principles and practice of constraint programming (CP2003). LNCS (Vol. 2833, pp. 873–877). [20] Katsirelos, G., & Bacchus, F. (2005). Generalized nogoods in CSPs. In The twentieth national conference on artificial intelligence (AAAI’05) (pp. 390–396). [21] Kautz, H.A., & Selman, B. (1992). Planning as satisfiability. In Proceedings of the tenth European conference on artificial intelligence (ECAI’92) (pp. 359–363). [22] Laborie, P. (2005). Complete MCS-based search: Application to resource constrained project scheduling. In Proceedings of the nineteenth international joint conference on artificial intelligence (IJCAI’05) (pp. 181–186). [23] Lsencode. http://www.cs.cornell.edu/gomes/SOFT/lsencode-v1.1.tar.Z/ . Accessed 07 November. [24] Marriott, K., & Stuckey, P.J. (1998). Programming with constraints: An introduction. Cambridge: MIT. · Zbl 0935.68098 [25] Minion. minion.sourceforge.net . Accessed 07 Feb. [26] MiniSat. www.cs.chalmers.se/Cs/Resarch/FormalMethods/MiniSat/ . Accessed 06 December. [27] Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT solver. In Proceedings of 38th conference on design automation (DAC’01) (pp. 530–535). [28] Niewenhuis, R., Oliveras, A., & Tinelli, C. (2004). Abstract DPLL and abstract DPLL modulo theories. In Proceedings of the 11th international conference on logic for programming artificial intelligence and reasoning (LPAR’04). LNAI (Vol. 3452, pp. 36–50) · Zbl 1109.68097 [29] Ohrimenko, O., & Stuckey, P.J. (2008). Modelling for lazy clause generation. In J. Harland, & P. Manyem (Eds.), Proceedings of the fourteenth computing: The Australasian theory symposium (CATS 2008). CRPIT (Vol. 77, pp. 27–38) [30] Ohrimenko, O., Stuckey, P.J., & Codish, M. (2007). Propagation = lazy clause generation. In C. Bessiere (Ed.), Proceedings of the 13th international conference on principles and practice of constraint programming. LNCS (Vol. 4741, pp. 544–558) · Zbl 1145.68527 [31] Roussel, O. (2005). Some notes on the implementation of csp2sat+zchaff, a sim- ple translator from CSP to SAT. In Proceedings of the 2nd international workshop on constraint propagation and implementation (pp. 83–88). [32] Schulte, C., & Tack, G. (2005). Views and iterators for generic constraint implementations. In P. van Beek (Ed.), Proceedings of the 11th international conference on principles and practice of constraint programming (CP 2005). Lecture notes in computer science (Vol. 3709, pp. 817–821). · Zbl 1180.68103 [33] Tamura, N., Taga, A., Kitagawa, S., Banbara, M. (2006). Compiling finite linear CSP to SAT. In F. Benhamou (Ed.), Proceedings of 12th international conference on principles and practice of constraint programming (CP2006). LNCS (Vol. 4204, pp. 590–603). · Zbl 1160.68567 [34] Van Hentenryck, P., Saraswat, V., & Deville, Y. (1998). Design, implementation and evaluation of the constraint language cc(FD). Journal of Logic Programming, 37(1–3), 139–164. · Zbl 0920.68026 · doi:10.1016/S0743-1066(98)10006-7 [35] Walsh, T. (2000). SAT v CSP. In R. Dechter (Ed.), Proceedings of 6th international conference on principles and practice of constraint programming (CP2000). LNCS (Vol. 1894, pp. 441–456). · Zbl 1044.68808
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.