156 search results - page 7 / 32 » Another Complete Local Search Method for SAT |
IRI
2006
IEEE
14 years 1 months ago
2006
IEEE
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
IJCAI
2003
13 years 8 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
SAT
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
TIME
2002
IEEE
14 years 11 days ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...