@inproceedings{243bd26b4eeb4315af8e6b1505cfc619,
title = "Propagation = Lazy clause generation",
abstract = "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.",
author = "Olga Ohrimenko and Stuckey, {Peter J.} and Michael Codish",
year = "2007",
month = jan,
day = "1",
doi = "10.1007/978-3-540-74970-7_39",
language = "English",
isbn = "3540749691",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "544--558",
booktitle = "Principles and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings",
address = "Germany",
note = "13th International Conference on Principles and Practice of Constraint Programming, CP 2007 ; Conference date: 23-09-2007 Through 27-09-2007",
}