Maximum Satisfiability Using Cores and Correction Sets

Core-guided MAXSAT algorithms dominate other methods in solving industrial MAXSAT problems. In this work, we propose a new efficient algorithm that is guided by correction sets and cores. At every iteration, the algorithm obtains a correction set or a core, which is then used to rewrite the formula using incremental and succinct transformations. We theoretically show that correction sets and cores have complementary strengths and empirically demonstrate that their combination leads to an efficient MAXSAT solver that outperforms state-of-the-art WPMS solvers on the 2014 Evaluation on industrial instances.

[1]  David G. Mitchell,et al.  New Encoding for Translating Pseudo-Boolean Constraints into SAT , 2013, SARA.

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

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

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

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

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

[7]  Enrico Giunchiglia,et al.  Combining approaches for solving satisfiability problems with qualitative preferences , 2013, AI Commun..

[8]  Vasco M. Manquinho,et al.  Progression in Maximum Satisfiability , 2014, ECAI.

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

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

[11]  Fahiem Bacchus,et al.  Relaxation Search: A Simple Way of Managing Optional Clauses , 2014, AAAI.

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

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

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

[15]  Alberto Griggio,et al.  Satisfiability Modulo the Theory of Costs: Foundations and Applications , 2010, TACAS.

[16]  J. Christopher Beck.  Principles and Practice of Constraint Programming , 2017, Lecture Notes in Computer Science.

[17]  Joao Marques-Silva,et al.  Core minimization in SAT-based abstraction , 2013, 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[18]  Daniel Le Berre,et al.  The Sat4j library, release 2.2 , 2010, J. Satisf. Boolean Model. Comput..

[19]  Joao Marques-Silva,et al.  Algorithms for Maximum Satisfiability using Unsatisfiable Cores , 2008, 2008 Design, Automation and Test in Europe.

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

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

[22]  Sheila A. McIlraith,et al.  Preference-Based Planning via MaxSAT , 2012, Canadian Conference on AI.

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