Conflict-driven clause learning SAT solvers
One of the most important paradigm shifts in the use of SAT solvers for solving industrial
problems has been the introduction of clause learning. Clause learning entails adding a …
problems has been the introduction of clause learning. Clause learning entails adding a …
[PDF][PDF] Predicting learnt clauses quality in modern SAT solvers
Beside impressive progresses made by SAT solvers over the last ten years, only few works
tried to understand why Conflict Directed Clause Learning algorithms (CDCL) are so strong …
tried to understand why Conflict Directed Clause Learning algorithms (CDCL) are so strong …
An overview of parallel SAT solving
Boolean satisfiability (SAT) solvers are currently very effective in practice. However, there
are still many challenging problems for SAT solvers. Nowadays, extra computational power …
are still many challenging problems for SAT solvers. Nowadays, extra computational power …
ManySAT: a parallel SAT solver
In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described.
The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their …
The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their …
Boolean satisfiability solvers and their applications in model checking
Boolean satisfiability (SAT)-the problem of determining whether there exists an assignment
satisfying a given Boolean formula-is a fundamental intractable problem in computer …
satisfying a given Boolean formula-is a fundamental intractable problem in computer …
On the power of clause-learning SAT solvers as resolution engines
In this work, we improve on existing results on the relationship between proof systems
obtained from conflict-driven clause-learning SAT solvers and general resolution. Previous …
obtained from conflict-driven clause-learning SAT solvers and general resolution. Previous …
Minimizing learned clauses
N Sörensson, A Biere - … Conference on Theory and Applications of …, 2009 - Springer
Minimizing learned clauses is an effective technique to reduce memory usage and also
speed up solving time. It has been implemented in MiniSat since 2005 and is now adopted …
speed up solving time. It has been implemented in MiniSat since 2005 and is now adopted …
[PDF][PDF] Lingeling, plingeling, picosat and precosat at sat race 2010
A Biere - 2010 - cca.informatik.uni-freiburg.de
Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010 Page 1 Lingeling, Plingeling,
PicoSAT and PrecoSAT at SAT Race 2010 Armin Biere Institute for Formal Models and …
PicoSAT and PrecoSAT at SAT Race 2010 Armin Biere Institute for Formal Models and …
Control-based clause sharing in parallel SAT solving
The recent successes of SAT solvers in traditional hardware and software applications have
extended to important new domains. Today, they represent essential low-level reasoning …
extended to important new domains. Today, they represent essential low-level reasoning …
On the power of clause-learning SAT solvers with restarts
In this work, we improve on existing work that studied the relationship between the proof
system of modern SAT solvers and general resolution. Previous contributions such as those …
system of modern SAT solvers and general resolution. Previous contributions such as those …