A primary concern when using local search methods for CNF satisfiability is how to get rid of local minimas. Among many other heuristics, Weighting by Morris (1993) and Selman and Kautz (1993) works overwhelmingly better than others (Cha and Iwama 1995). Weighting increases the weight of each clause which is unsatisfied at a local minima. This paper introduces a more sophisticated weighting strategy, i.e., adding new clauses (ANC) that are unsatisfied at the local minima. As those new clauses, we choose resolvents of the clauses unsatisfied at the local minima and randomly selected neighboring clauses. The idea is that ANC is to make the slope of search space more smooth than the simple weighting. Experimental data show that ANC is faster than simple weighting: (i) When the number of variables is 200 or more, ANC is roughly four to ten times as fast as weighting in terms of the number of search steps. (ii) It might be more important that the divergence of computation time for each try is much smaller in ANC than in weighting. (iii) There are several possible reasons for ANC's superiority, one of which is that ANC returns the same local minima much less frequently than weighting.
[1]
Jun Gu,et al.
Efficient local search for very large-scale satisfiability problems
,
1992,
SGAR.
[2]
Byungki Cha,et al.
Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas
,
1995,
IJCAI.
[3]
Bart Selman,et al.
An Empirical Study of Greedy Local Search for Satisfiability Testing
,
1993,
AAAI.
[4]
Paul Morris,et al.
The Breakout Method for Escaping from Local Minima
,
1993,
AAAI.
[5]
Bart Selman,et al.
Local search strategies for satisfiability testing
,
1993,
Cliques, Coloring, and Satisfiability.
[6]
Hector J. Levesque,et al.
A New Method for Solving Hard Satisfiability Problems
,
1992,
AAAI.
[7]
Yuichi Asahiro,et al.
Random generation of test instances with controlled attributes
,
1993,
Cliques, Coloring, and Satisfiability.