Propagation via 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, Melbourne, Australia;NICTA Victoria Research Lab, Department of Comp. Sci. and Soft. Eng., University of Melbourne, Melbourne, Australia;Department of Computer Science, Ben-Gurion University, Beersheba, Israel
Venue:
Constraints
Year:
2009

Citing 15
Cited 33

On the parallel complexity of discrete relaxation in constraint satisfaction networks

Artificial Intelligence
Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Experimental results on the application of satisfiability algorithms to scheduling problems

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Radio Link Frequency Assignment

Constraints
Constraint Processing

Constraint Processing
Removing propagation redundant constraints in redundant modeling

ACM Transactions on Computational Logic (TOCL)
Modelling for lazy clause generation

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
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
Propagation = lazy clause generation

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
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
Mapping problems with finite-domain variables to problems with boolean variables

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

A new o(n2log n) not-first/not-last pruning algorithm for cumulative resource constraints

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
Reducing chaos in SAT-like search: finding solutions close to a given one

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Optimal automatic table layout

Proceedings of the 11th ACM symposium on Document engineering
MDD propagators with explanation

Constraints
Optimal carpet cutting

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Boolean equi-propagation for optimized SAT encoding

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Exploiting subproblem dominance in constraint programming

Constraints
Using a SAT-solver to schedule sports leagues

Journal of Scheduling
Lazy clause generation: combining the power of SAT and CP (and MIP?) solving

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Rapid learning for binary programs

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Automatically exploiting subproblem equivalence in constraint programming

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A complete solution to the Maximum Density Still Life Problem

Artificial Intelligence
Symmetries and lazy clause generation

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Translation-based constraint answer set solving

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Solving constraint satisfaction problems with SAT modulo theories

Constraints
Explaining flow-based propagation

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Explaining propagators for s-DNNF circuits

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Maximising the net present value for resource-constrained project scheduling

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An empirical study of learning and forgetting constraints

AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
SAT and SMT are still resolution: questions and challenges

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A generic method for identifying and exploiting dominance relations

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Conflict directed lazy decomposition

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Towards solver-independent propagators

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Smchr: Satisfiability modulo constraint handling rules

Theory and Practice of Logic Programming
Solving RCPSP/max by lazy clause generation

Journal of Scheduling
Explaining alldifferent

ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
Inductive definitions in constraint programming

ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
There are no CNF problems

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
A constraint satisfaction approach for programmable logic detailed placement

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Satisfiability modulo constraint handling rules (extended abstract)

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

Constraints

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 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.