Weight-Enhanced Diversification in Stochastic Local Search for Satisfiability

Intensification and diversification are the key factors that control the performance of stochastic local search in satisfiability (SAT). Recently, Novelty Walk has become a popular method for improving diversification of the search and so has been integrated in many well-known SAT solvers such as TNM and gNovelty+. In this paper, we introduce new heuristics to improve the effectiveness of Novelty Walk in terms of reducing search stagnation. In particular, we use weights (based on statistical information collected during the search) to focus the diversification phase onto specific areas of interest. With a given probability, we select the most frequently unsatisfied clause instead of a totally random one as Novelty Walk does. Amongst all the variables appearing in the selected clause, we then select the least flipped variable for the next move. Our experimental results show that the new weight-enhanced diversification method significantly improves the performance of gNovelty+ and thus outperforms other local search SAT solvers on a wide range of structured and random satisfiability benchmarks.

[1]  Bart Selman,et al.  Evidence for Invariants in Local Search , 1997, AAAI/IAAI.

[2]  John Thornton,et al.  Additive versus Multiplicative Clause Weighting for SAT , 2004, AAAI.

[3]  Holger H. Hoos,et al.  Captain Jack: New Variable Selection Heuristics in Local Search for SAT , 2011, SAT.

[4]  Kaile Su,et al.  Configuration Checking with Aspiration in Local Search for SAT , 2012, AAAI.

[5]  Yu Li,et al.  Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation) , 2012, SAT.

[6]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[7]  Abdul Sattar,et al.  Trap Avoidance in Local Search Using Pseudo-Conflict Learning , 2012, AAAI.

[8]  Holger H. Hoos,et al.  Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT , 2010, SAT.

[9]  Bart Selman,et al.  Accelerating Random Walks , 2002, CP.

[10]  Abdul Sattar,et al.  A Study of Local Minimum Avoidance Heuristics for SAT , 2012, ECAI.

[11]  Chu Min Li,et al.  Diversification and Determinism in Local Search for Satisfiability , 2005, SAT.

[12]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[13]  Abdul Sattar,et al.  Combining Adaptive and Dynamic Local Search for Satisfiability , 2008, J. Satisf. Boolean Model. Comput..

[14]  Abdul Sattar,et al.  A Method to Avoid Duplicative Flipping in Local Search for SAT , 2012, Australasian Conference on Artificial Intelligence.

[15]  Steven David Prestwich,et al.  Random Walk with Continuously Smoothed Variable Weights , 2005, SAT.

[16]  Harry Zhang,et al.  A Switching Criterion for Intensification and Diversification in Local Search for SAT , 2008, J. Satisf. Boolean Model. Comput..

[17]  Steven David Prestwich,et al.  SAT problems with chains of dependent variables , 2003, Discret. Appl. Math..

[18]  Adrian Balint,et al.  Improving Stochastic Local Search for SAT with a New Probability Distribution , 2010, SAT.

[19]  Marijn Heule,et al.  EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation , 2011, SAT.