Extreme Cases in SAT Problems

With the increasing performance of SAT solvers, a lot of distinct problems, coming from very disparate fields, are added to the pool of Application problems, regularly used to rank solvers. These problems are also widely used to measure the positive impact of any new idea. We show in this paper that many of them have extreme behaviors that any SAT solvers must cope with. We show that, by adding a few, simple, human-readable, indicators, we can let Glucose choose between four strategies to show important improvements on the set of the hardest problems from all the competitions between 2002 and 2013 included. Moreover, once the SAT solver has been specialized, we show that a new restart polarity policy can improve even more the results. Without the first specialization step mentioned above, this new and effective policy would have been jugged inefficient. Our final Glucose is capable of solving \(20\,\%\) more problems than the original one, while speeding up also UNSAT answers.

[1]  Marijn J. H. Heule,et al.  March_dl: Adding Adaptive Heuristics and a New Branching Strategy , 2006, J. Satisf. Boolean Model. Comput..

[2]  Karem A. Sakallah,et al.  GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.

[3]  Marius Thomas Lindauer,et al.  A Portfolio Solver for Answer Set Programming: Preliminary Report , 2011, LPNMR.

[4]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[5]  Kevin Leyton-Brown,et al.  SATzilla: Portfolio-based Algorithm Selection for SAT , 2008, J. Artif. Intell. Res..

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

[7]  Yuri Malitsky,et al.  Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering , 2013, IJCAI.

[8]  Gilles Audemard,et al.  Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.

[9]  Laurent Simon,et al.  The Essentials of the SAT 2003 Competition , 2003, SAT.

[10]  Armin Biere,et al.  Inprocessing Rules , 2012, IJCAR.

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

[12]  Gilles Audemard,et al.  Refining Restarts Strategies for SAT and UNSAT , 2012, CP.

[13]  Adnan Darwiche,et al.  A Lightweight Component Caching Scheme for Satisfiability Solvers , 2007, SAT.

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

[15]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[16]  David Zuckerman,et al.  Optimal speedup of Las Vegas algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[17]  Maurizio Gabbrielli,et al.  SUNNY: a Lazy Portfolio Approach for Constraint Solving , 2014, Theory Pract. Log. Program..