Boolean Equi-propagation for Optimized SAT Encoding

04/24/2011
by   Amit Metodi, et al.
0

We present an approach to propagation based solving, Boolean equi-propagation, where constraints are modelled as propagators of information about equalities between Boolean literals. Propagation based solving applies this information as a form of partial evaluation resulting in optimized SAT encodings. We demonstrate for a variety of benchmarks that our approach results in smaller CNF encodings and leads to speed-ups in solving times.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset