Clause States Based Configuration Checking in Local Search for Satisfiability

Two-mode stochastic local search (SLS) and focused random walk (FRW) are the two most influential paradigms of SLS algorithms for the propositional satisfiability (SAT) problem. Recently, an interesting idea called configuration checking (CC) was proposed to handle the cycling problem in SLS. The CC idea has been successfully used to improve SLS algorithms for SAT, resulting in state-of-the-art solvers. Previous CC strategies for SAT are based on neighboring variables, and prove successful in two-mode SLS algorithms. However, this kind of neighboring variables based CC strategy is not suitable for improving FRW algorithms. In this paper, we propose a new CC strategy which is based on clause states. We apply this clause states based CC (CSCC) strategy to both two-mode SLS and FRW paradigms. Our experiments show that the CSCC strategy is effective on both paradigms. Furthermore, our developed FRW algorithms based on CSCC achieve state-of-the-art performance on a broad range of random SAT benchmarks.

[1]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[2]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[3]  Paul W. Purdom,et al.  Solving Satisfiability with Less Searching , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[5]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[6]  C.H. Papadimitriou,et al.  On selecting a satisfying truth assignment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[8]  Jun Gu,et al.  Local search for satisfiability (SAT) problem , 1993, IEEE Trans. Syst. Man Cybern..

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

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

[11]  Lakhdar Sais,et al.  Tabu Search for SAT , 1997, AAAI/IAAI.

[12]  Thomas Stützle,et al.  Systematic vs. Local Search for SAT , 1999, KI.

[13]  Zhe Wu,et al.  An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems , 2000, AAAI/IAAI.

[14]  Roberto Battiti,et al.  Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.

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

[16]  Thomas Stützle,et al.  Iterated Robust Tabu Search for MAX-SAT , 2003, Canadian Conference on AI.

[17]  Thomas Stützle,et al.  Local Search Algorithms for SAT: An Empirical Evaluation , 2000, Journal of Automated Reasoning.

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

[19]  Erik Aurell,et al.  Comparing Beliefs, Surveys, and Random Walks , 2004, NIPS.

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

[21]  Bernd Becker,et al.  Speedup Techniques Utilized in Modern SAT Solvers , 2005, SAT.

[22]  Riccardo Zecchina,et al.  Survey propagation: An algorithm for satisfiability , 2002, Random Struct. Algorithms.

[23]  Ke Xu,et al.  A Simple Model to Generate Hard Satisfiable Instances , 2005, IJCAI.

[24]  Luca Di Gaspero,et al.  A composite-neighborhood tabu search approach to the traveling tournament problem , 2007, J. Heuristics.

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

[26]  Ke Xu,et al.  Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..

[27]  Emile H. L. Aarts,et al.  Theoretical aspects of local search , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

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

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

[30]  Abdul Sattar,et al.  Local search with edge weighting and configuration checking heuristics for minimum vertex cover , 2011, Artif. Intell..

[31]  Kaile Su,et al.  Local Search with Configuration Checking for SAT , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[32]  Armin Biere,et al.  Simulating Circuit-Level Simplifications on CNF , 2011, Journal of Automated Reasoning.

[33]  Satya Gautam Vadlamudi,et al.  $\hbox{MAWA}^{\ast}$—A Memory-Bounded Anytime Heuristic-Search Algorithm , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[35]  Armin Biere.  Lingeling and Friends at the SAT Competition 2011 , 2011 .

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

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

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

[39]  Uwe Schöning,et al.  Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break , 2012, SAT.

[40]  Kaile Su,et al.  Improving Local Search for Random 3-SAT Using Quantitative Configuration Checking , 2012, ECAI.

[41]  Kaile Su,et al.  Local search for Boolean Satisfiability with configuration checking and subscore , 2013, Artif. Intell..

[42]  Guowu Yang,et al.  Complete Boolean Satisfiability Solving Algorithms Based on Local Search , 2013, Journal of Computer Science and Technology.

[43]  Kaile Su,et al.  Improving WalkSAT for Random k-Satisfiability Problem with k > 3 , 2013, AAAI.

[44]  Xiang Li,et al.  Towards a Snowdrift Game Optimization to Vertex Cover of Networks , 2013, IEEE Transactions on Cybernetics.

[45]  Wei Wu,et al.  Focused Random Walk with Configuration Checking and Break Minimum for Satisfiability , 2013, CP.

[46]  Kaile Su,et al.  More efficient two-mode stochastic local search for random 3-satisfiability , 2014, Applied Intelligence.

[47]  Wei Wu,et al.  Double Configuration Checking in Stochastic Local Search for Satisfiability , 2014, AAAI.

[48]  Jian Zhuang,et al.  Combining Crowding Estimation in Objective and Decision Space With Multiple Selection and Search Strategies for Multi-Objective Evolutionary Optimization , 2014, IEEE Transactions on Cybernetics.

[49]  Wei Wu,et al.  CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability , 2015, IEEE Transactions on Computers.