A Method to Avoid Duplicative Flipping in Local Search for SAT

Stochastic perturbation on variable flipping is the key idea of local search for SAT. Observing that variables are flipped several times in an attempt to escape from a local minimum, this paper presents a duplication learning mechanism in stagnation stages to minimise duplicative variable flipping. The heuristic incorporates the learned knowledge into a variable weighting scheme to effectively prevent the search from selecting duplicative variables. Additionally, probability-based and time window smoothing techniques are adopted to eliminate the effects of redundant information. The integration of the heuristic and gNovelty+ was compared with the original solvers and other state-of-the-art local search solvers. The experimental results showed that the new solver outperformed other solvers on the full set of SAT 2011 competition instances and three sets of real-world verification problems.

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

[2]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[3]  Holger H. Hoos,et al.  An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.

[4]  Ofer Strichman,et al.  Theory and Applications of Satisfiability Testing – SAT 2010 , 2010, Lecture Notes in Computer Science.

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

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

[7]  Nicolas Barnier,et al.  Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .

[8]  Harry Zhang,et al.  Combining Adaptive Noise and Look-Ahead in Local Search for SAT , 2007, SAT.

[9]  Karem A. Sakallah,et al.  Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings , 2011, SAT.

[10]  Harry Zhang,et al.  Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT , 2008, CP.

[11]  F. Hutter,et al.  ParamILS: an automatic algorithm configuration framework , 2009 .

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

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

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

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

[16]  Zhe Wu,et al.  Trap Escaping Strategies in Discrete Lagrangian Methods for Solving Hard Satisfiability and Maximum Satisfiability Problems , 1999, AAAI/IAAI.

[17]  Joao Marques-Silva,et al.  Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings , 2007, SAT.

[18]  Bart Selman,et al.  Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .

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

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

[21]  Holger H. Hoos,et al.  Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.