137 search results - page 5 / 28 » Heuristic Backtracking Algorithms for SAT |
AAAI
2007
13 years 10 months ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
SC
2003
ACM
14 years 1 months ago
2003
ACM
We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT problem instances using a large number of widely distributed and heterogeneous...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
ICCAD
1996
IEEE
14 years 3 days ago
1996
IEEE
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed searchp...