Propagation = Lazy clause generation

Olga Ohrimenko, Peter J. Stuckey, Michael Codish

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

42 Scopus citations


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.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540749691, 9783540749691
StatePublished - 1 Jan 2007
Event13th International Conference on Principles and Practice of Constraint Programming, CP 2007 - Providence, RI, United States
Duration: 23 Sep 200727 Sep 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4741 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference13th International Conference on Principles and Practice of Constraint Programming, CP 2007
Country/TerritoryUnited States
CityProvidence, RI

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Propagation = Lazy clause generation'. Together they form a unique fingerprint.

Cite this