68 search results - page 1 / 14 » Resolution Tunnels for Improved SAT Solver Performance |
SAT
2005
Springer
13 years 10 months ago
2005
Springer
SAT
2004
Springer
13 years 10 months ago
2004
Springer
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...
CP
2009
Springer
14 years 5 months ago
2009
Springer
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
SAT
2009
Springer
13 years 11 months ago
2009
Springer
Most current propositional SAT solvers apply resolution at various stages to derive new clauses or simplify existing ones. The former happens during conflict analysis, while the l...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...