A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size

Core-guided algorithms proved to be effective on industrial instances of MaxSAT, the optimization variant of the satisfiability problem for propositional formulas. These algorithms work by iteratively checking satisfiability of a formula that is relaxed at each step by using the information provided by unsatisfiable cores. The paper introduces a new core-guided algorithm that adds cardinality constraints for each detected core, but also limits the number of literals in each constraint in order to control the number of refutations in subsequent satisfiability checks. The performance gain of the new algorithm is assessed on the industrial instances of the 2014 MaxSAT Evaluation.

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

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

[3]  Mario Alviano,et al.  WASP: A Native ASP Solver Based on Constraint Learning , 2013, LPNMR.

[4]  Pedro Barahona,et al.  PSICO: Solving Protein Structures with Constraint Programming and Optimization , 2002, Constraints.

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

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

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

[8]  Ehud Shapiro,et al.  Third International Conference on Logic Programming , 1986 .

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

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

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

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

[13]  Mario Alviano,et al.  Anytime Computation of Cautious Consequences in Answer Set Programming , 2014, Theory and Practice of Logic Programming.

[14]  Josep Argelich,et al.  On Solving Boolean Multilevel Optimization Problems , 2009, IJCAI 2009.

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

[16]  Inês Lynce,et al.  Reasoning over Biological Networks Using Maximum Satisfiability , 2012, CP.

[17]  Nina Narodytska,et al.  Cores in Core Based MaxSat Algorithms: An Analysis , 2014, SAT.

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

[19]  Mikolás Janota,et al.  Computing Minimal Sets on Propositional Formulae I: Problems & Reductions , 2014, ArXiv.

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

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

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

[23]  Vasco M. Manquinho,et al.  Pseudo-Boolean and Cardinality Constraints , 2021, Handbook of Satisfiability.

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

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

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

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

[28]  Byungki Cha,et al.  Local Search Algorithms for Partial MAXSAT , 1997, AAAI/IAAI.