GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability

Local search algorithms for satisfiability testing are still the best methods for a large number of problems, despite tremendous progresses observed on complete search algorithms over the last few years. However, their intrinsic limit does not allow them to address UNSAT problems. Ten years ago, this question challenged the community without any answer: was it possible to use local search algorithm for UNSAT formulae? We propose here a first approach addressing this issue, that can beat the best resolution-based completemethods. We define the landscape of the search by approximating the number of filtered clauses by resolution proof. Furthermore, we add high-level reasoning mechanism, based on Extended Resolution and Unit Propagation Look-Ahead to make this new and challenging approach possible. Our new algorithm also tends to be the first step on two other challenging problems: obtaining short proofs for UNSAT problems and build a real local-search algorithm for QBF.

[1]  Armin Biere,et al.  Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[2]  Wheeler Ruml,et al.  Complete Local Search for Propositional Satisfiability , 2004, AAAI.

[3]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[4]  Bart Selman,et al.  Ten Challenges in Propositional Reasoning and Search , 1997, IJCAI.

[5]  Laurent Simon,et al.  Preface to the Special Volume on the SAT 2005 Competitions and Evaluations , 2006, J. Satisf. Boolean Model. Comput..

[6]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[7]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[8]  Lintao Zhang.  On Subsumption Removal and On-the-Fly CNF Simplification , 2005, SAT.

[9]  Fahiem Bacchus,et al.  Enhancing Davis Putnam with extended binary clause reasoning , 2002, AAAI/IAAI.

[10]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[11]  Rina Dechter,et al.  Directional Resolution: The Davis-Putnam Procedure, Revisited , 1994, KR.

[12]  Thomas Stützle,et al.  Stochastic Local Search , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[13]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[14]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[15]  Inês Lynce,et al.  Local Search for Unsatisfiability , 2006, SAT.

[16]  Gilles Dequen,et al.  A backbone-search heuristic for efficient solving of hard 3-SAT formulae , 2001, IJCAI.

[17]  Hantao Zhang,et al.  Another Complete Local Search Method for SAT , 2005, LPAR.

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

[20]  Laurent Simon,et al.  Efficient Consequence Finding , 2001, IJCAI.

[21]  Daniel Le Berre.  Exploiting the real power of unit propagation lookahead , 2001, Electron. Notes Discret. Math..

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

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

[24]  Holger H. Hoos,et al.  Using Stochastic Local Search to Solve Quantified Boolean Formulae , 2003, CP.

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