5 search results - page 1 / 1 » Using CSP Look-Back Techniques to Solve Real-World SAT Insta... |
AAAI
1997
13 years 5 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
CP
2000
Springer
13 years 8 months ago
2000
Springer
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...
CP
2006
Springer
13 years 8 months ago
2006
Springer
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
CSCLP
2004
Springer
13 years 9 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
AI
2005
Springer
13 years 4 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...