An Adaptive Parallel SAT Solver

We present and evaluate AmPharoS, a new parallel SAT solver based on the divide and conquer paradigm. This solver, designed to work on a great number of cores, runs workers on sub-formulas restricted to cubes. In addition to classical clause sharing, it also exchange extra information associated to the cubes. Furthermore, we propose a new criterion to dynamically adapt both the amount of shared clauses and the number of cubes. Experiments show that, in general, AmPharoS correctly adjusts its strategy to the nature of the problem. Thus, we show that our new parallel approach works well and opens a broad range of possibilities to boost parallel SAT solver performances.

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

[2]  Armin Biere.  Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013 , 2013 .

[3]  Gilles Audemard,et al.  An Effective Distributed D&C Approach for the Satisfiability Problem , 2014, 2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing.

[4]  Alexander Nadel,et al.  Efficient SAT Solving under Assumptions , 2012, SAT.

[5]  Alexander A. Semenov,et al.  Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem , 2015, PaCT.

[6]  Bernd Becker,et al.  PaMiraXT: Parallel SAT Solving with Threads and Message Passing , 2009, J. Satisf. Boolean Model. Comput..

[7]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[8]  Claude Castelluccia,et al.  Extending SAT Solvers to Cryptographic Problems , 2009, SAT.

[9]  Richard Wolski,et al.  The GridSAT portal: a Grid Web‐based portal for solving satisfiability problems using the national cyberinfrastructure , 2007, Concurr. Comput. Pract. Exp..

[10]  Armin Biere.  Yet another Local Search Solver and Lingeling and Friends Entering the SAT Competition 2014 , 2014 .

[11]  Armin Biere,et al.  Factoring Out Assumptions to Speed Up MUS Extraction , 2013, SAT.

[12]  Lakhdar Sais,et al.  Diversification and Intensification in Parallel SAT Solving , 2010, CP.

[13]  Peter Sanders,et al.  HordeSat: A Massively Parallel Portfolio SAT Solver , 2015, SAT.

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

[15]  Ofer Strichman,et al.  Bounded model checking , 2003, Adv. Comput..

[16]  Maria Paola Bonacina,et al.  PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems , 1996, J. Symb. Comput..

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

[18]  Armin Biere,et al.  Concurrent Cube-and-Conquer - (Poster Presentation) , 2012, SAT.

[19]  Lakhdar Sais,et al.  On Freezing and Reactivating Learnt Clauses , 2011, SAT.

[20]  Jussi Rintanen.  Planning and SAT , 2009, Handbook of Satisfiability.

[21]  Gilles Audemard,et al.  Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction , 2013, SAT.

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

[23]  Inês Lynce,et al.  Towards efficient MUS extraction , 2012, AI Commun..

[24]  Nachum Dershowitz,et al.  Parallel Multithreaded Satisfiability Solver: Design and Implementation , 2005, PDMC.

[25]  Peter J. Stuckey,et al.  PMiniSat - A parallelization of MiniSat 2.0 , 2008 .

[26]  Lakhdar Sais,et al.  ManySAT: a Parallel SAT Solver , 2009, J. Satisf. Boolean Model. Comput..

[27]  Vasco M. Manquinho,et al.  Improving Search Space Splitting for Parallel SAT Solving , 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.

[28]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002, Discret. Appl. Math..

[29]  Gilles Audemard,et al.  Revisiting Clause Exchange in Parallel SAT Solving , 2012, SAT.

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

[31]  Jean-Marie Lagniez,et al.  Dynamic Polarity Adjustment in a Parallel SAT Solver , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[32]  Armin Biere,et al.  Blocked Clause Elimination , 2010, TACAS.

[33]  Gilles Audemard,et al.  Just-In-Time Compilation of Knowledge Bases , 2013, IJCAI.

[34]  Lakhdar Sais,et al.  Control-Based Clause Sharing in Parallel SAT Solving , 2009, IJCAI.

[35]  Gilles Audemard,et al.  Lazy Clause Exchange Policy for Parallel SAT Solvers , 2014, SAT.

[36]  Armin Biere,et al.  Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads , 2011, Haifa Verification Conference.

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

[38]  Ilkka Niemelä,et al.  Partitioning SAT Instances for Distributed Solving , 2010, LPAR.

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

[40]  Armin Biere,et al.  Bounded model checking , 2003, Adv. Comput..