WPM3: An (in)complete algorithm for weighted partial MaxSAT

Abstract Maximum Satisfiability (MaxSAT) has been used to solve efficiently many combinatorial optimization problems. At recent editions of international MaxSAT Evaluation (MSE), the best performing solvers for real world (industrial) problems were those implementing SAT-based algorithms. These algorithms reformulate the MaxSAT optimization problem into a sequence of SAT decision problems where Pseudo-Boolean (PB) constraints may be introduced. In order to identify the most suitable PB constraints, some algorithms (core-guided) analyze the unsatisfiable cores retrieved from the previous SAT problems in the sequence while refining the lower bound. In this paper, we first conduct a comprehensive study on the complete core-guided algorithms Eva and OLL, that inspired the best performing solvers on industrial instances at MSE-2014. Despite of its apparently different foundations, we show how they are intimately related and identify how to improve them. In this sense, we present our complete core-guided algorithm WPM3. We show how to further exploit the analysis of unsatisfiable cores by being aware of their global structure, i.e., how the cores are interrelated. This is used to encode more efficient PB constraints and enables the algorithm to obtain assignments and refine also the upper bound. Therefore, WPM3 can also work as an incomplete algorithm. At MSE-2015, it showed a competitive performance on industrial instances. It got one out of three gold medals at the complete track and dominated at the incomplete track.

[1]  Maria Luisa Bonet,et al.  Improving SAT-Based Weighted MaxSAT Solvers , 2012, CP.

[2]  Vasco M. Manquinho,et al.  Clause Sharing in Parallel MaxSAT , 2012, LION.

[3]  Josep Argelich,et al.  Solving Linux Upgradeability Problems Using Boolean Optimization , 2010, LoCoCo.

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

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

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

[7]  Inês Lynce,et al.  Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information , 2010, ANB.

[8]  Mario Alviano,et al.  A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size , 2015, IJCAI.

[9]  Joao Marques-Silva,et al.  Iterative and core-guided MaxSAT solving: A survey and assessment , 2013, Constraints.

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

[11]  Yuri Malitsky,et al.  MaxSAT by Improved Instance-Specific Algorithm Configuration , 2014, AAAI.

[12]  Tuomas Sandholm,et al.  An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.

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

[14]  Matti Järvisalo,et al.  Improving the Effectiveness of SAT-Based Preprocessing for MaxSAT , 2015, IJCAI.

[15]  Carlos Ansótegui,et al.  Exploiting subproblem optimization in SAT-based MaxSAT algorithms , 2016, J. Heuristics.

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

[17]  Joel Sokol,et al.  Optimal Protein Structure Alignment Using Maximum Cliques , 2005, Oper. Res..

[18]  Olivier Roussel,et al.  New Encodings of Pseudo-Boolean Constraints into CNF , 2009, SAT.

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

[20]  Kaile Su,et al.  New local search methods for partial MaxSAT , 2016, Artif. Intell..

[21]  Sean Safarpour,et al.  Improved Design Debugging Using Maximum Satisfiability , 2007 .

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

[23]  Kaile Su,et al.  Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving , 2007, IJCAI.

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

[25]  Tobias Philipp,et al.  A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained , 2014, KI.

[26]  Lei Zhang,et al.  MAXSAT Heuristics for Cost Optimal Planning , 2012, AAAI.

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

[28]  Vasco M. Manquinho,et al.  Exploiting Cardinality Encodings in Parallel Maximum Satisfiability , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[29]  Simon de Givry,et al.  2006 and 2007 Max-SAT Evaluations: Contributed Instances , 2008, J. Satisf. Boolean Model. Comput..

[30]  Maria Luisa Bonet,et al.  On Solving MaxSAT Through SAT , 2009, CCIA.

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

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

[33]  Carlos Ansótegui,et al.  Solving (Weighted) Partial MaxSAT with ILP , 2013, CPAIOR.

[34]  Maria Luisa Bonet,et al.  SAT-based MaxSAT algorithms , 2013, Artif. Intell..

[35]  Niklas Sörensson,et al.  Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..

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

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

[38]  Adrian Kügel,et al.  Improved Exact Solver for the Weighted MAX-SAT Problem , 2010, POS@SAT.

[39]  Joao Marques-Silva,et al.  Improvements to Core-Guided Binary Search for MaxSAT , 2012, SAT.

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

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

[42]  Wei Wu,et al.  CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability , 2015, IEEE Transactions on Computers.

[43]  Martin C. Cooper,et al.  Soft Arc Consistency Applied to Optimal Planning , 2006, CP.

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

[45]  Carsten Sinz,et al.  Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.

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

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

[48]  Fahiem Bacchus,et al.  Postponing Optimization to Speed Up MAXSAT Solving , 2013, CP.

[49]  Torsten Schaub,et al.  Unsatisfiability-based optimization in clasp , 2012, ICLP.

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

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

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

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

[54]  Jin-Kao Hao,et al.  A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite , 2001, Comput. Optim. Appl..

[55]  Javier Larrosa,et al.  Resolution in Max-SAT and its relation to local consistency in weighted CSPs , 2005, IJCAI.