27 search results - page 1 / 6 » Variable-Selection Heuristics in Local Search for SAT |
AAAI
1997
13 years 6 months ago
1997
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
SAT
2009
Springer
13 years 11 months ago
2009
Springer
CP
2010
Springer
13 years 3 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
AE
2007
Springer
13 years 11 months ago
2007
Springer
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
EC
2008
13 years 5 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...