NLocalSAT: Boosting Local Search with Solution Prediction

by   Wenjie Zhang, et al.
State Key Laboratory of Computer Science, Institute
Peking University

The boolean satisfiability problem is a famous NP-complete problem in computer science. An effective way for this problem is the stochastic local search (SLS). However, in this method, the initialization is assigned in a random manner, which impacts the effectiveness of SLS solvers. To address this problem, we propose NLocalSAT. NLocalSAT combines SLS with a solution prediction model, which boosts SLS by changing initialization assignments with a neural network. We evaluated NLocalSAT on five SLS solvers (CCAnr, Sparrow, CPSparrow, YalSAT, and probSAT) with problems in the random track of SAT Competition 2018. The experimental results show that solvers with NLocalSAT achieve 27


page 1

page 2

page 3

page 4


Using deep learning to construct stochastic local search SAT solvers with performance bounds

The Boolean Satisfiability problem (SAT) is the most prototypical NP-com...

Hybrid DCOP Solvers: Boosting Performance of Local Search Algorithms

We propose a novel method for expediting both symmetric and asymmetric D...

On Improving Local Search for Unsatisfiability

Stochastic local search (SLS) has been an active field of research in th...

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

The Boolean SATisfiability problem (SAT) is of central importance in com...

Towards an Understanding of Long-Tailed Runtimes of SLS Algorithms

The satisfiability problem is one of the most famous problems in compute...

A Probabilistic Approach to Satisfiability of Propositional Logic Formulae

We propose a version of WalkSAT algorithm, named as BetaWalkSAT. This me...

Evidence for Long-Tails in SLS Algorithms

Stochastic local search (SLS) is a successful paradigm for solving the s...

Please sign up or login with your details

Forgot password? Click here to reset