68 search results - page 4 / 14 » Resolution Tunnels for Improved SAT Solver Performance |
188
click to vote
FROCOS
2011
Springer
14 years 3 months ago
2011
Springer
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...
151
Voted
JAIR
2007
15 years 4 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpli...
141
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
116
click to vote
DAC
2002
ACM
16 years 5 months ago
2002
ACM
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
128
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...