156 search results - page 1 / 32 » Another Complete Local Search Method for SAT |
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
CADE
1998
Springer
13 years 9 months ago
1998
Springer
The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satis abilit...
IJCAI
2007
13 years 6 months ago
2007
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
SAGA
2001
Springer
13 years 9 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...