Boolean equi-propagation for optimized SAT encoding

Authors:
Amit Metodi;Michael Codish;Vitaly Lagoon;Peter J. Stuckey
Affiliations:
Department of Computer Science, Ben Gurion University of the Negev, Israel;Department of Computer Science, Ben Gurion University of the Negev, Israel;Cadence Design Systems;Department of Computer Science and Software Engineering, and NICTA Victoria Laboratory, The University of Melbourne, Australia
Venue:
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Year:
2011

Citing 14
Cited 3

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Experimental results on the application of satisfiability algorithms to scheduling problems

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Equivalent literal propagation in the DLL procedure

Discrete Applied Mathematics - The renesse issue on satisfiability
Universal Booleanization of Constraint Models

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Compiling finite linear CSP into SAT

Constraints
Propagation via lazy clause generation

Constraints
MINION: A Fast, Scalable, Constraint Solver

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Compiling problem specifications into SAT

Artificial Intelligence - Special volume on reformulation
MiniZinc: towards a standard CP modelling language

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Lazy clause generation reengineered

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Effective preprocessing in SAT through variable and clause elimination

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A system for solving constraint satisfaction problems with SMT

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing

Compiling finite domain constraints to sat with bee*

Theory and Practice of Logic Programming
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems

Journal of Artificial Intelligence Research
Breaking symmetries in graph representation

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach to propagation based SAT encoding, Boolean equi-propagation, where constraints are modelled as Boolean functions which propagate information about equalities between Boolean literals. This information is then applied as a form of partial evaluation to simplify constraints prior to their encoding as CNF formulae. We demonstrate for a variety of benchmarks that our approach leads to a considerable reduction in the size of CNF encodings and subsequent speed-ups in SAT solving times.