Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT

One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in which non-weighting algorithm adaptG2WSAT+ selects a variable to flip, as heuristic adaptG2WSAT+, the way in which clause weighting algorithm RSAPSselects a variable to flip, as heuristic RSAPS, and the way in which variable weighting algorithm VWselects a variable to flip, as heuristic VW. We propose a new switching criterion: the evenness or unevenness of the distribution of clause weights. We apply this criterion, along with another switching criterion previously proposed, to heuristic adaptG2WSAT+, heuristic RSAPS, and heuristic VW. The resulting local search algorithm, which adaptively switches among these three heuristics in every search step according to these two criteria to intensify or diversify the search when necessary, is called NCVW(Non-, Clause, and Variable Weighting). Experimental results show that NCVWis generally effective on a wide range of instances while adaptG2WSAT+, RSAPS, VW, and gNovelty+ and adaptG2WSAT0, which won the gold and silver medals in the satisfiable random category in the SAT 2007 competition, respectively, are not.

[1]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[2]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[3]  Luc Lamontagne,et al.  Case-Based Reasoning Research and Development , 1997, Lecture Notes in Computer Science.

[4]  Holger H. Hoos,et al.  On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT , 1999, AAAI/IAAI.

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

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

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

[8]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

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

[10]  Edward A. Hirsch,et al.  UnitWalk: A new SAT solver that uses local search guided by unit clause elimination , 2005, Annals of Mathematics and Artificial Intelligence.

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

[12]  Eugene C. Freuder,et al.  Using CBR to Select Solution Strategies in Constraint Programming , 2005, ICCBR.

[13]  Christian Bessière.  Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings , 2007, CP.

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

[15]  Kevin Leyton-Brown,et al.  : The Design and Analysis of an Algorithm Portfolio for SAT , 2007, CP.

[16]  Chu Min Li,et al.  Deterministic and Random Selection of Variables in Local Search for SAT , 2007 .

[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]  Harry Zhang,et al.  A Switching Criterion for Intensification and Diversification in Local Search for SAT , 2008, J. Satisf. Boolean Model. Comput..