45 search results - page 2 / 9 » Present and Future of Practical SAT Solving |
NIPS
2004
13 years 7 months ago
2004
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probabi...
CSCLP
2008
Springer
13 years 8 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
CP
2005
Springer
13 years 11 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
JSAT
2006
13 years 6 months ago
2006
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
JAR
2006
13 years 6 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...