Improving SAT-Based Weighted MaxSAT Solvers

In the last few years, there has been a significant effort in designing and developing efficient Weighted MaxSAT solvers. We study in detail the WPM1 algorithm identifying some weaknesses and proposing solutions to mitigate them. Basically, WPM1 is based on iteratively calling a SAT solver and adding blocking variables and cardinality constraints to relax the unsatisfiable cores returned by the SAT solver. We firstly identify and study how to break the symmetries introduced by the blocking variables and cardinality constraints. Secondly, we study how to prioritize the discovery of higher quality cores. We present an extensive experimental investigation comparing the new algorithm with state-of-the-art solvers showing that our approach makes WPM1 much more competitive.

[1]  Carlos Ansótegui,et al.  Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables , 2004, SAT.

[2]  Thomas Schiex,et al.  Max-CSP competition 2008: toulbar2 solver description , 2008 .

[3]  Maria Luisa Bonet,et al.  Resolution for Max-SAT , 2007, Artif. Intell..

[4]  Joao Marques-Silva,et al.  Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings , 2007, SAT.

[5]  Kaile Su,et al.  Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving , 2008, AAAI.

[6]  Vasco M. Manquinho,et al.  Algorithms for Weighted Boolean Optimization , 2009, SAT.

[7]  Josep Argelich,et al.  Boolean lexicographic optimization: algorithms & applications , 2011, Annals of Mathematics and Artificial Intelligence.

[8]  Felip Manyà,et al.  Exploiting Cycle Structures in Max-SAT , 2009, SAT.

[9]  Oliver Kullmann,et al.  Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings , 2009, SAT.

[10]  Joao Marques-Silva,et al.  Core-Guided Binary Search Algorithms for Maximum Satisfiability , 2011, AAAI.

[11]  Maria Luisa Bonet,et al.  A New Algorithm for Weighted Partial MaxSAT , 2010, AAAI.

[12]  Albert Oliveras,et al.  MiniMaxSat: A New Weighted Max-SAT Solver , 2007, SAT.

[13]  Maria Luisa Bonet,et al.  Solving (Weighted) Partial MaxSAT through Satisfiability Testing , 2009, SAT.

[14]  Hans Kleine Büning,et al.  Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings , 2008, SAT.

[15]  Armin Biere,et al.  Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings , 2006, SAT.

[16]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[17]  Joao Marques-Silva,et al.  On Using Unsatisfiability for Solving Maximum Satisfiability , 2007, ArXiv.

[18]  Fahiem Bacchus,et al.  Solving MAXSAT by Solving a Sequence of Simpler SAT Instances , 2011, CP.

[19]  Armin Biere,et al.  PicoSAT Essentials , 2008, J. Satisf. Boolean Model. Comput..

[20]  Vasco M. Manquinho,et al.  Symmetry Breaking for Maximum Satisfiability , 2008, LPAR.

[21]  Sharad Malik,et al.  On Solving the Partial MAX-SAT Problem , 2006, SAT.

[22]  Vasco M. Manquinho,et al.  Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms , 2008, SAT.