Exploiting the Structure of Unsatisfiable Cores in MaxSAT

We propose a new approach that exploits the good properties of core-guided and model-guided MaxSAT solvers. In particular, we show how to effectively exploit the structure of unsatisfiable cores in MaxSAT instances. Experimental results on industrial instances show that the proposed approach outperforms both complete and incomplete state-of-the-art MaxSAT solvers at the last international MaxSAT Evaluation in terms of robustness and total number of solved instances.

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

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

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

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

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

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

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

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

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

[10]  Hantao Zhang,et al.  An Empirical Study of MAX-2-SAT Phase Transitions , 2003, Electron. Notes Discret. Math..

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

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

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

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

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

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

[17]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

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

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

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

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

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

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

[24]  Josep Argelich,et al.  Experimenting with the Instances of the MaxSAT Evaluation , 2011, CCIA.

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

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

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

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

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

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