Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …

The propositional satisfiability (SAT) problem is one of the most fundamental problems in
computer science. SAT solvers have been successfully applied to a wide range of practical …

On practical applications, state-of-the-art SAT solvers dominantly use the conflict-driven
clause learning (CDCL) paradigm. An alternative for satisfiable instances is local search …

For the third consecutive year, a SAT competition was organized as a joint event with the
SAT conference. With 55 solvers from 25 author groups, the competition was a clear …

Local search is widely applied to satisfiable SAT problems, and on some classes
outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and …

Local search algorithms for satisfiability testing are still the best methods for a large number
of problems, despite tremendous progresses observed on complete search algorithms over …

The paper at hand presents a novel and generic approach on how to combine a SLS and a
DPLL solver to create an incomplete hybrid SAT solver. In our approach, the SLS solver gets …

Abstract Recent work on Stochastic Local Search (SLS) for the SAT and CSP domains has
shown the importance of a dynamic (non-markovian) strategy for weighting clauses in order …

Search restarts have shown great potential in speeding up SAT solvers based on the DPLL
procedure. However, most restart policies presented so far do not take the problem structure …

The Relation Between Complete and Incomplete Search Page 1 The Relation Between
Complete and Incomplete Search Steven Prestwich Cork Constraint Computation Centre …