On Continuous Local BDD-Based Search for Hybrid SAT Solving

12/14/2020
by   Anastasios Kyrillidis, et al.
2

We explore the potential of continuous local search (CLS) in SAT solving by proposing a novel approach for finding a solution of a hybrid system of Boolean constraints. The algorithm is based on CLS combined with belief propagation on binary decision diagrams (BDDs). Our framework accepts all Boolean constraints that admit compact BDDs, including symmetric Boolean constraints and small-coefficient pseudo-Boolean constraints as interesting families. We propose a novel algorithm for efficiently computing the gradient needed by CLS. We study the capabilities and limitations of our versatile CLS solver, GradSAT, by applying it on many benchmark instances. The experimental results indicate that GradSAT can be a useful addition to the portfolio of existing SAT and MaxSAT solvers for solving Boolean satisfiability and optimization problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/02/2019

FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints

The Boolean SATisfiability problem (SAT) is of central importance in com...
research
05/08/2022

DPMS: An ADD-Based Symbolic Approach for Generalized MaxSAT Solving

Boolean MaxSAT, as well as generalized formulations such as Min-MaxSAT a...
research
02/13/2018

REAS: Combining Numerical Optimization with SAT Solving

In this paper, we present ReaS, a technique that combines numerical opti...
research
04/24/2011

Boolean Equi-propagation for Optimized SAT Encoding

We present an approach to propagation based solving, Boolean equi-propag...
research
09/09/2011

Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability

This work focuses on improving state-of-the-art in stochastic local sear...
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
01/24/2023

Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints

Determining the satisfiability of Boolean constraint-satisfaction proble...

Please sign up or login with your details

Forgot password? Click here to reset