610 search results - page 10 / 122 » Using SAT in QBF |
BIRTHDAY
2005
Springer
14 years 1 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...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the ...
CP
2009
Springer
14 years 8 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 ...
PDPTA
2003
13 years 9 months ago
2003
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are th...