Propagation = Lazy Clause Generation

  • Olga Ohrimenko
  • Peter J. Stuckey
  • Michael Codish
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4741)


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 we can 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 we can convert propagators to lazy clause generators for a SAT solver. The resulting system can solve scheduling problems significantly faster than generating the clauses from scratch, or using Satisfiability Modulo Theories solvers with difference logic.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Choi, C.W., Lee, J.H.M., Stuckey, P.J.: Propagation redundancy in redundant modelling. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 229–243. Springer, Heidelberg (2003)Google Scholar
  2. 2.
    Crawford, J., Baker, A.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Procs. AAAI 1994, pp. 1092–1097 (1994)Google Scholar
  3. 3.
    CSP2SAT: (December 2006),
  4. 4.
    Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)Google Scholar
  5. 5.
    Barcelogic for SMT: (February 2007),
  6. 6.
    GECODE: (February 2007),
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Katsirelos, G., Bacchus, F.: Generalized nogoods in CSPs. In: The Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 390–396 (2005)Google Scholar
  10. 10.
    Laborie, P.: Complete MCS-Based Search: Application to Resource Constrained Project Scheduling. In: Proceedings IJCAI 2005, pp. 181–186 (2005)Google Scholar
  11. 11.
    Marriott, K., Stuckey, P.J.: Programming with Constraints: an Introduction. MIT Press, Cambridge (1998)MATHGoogle Scholar
  12. 12.
  13. 13.
    Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of DAC 2001 (2001)Google Scholar
  14. 14.
    Niewenhuis, R., Oliveras, A., Tinelli, C.: Abstract DPLL and abstract DPLL modulo theories. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 36–50. Springer, Heidelberg (2005)Google Scholar
  15. 15.
    Roussel, O.: 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 (2005)Google Scholar
  16. 16.
    Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP to SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 590–603. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  17. 17.
    Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation and evaluation of the constraint language cc(FD). JLP 37(1–3), 139–164 (1998)MATHCrossRefGoogle Scholar
  18. 18.
    Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441–456. Springer, Heidelberg (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Olga Ohrimenko
    • 1
  • Peter J. Stuckey
    • 1
  • Michael Codish
    • 2
  1. 1.NICTA Victoria Research Lab, Department of Comp. Sci. and Soft. Eng. University of MelbourneAustralia
  2. 2.Department of Computer Science, Ben-Gurion UniversityIsrael

Personalised recommendations