29 search results - page 2 / 6 » Complete Local Search for Propositional Satisfiability |
98
Voted
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
AUSAI
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
106
click to vote
JSAT
2008
14 years 11 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
144
click to vote
TAINN
2005
Springer
15 years 5 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
100
click to vote
LPAR
2005
Springer
15 years 5 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...