589 search results - page 3 / 118 » Local Search Algorithms for SAT: An Empirical Evaluation |
AAAI
1997
13 years 8 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...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and com...
JAR
2000
13 years 7 months ago
2000
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
ICTAI
2003
IEEE
14 years 19 days ago
2003
IEEE
Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping t...
AUSAI
2007
Springer
13 years 11 months ago
2007
Springer
Many real-world problems are over-constrained and require search techniques adapted to optimising cost functions rather than searching for consistency. This makes the MAX-SAT probl...