Local Search with Configuration Checking for SAT

Local Search is an appealing method for solving the Boolean Satisfiability problem (SAT). However, this method suffers from the cycling problem which severely limits its power. Recently, a new strategy called configuration checking (CC) was proposed, for handling the cycling problem in local search. The CC strategy was used to improve a state-of-the-art local search algorithm for Minimum Vertex Cover. In this paper, we propose a novel local search strategy for the satisfiability problem, i.e., the CC strategy for SAT. The CC strategy for SAT takes into account the circumstances of the variables when selecting a variable to flip, where the circumstance of a variable refers to truth values of all its neighboring variables. We then apply it to design a local search algorithm for SAT called SWcc (Smoothed Weighting with Configuration Checking). Experimental results show that the CC strategy for SAT is more efficient than the previous strategy for handling the cycling problem called tabu. Moreover, SWcc significantly outperforms the best local search SAT solver in SAT Competition 2009 called TNM on large random 3-SAT instances.