An Empirical Study of Encodings for Group MaxSAT

Weighted Partial MaxSAT (WPMS) is a well-known optimization variant of Boolean Satisfiability (SAT) that finds a wide range of practical applications. WPMS divides the formula in two sets of clauses: The hard clauses that must be satisfied and the soft clauses that can be unsatisfied with a penalty given by their associated weight. However, some applications may require each constraint to be modeled as a set or group of clauses. The resulting formalism is referred to as Group MaxSAT. This paper overviews Group maxSAT, and shows how several optimization problems can be modeled as Group MaxSAT. Several encodings from Group MaxSAT to standard MaxSAT are formalized and refined. A comprehensive empirical study compares the performance of several MaxSAT solvers with the proposed encodings. The results indicate that, depending on the underlying MaxSAT solver and problem domain, the solver may perform better with a given encoding than with the others.

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

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

[3]  Hans Kleine Büning,et al.  Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings , 2008, SAT.

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

[5]  Josep Argelich,et al.  Modelling Max-CSP as Partial Max-SAT , 2008, SAT.

[6]  Thomas Schiex,et al.  Solving weighted CSP by maintaining arc consistency , 2004, Artif. Intell..

[7]  Albert Oliveras,et al.  MiniMaxSAT: An Efficient Weighted Max-SAT solver , 2008, J. Artif. Intell. Res..

[8]  Bart Selman,et al.  Balance and Filtering in Structured Satisfiable Problems , 2001, IJCAI.

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

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

[11]  Toby Walsh,et al.  SAT v CSP , 2000, CP.

[12]  Bart Selman,et al.  Balance and Filtering in Structured Satisfiable Problems (Preliminary Report) , 2001, Electron. Notes Discret. Math..

[13]  Oliver Kullmann,et al.  Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings , 2009, SAT.

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

[15]  Toby Walsh,et al.  Handbook of satisfiability , 2009 .

[16]  Vasco M. Manquinho,et al.  Improving Unsatisfiability-Based Algorithms for Boolean Optimization , 2010, SAT.

[17]  Josep Argelich,et al.  Exact Max-SAT solvers for over-constrained problems , 2006, J. Heuristics.

[18]  Ofer Strichman,et al.  Theory and Applications of Satisfiability Testing – SAT 2010 , 2010, Lecture Notes in Computer Science.

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

[20]  Michèle Sebag,et al.  Fast Theta-Subsumption with Constraint Satisfaction Algorithms , 2004, Machine Learning.

[21]  Levent Aksoy,et al.  Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[22]  Rina Dechter,et al.  Principles and Practice of Constraint Programming – CP 2000 , 2001, Lecture Notes in Computer Science.