Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems

02/04/2014
by   Amit Metodi, et al.
0

We present an approach to propagation-based SAT encoding of combinatorial problems, Boolean equi-propagation, where constraints are modeled as Boolean functions which propagate information about equalities between Boolean literals. This information is then applied to simplify the CNF encoding of the constraints. A key factor is that considering only a small fragment of a constraint model at one time enables us to apply stronger, and even complete, reasoning to detect equivalent literals in that fragment. Once detected, equivalences apply to simplify the entire constraint model and facilitate further reasoning on other fragments. Equi-propagation in combination with partial evaluation and constraint simplification provide the foundation for a powerful approach to SAT-based finite domain constraint solving. We introduce a tool called BEE (Ben-Gurion Equi-propagation Encoder) based on these ideas and 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.

READ FULL TEXT
research
04/24/2011

Boolean Equi-propagation for Optimized SAT Encoding

We present an approach to propagation based solving, Boolean equi-propag...
research
05/12/2020

Yet Another Comparison of SAT Encodings for the At-Most-K Constraint

The at-most-k constraint is ubiquitous in combinatorial problems, and nu...
research
07/03/2019

Using binary decision diagrams for constraint handling in combinatorial interaction testing

Constraints among test parameters often have substantial effects on the ...
research
01/06/2021

A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints

Two major considerations when encoding pseudo-Boolean (PB) constraints i...
research
06/10/2020

At-Most-One Constraints in Efficient Representations of Mutex Networks

The At-Most-One (AMO) constraint is a special case of cardinality constr...
research
07/06/2020

Simulation-Guided Boolean Resubstitution

This paper proposes a new logic optimization paradigm based on circuit s...
research
03/18/2015

Exploration of the scalability of LocFaults

A model checker can produce a trace of counterexample, for an erroneous ...

Please sign up or login with your details

Forgot password? Click here to reset