100 search results - page 3 / 20 » sat 2005 |
176
click to vote
BIRTHDAY
2005
Springer
15 years 11 months ago
2005
Springer
Propositional reasoning (SAT) is an essential part of many reasoning tasks. Many problems in computer science can be compiled to SAT and then effectively decided using state-of-th...
145
Voted
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SMT). In particular, based on our k of Abstract DPLL and Abstract DPLL modulo Theories, we e...
130
Voted
SAT
2005
Springer
15 years 11 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...
128
click to vote
SAT
2005
Springer
15 years 11 months ago
2005
Springer
We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ) which incorporate original data structures and inference rules, and a lower bound of better quality.
127
click to vote
HVC
2005
Springer
15 years 11 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...