Improving WalkSAT for Random 3-SAT Problems

Stochastic local search (SLS) algorithms are well known for their ability to efficiently find models of random instances of the Boolean satisfiability (SAT) problems. One of the most famous SLS algorithms for SAT is called WalkSAT, which has wide influence and performs well on most of random 3-SAT instances. However, the performance of WalkSAT lags far behind on random 3-SAT instances equal to or greater than the phase transition ratio. Motivated by this limitation, in the present work, firstly an allocation strategy is introduced and utilized in WalkSAT to determine the initial assignment, leading to a new algorithm called WalkSATvav. The experimental results show that WalkSATvav significantly outperforms the state-of-the-art SLS solvers on random 3-SAT instances at the phase transition for SAT Competition 2017. However, WalkSATvav cannot rival its competitors on random 3-SAT instances greater than the phase transition ratio. Accordingly, WalkSATvav is further improved for such instances by utilizing a combination of an improved genetic algorithm and an improved ant colony algorithm, which complement each other in guiding the search direction. The resulting algorithm, called WalkSATga, is far better than WalkSAT and significantly outperforms some previous known SLS solvers on random 3-SAT instances greater than the phase transition ratio from SAT Competition 2017. Finally, a new SAT solver called WalkSATlg, which combines WalkSATvav and WalkSATga, is proposed, which is competitive with the winner of random satisfiable category of SAT competition 2017 on random 3-SAT problem.

[1]  Boris A. Trakhtenbrot,et al.  A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms , 1984, Annals of the History of Computing.

[2]  Bart Selman,et al.  An Empirical Study of Optimal Noise and Runtime Distributions in Local Search , 2010, SAT.

[3]  Gao Shang,et al.  Hybrid Algorithm Combining Ant Colony Optimization Algorithm with Genetic Algorithm , 2006, 2007 Chinese Control Conference.

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

[5]  Ming-Te Chao,et al.  Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem , 1986, SIAM J. Comput..

[6]  Zhang Yuan,et al.  The Empirical Study of the Schema Theory of Genetic Algorithm Based on 3-satisfiability Problem , 2015 .

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

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

[9]  Ye Li.  Ant Colony Algorithm Combined with Survey Propagation for Satisfiability Problem , 2012 .

[10]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

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

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

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

[14]  Joao Marques-Silva.  Practical applications of Boolean Satisfiability , 2008, 2008 9th International Workshop on Discrete Event Systems.

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

[16]  Oliver Gableske.  SAT solving with message passing , 2016 .

[17]  Wei Wu,et al.  Clause States Based Configuration Checking in Local Search for Satisfiability , 2015, IEEE Transactions on Cybernetics.

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

[19]  Ding Jian.  On the Combination of Genetic Algorithm and Ant Algorithm , 2003 .

[20]  Liang Dong.  AN EFFICIENT LOCAL SEARCH ALGORITHM FOR STRUCTURED SAT PROBLEMS , 1998 .

[21]  Yang Xu,et al.  An improved genetic algorithm for solving 3-SAT problems based on effective restart and greedy strategy , 2017, 2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE).

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

[23]  Ling Ying.  Genetic Algorithm for Solving SAT Problems Based on Learning Clause Weights , 2005 .

[24]  Dimitris Achlioptas,et al.  Random Satisfiability , 2009, Handbook of Satisfiability.

[25]  Yang Chenhui,et al.  A genetic-based local search method for SAT problem , 2016, 2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference.

[26]  Mohammed Moness,et al.  An Efficient Implementation of Ant Colony Optimization on GPU for the Satisfiability Problem , 2015, 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing.

[27]  Yu-an Zhang,et al.  A hybrid genetic algorithm to solve 3-SAT problem , 2016, 2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD).

[28]  Kevin Leyton-Brown,et al.  Predicting Satisfiability at the Phase Transition , 2012, AAAI.