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

page 1

page 2

page 3

page 4

research
02/04/2014

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

We present an approach to propagation-based SAT encoding of combinatoria...
research
12/14/2020

On Continuous Local BDD-Based Search for Hybrid SAT Solving

We explore the potential of continuous local search (CLS) in SAT solving...
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
02/13/2018

REAS: Combining Numerical Optimization with SAT Solving

In this paper, we present ReaS, a technique that combines numerical opti...
research
07/06/2020

Simulation-Guided Boolean Resubstitution

This paper proposes a new logic optimization paradigm based on circuit s...
research
10/15/2021

SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints

When solving a combinatorial problem using propositional satisfiability ...
research
07/02/2019

Core First Unit Propagation

Unit propagation (which is called also Boolean Constraint Propagation) h...

Please sign up or login with your details

Forgot password? Click here to reset