Comprehensive Score: Towards Efficient Local Search for SAT with Long Clauses

It is widely acknowledged that stochastic local search (SLS) algorithms can efficiently find models of satisfiable formulae for the Boolean Satisfiability (SAT) problem. There has been much interest in studying SLS algorithms on random k-SAT instances. Compared to random 3-SAT instances which have special statistical properties rendering them easy to solve, random k-SAT instances with long clauses are similar to structured ones and remain very difficult. This paper is devoted to efficient SLS algorithms for random k-SAT instances with long clauses. By combining a novel variable property subscore with the commonly used property score, we design a scoring function named comprehensive score, which is utilized to develop a new SLS algorithm called CScoreSAT. The experiments show that CScoreSAT outperforms state-of-the-art SLS solvers, including the winners of recent SAT competitions, by one to two orders of magnitudes on large random 5-SAT and 7-SAT instances. In addition, CScoreSAT significantly outperforms its competitors on random k-SAT instances for each k = 4; 5; 6; 7 from SAT Challenge 2012, which indicates its robustness.

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

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

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

[4]  S Kirkpatrick,et al.  Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

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

[6]  Daniel Gall,et al.  Experiment design and administration for computer clusters for SAT-solvers (EDACC) , 2010, J. Satisf. Boolean Model. Comput..

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

[8]  Ashiqur R. KhudaBukhsh,et al.  SATenstein: automatically building local search SAT solvers from components , 2009, IJCAI 2009.

[9]  Toby Walsh,et al.  Handbook of satisfiability , 2009 .

[10]  Cesare Tinelli,et al.  Handbook of Satisfiability , 2021, Handbook of Satisfiability.

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

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

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

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

[15]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

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

[18]  Bart Selman,et al.  Incomplete Algorithms , 2021, Handbook of Satisfiability.

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

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

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

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

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

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