DeepAI AI Chat
Log In Sign Up

Integrating Conflict Driven Clause Learning to Local Search

10/07/2009
by   Gilles Audenard, et al.
cril.fr
0

This article introduces SatHyS (SAT HYbrid Solver), a novel hybrid approach for propositional satisfiability. It combines local search and conflict driven clause learning (CDCL) scheme. Each time the local search part reaches a local minimum, the CDCL is launched. For SAT problems it behaves like a tabu list, whereas for UNSAT ones, the CDCL part tries to focus on minimum unsatisfiable sub-formula (MUS). Experimental results show good performances on many classes of SAT instances from the last SAT competitions.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/26/2010

Evolving difficult SAT instances thanks to local search

We propose to use local search algorithms to produce SAT instances which...
08/11/2020

Backjumping is Exception Handling

ISO Prolog provides catch and throw to realise the control flow of excep...
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...
03/27/2019

Local Search for Fast Matrix Multiplication

Laderman discovered a scheme for computing the product of two 3x3 matric...
05/07/2020

On the Effect of Learned Clauses on Stochastic Local Search

There are two competing paradigms in successful SAT solvers: Conflict-dr...
05/31/2017

Towards Learned Clauses Database Reduction Strategies Based on Dominance Relationship

Clause Learning is one of the most important components of a conflict dr...
06/01/2011

Backbone Fragility and the Local Search Cost Peak

The local search algorithm WSat is one of the most successful algorithms...