Improving the Effectiveness of SAT-Based Preprocessing for MaxSAT

Solvers for the Maximum satisfiability (MaxSAT) problem find an increasing number of applications today. We focus on improving MaxHS--one of the most successful recent MaxSAT algorithms-- via SAT-based preprocessing. We show that employing SAT-based preprocessing via the so-called labelled CNF (LCNF) framework before calling MaxHS can in some cases greatly degrade the performance of the solver. As a remedy, we propose a lifting of MaxHS that works directly on LCNFs, allowing for a tighter integration of SAT-based preprocessing and MaxHS. Our empirical results on standard crafted and industrial weighted partial MaxSAT Evaluation benchmarks show overall improvements over the original MaxHS algorithm both with and without SAT-based preprocessing.

[1]  Matti Järvisalo,et al.  Optimal Correlation Clustering via MaxSAT , 2013, 2013 IEEE 13th International Conference on Data Mining Workshops.

[2]  Samuel Kaski,et al.  Optimal Neighborhood Preserving Visualization by Maximum Satisfiability , 2014, AAAI.

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

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

[5]  Norbert Manthey.  Coprocessor 2.0 - A Flexible CNF Simplifier - (Tool Presentation) , 2012, SAT.

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

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

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

[9]  Oliver Kullmann,et al.  On a Generalization of Extended Resolution , 1999, Discret. Appl. Math..

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

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

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

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

[14]  Joao Marques-Silva,et al.  SAT-Based Preprocessing for MaxSAT , 2013, LPAR.

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

[16]  Armin Biere,et al.  Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[17]  Armin Biere,et al.  Blocked Clause Elimination , 2010, TACAS.

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

[19]  Brandon M. Malone,et al.  Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability , 2014, AISTATS.

[20]  Jean-Marie Lagniez,et al.  Preprocessing for Propositional Model Counting , 2014, AAAI.

[21]  Joao Marques-Silva,et al.  Formula Preprocessing in MUS Extraction , 2013, TACAS.

[22]  Sharad Malik,et al.  Post-silicon fault localisation using maximum satisfiability and backbones , 2011, 2011 Formal Methods in Computer-Aided Design (FMCAD).

[23]  Felip Manyà,et al.  MaxSAT, Hard and Soft Constraints , 2021, Handbook of Satisfiability.

[24]  Armin Biere,et al.  Inprocessing Rules , 2012, IJCAR.

[25]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[26]  Joao Marques-Silva,et al.  Generalizing Redundancy in Propositional Logic: Foundations and Hitting Sets Duality , 2012, ArXiv.

[27]  Armin Biere,et al.  Clause Elimination Procedures for CNF Formulas , 2010, LPAR.

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

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