193 search results - page 6 / 39 » sat 2007 |
DATE
2007
IEEE
15 years 3 months ago
2007
IEEE
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
66
Voted
MST
2007
14 years 9 months ago
2007
In [Sch99], Sch¨oning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis depend...
CPAIOR
2007
Springer
15 years 3 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...
CAV
2007
Springer
15 years 3 months ago
2007
Springer
C32SAT is a tool for checking C expressions. It can check whether a given C expression can be satisfied, is tautological, or always defined according to the ISO C99 standard. C32...