Propagation = lazy clause generation

Authors:
Olga Ohrimenko;Peter J. Stuckey;Michael Codish
Affiliations:
NICTA Victoria Research Lab, Department of Comp. Sci. and Soft. Eng., University of Melbourne, Australia;NICTA Victoria Research Lab, Department of Comp. Sci. and Soft. Eng., University of Melbourne, Australia;Department of Computer Science, Ben-Gurion University, Israel
Venue:
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Year:
2007

Citing 7
Cited 14

Experimental results on the application of satisfiability algorithms to scheduling problems

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Constraint Processing

Constraint Processing
Generalized nogoods in CSPs

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Complete MCS-based search: application to resource constrained project scheduling

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling finite linear CSP into SAT

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A hybrid BDD and SAT finite domain constraint solver

PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages

Modelling for lazy clause generation

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Propagation via lazy clause generation

Constraints
Decompositions of all different, global cardinality and related constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Flexible, rule-based constraint model linearisation

PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
Lazy clause generation reengineered

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Why cumulative decomposition is not as bad as it sounds

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Decomposition of the NVALUE constraint

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A complete multi-valued SAT solver

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Fast set bounds propagation using a BDD-SAT hybrid

Journal of Artificial Intelligence Research
Explaining the cumulative propagator

Constraints
Lazy explanations for constraint propagators

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Lynx: a programmatic SAT solver for the RNA-folding problem

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Inter-instance nogood learning in constraint programming

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Improving combinatorial optimization: extended abstract

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.