61 search results - page 1 / 13 » A Clause-Based Heuristic for SAT Solvers |
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We propose a new decision heuristic for DPLL-based propositional SAT solvers. Its essence is that both the initial and the conflict clauses are arranged in a list and the next deci...
IEEEHPCS
2010
13 years 3 months ago
2010
This work presents the design and implementation of a massively parallel 3-SAT solver, specifically targeting random problem instances. Our approach is deterministic and features ...
MTV
2003
IEEE
13 years 10 months ago
2003
IEEE
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of f...
ACMSE
2006
ACM
13 years 10 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
CP
2010
Springer
13 years 3 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...