61 search results - page 2 / 13 » A Clause-Based Heuristic for SAT Solvers |
HVC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. HaifaSat is a new SAT solver that is based on a new decision heuristic called Clause-Move-To-Front (CMTF), a new resolutionbased scoring strategy and many other improveme...
INFORMATICALT
2010
13 years 3 months ago
2010
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veri...
IJCNN
2007
IEEE
13 years 11 months ago
2007
IEEE
— Solvers for the Boolean satisfiability problem are an important base technology for many applications. The most efficient SAT solvers for industrial applications are based on...
SAT
2009
Springer
13 years 9 months ago
2009
Springer
Execution of most of the modern DPLL-based SAT solvers is guided by a number of heuristics. Decisions made during the search process are usually driven by some fixed heuristic pol...
SAT
2004
Springer
13 years 10 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...