Non-Portfolio Approaches for Distributed Maximum Satisfiability

The most successful parallel SAT and MaxSAT solvers follow a portfolio approach, where each thread applies a different algorithm (or the same algorithm configured differently) to solve a given problem instance. The main goal of building a portfolio is to diversify the search process being carried out by each thread. As soon as one thread finishes, the instance can be deemed solved. In this paper we present a new open source distributed solver for MaxSAT solving that addresses two issues commonly found in multicore parallel solvers, namely memory contention and scalability. Preliminary results show that our nonportfolio distributed MaxSAT solver outperforms its sequential version and is able to solve more instances in several instance sets as the number of processes increases.

[1]  Joao Marques-Silva,et al.  Automated Design Debugging With Maximum Satisfiability , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[3]  Joao Marques-Silva,et al.  Core-Guided MaxSAT with Soft Cardinality Constraints , 2014, International Conference on Principles and Practice of Constraint Programming.

[4]  Olivier Bailleux,et al.  Efficient CNF Encoding of Boolean Cardinality Constraints , 2003, CP.

[5]  Maria Luisa Bonet,et al.  Improving WPM2 for (Weighted) Partial MaxSAT , 2013, CP.

[6]  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.

[7]  Nina Narodytska,et al.  Maximum Satisfiability Using Core-Guided MaxSAT Resolution , 2014, AAAI.

[8]  Carlos Ansótegui,et al.  Exploiting the Structure of Unsatisfiable Cores in MaxSAT , 2015, IJCAI.

[9]  Fahiem Bacchus,et al.  Exploiting the Power of mip Solvers in maxsat , 2013, SAT.

[10]  Rupak Majumdar,et al.  Cause clue clauses: error localization using maximum satisfiability , 2010, PLDI '11.

[11]  Vasco M. Manquinho,et al.  Parallel search for maximum satisfiability , 2012, AI Commun..

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

[13]  Inês Lynce,et al.  Conflict-Driven Clause Learning SAT Solvers , 2009, Handbook of Satisfiability.

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

[15]  Ewald Speckenmeyer,et al.  A fast parallel SAT-solver — efficient workload balancing , 2005, Annals of Mathematics and Artificial Intelligence.

[16]  Vasco M. Manquinho,et al.  Incremental Cardinality Constraints for MaxSAT , 2014, CP.

[17]  Nikolaj Bjørner,et al.  Maximum Satisfiability Using Cores and Correction Sets , 2015, IJCAI.

[18]  Sharad Malik,et al.  Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

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

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

[21]  Robert Nieuwenhuis,et al.  Curriculum-based course timetabling with SAT and MaxSAT , 2012, Ann. Oper. Res..

[22]  Felip Manyà,et al.  MaxSAT, Hard and Soft Constraints , 2021, Handbook of Satisfiability.

[23]  Miyuki Koshimura,et al.  QMaxSAT: A Partial Max-SAT Solver , 2012, J. Satisf. Boolean Model. Comput..

[24]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[25]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[26]  Xin Zhang,et al.  On abstraction refinement for program analyses in Datalog , 2014, PLDI 2014.

[27]  Vasco M. Manquinho,et al.  Open-WBO: A Modular MaxSAT Solver, , 2014, SAT.

[28]  Albert Oliveras,et al.  Cardinality Networks: a theoretical and empirical study , 2011, Constraints.

[29]  Niklas Sörensson,et al.  Temporal induction by incremental SAT solving , 2003, BMC@CAV.