On Using Unsatisfiability for Solving Maximum Satisfiability

Maximum Satisfiability (MaxSAT) is a well-known optimization pro- blem, with several practical applications. The most widely known MAXS AT algorithms are ineffective at solving hard problems instances from practical application domains. Recent work proposed using efficient Boolean Satisfiability (SAT) solvers for solving the MaxSAT problem, based on identifying and eliminating unsatisfiable subformulas. However, these algorithms do not scale in practice. This paper analyzes existing MaxSAT algorithms based on unsatisfiable subformula identification. Moreover, the paper proposes a number of key optimizations to these MaxSAT algorithms and a new alternative algorithm. The proposed optimizations and the new algorithm provide significant performance improvements on MaxSAT instances from practical applications. Moreover, the efficiency of the new generation of unsatisfiability-based MaxSAT solvers becomes effectively indexed to the ability of modern SAT solvers to proving unsatisfiability and identifying unsatisfiable subformulas.

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

[2]  Rob A. Rutenbar,et al.  Satisfiability-based layout revisited: detailed routing of complex FPGAs via search-based Boolean SAT , 1999, FPGA '99.

[3]  Emmanuel Zarpas,et al.  Benchmarking SAT Solvers for Bounded Model Checking , 2005, SAT.

[4]  David S. Johnson.  Approximation algorithms for combinatorial problems , 1973, STOC '73.

[5]  Enrico Giunchiglia,et al.  Solving Optimization Problems with DLL , 2006, ECAI.

[6]  Felip Manyà,et al.  Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT , 2006, AAAI.

[7]  Felip Manyà,et al.  New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..

[8]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[9]  Simon de Givry,et al.  A logical approach to efficient Max-SAT solving , 2006, Artif. Intell..

[10]  Karem A. Sakallah,et al.  On Finding All Minimally Unsatisfiable Subformulas , 2005, SAT.

[11]  Joost P. Warners,et al.  A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form , 1998, Inf. Process. Lett..

[12]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[13]  Panagiotis Manolios,et al.  A Parameterized Benchmark Suite of Hard Pipelined-Machine-Verification Problems , 2005, CHARME.

[14]  Karem A. Sakallah,et al.  GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.

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

[16]  Maria Luisa Bonet,et al.  Resolution for Max-SAT , 2007, Artif. Intell..

[17]  Sean Safarpour,et al.  Improved Design Debugging Using Maximum Satisfiability , 2007 .

[18]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[19]  Wolfgang Küchlin,et al.  Formal methods for the validation of automotive product configuration data , 2003, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

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

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

[22]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[23]  Ian P. Gent.  Arc Consistency in SAT , 2002, ECAI.

[24]  Sean Safarpour,et al.  Improved Design Debugging Using Maximum Satisfiability , 2007, Formal Methods in Computer Aided Design (FMCAD'07).

[25]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[26]  Éric Grégoire,et al.  Boosting a Complete Technique to Find MSS and MUS Thanks to a Local Search Oracle , 2007, IJCAI.

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

[28]  Sharad Malik,et al.  Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[29]  Sanjit A. Seshia,et al.  Modeling and Verification of Out-of-Order Microprocessors in UCLID , 2002, FMCAD.