Configuration Checking with Aspiration in Local Search for SAT

An interesting strategy called configuration checking (CC) was recently proposed to handle the cycling problem in local search for Minimum Vertex Cover. A natural question is whether this CC also works SAT. The direct application of did not result stochastic (SLS) algorithms that can compete with current best SLS In paper, we propose a new heuristic based on SAT, which aspiration (CCA). It used develop algorithm Swcca. experiments random 3-SAT instances show Swcca significantly outperforms Sparrow2011, winner satisfiable category SAT Competition 2011, considered be solver instances. Moreover, structured competitive Sattime, crafted benchmark 2011.