100 search results - page 4 / 20 » sat 2005 |
SAT
2009
Springer
14 years 24 days ago
2009
Springer
Minimizing learned clauses is an effective technique to reduce memory usage and also speed up solving time. It has been implemented in MINISAT since 2005 and is now adopted by mos...
COCO
2005
Springer
13 years 11 months ago
2005
Springer
JSAT
2006
13 years 6 months ago
2006
The first evaluation of pseudo-Boolean solvers was organized as a subtrack of the SAT 2005 competition. The first goal of this event is to take a snapshot of the current state of ...
ASP
2005
Springer
13 years 11 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
SAT
2005
Springer
13 years 11 months ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...