6 search results - page 1 / 2 » Clause-Learning Algorithms with Many Restarts and Bounded-Wi... |
SAT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
IJCAI
2003
13 years 6 months ago
2003
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...
AAAI
2008
13 years 7 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...