Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving

In this paper we present a general logical framework for (weighted) MAX-SAT problem, and study properties of inference rules for branch and bound MAX-SAT solver. Several rules, which are not equivalent but Λ-equivalent, are proposed, and we show that Λ-equivalent rules are also sound. As an example, we show how to exploit inference rules to achieve a new lower bound function for a MAX-2-SAT solver. Our new function is admissible and consistently better than the well-known lower bound function. Based on the study of inference rules, we implement an efficient solver and the experimental results demonstrate that our solver outperforms the most efficient solver that has been implemented very recently [Heras and Larrosa, 2006], especially for large instances.

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

[2]  Weixiong Zhang,et al.  MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability , 2005, Artif. Intell..

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

[4]  Javier Larrosa,et al.  New Inference Rules for Efficient Max-SAT Solving , 2006, AAAI.

[5]  Rolf Niedermeier,et al.  Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT , 2003, Discret. Appl. Math..

[6]  Wei Li,et al.  Many hard examples in exact phase transitions , 2003, Theor. Comput. Sci..

[7]  Brian Borchers,et al.  A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..

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

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

[10]  Hantao Zhang,et al.  Study of Lower Bound Functions for MAX-2-SAT , 2004, AAAI.

[11]  Jinchang Wang,et al.  Solving propositional satisfiability problems , 1990, Annals of Mathematics and Artificial Intelligence.

[12]  Simon de Givry,et al.  Solving Max-SAT as Weighted CSP , 2003, CP.

[13]  Ke Xu,et al.  A Simple Model to Generate Hard Satisfiable Instances , 2005, IJCAI.

[14]  James D. Park.  Using weighted MAX-SAT engines to solve MPE , 2002, AAAI/IAAI.

[15]  Venkatesh Raman,et al.  Upper Bounds for MaxSat: Further Improved , 1999, ISAAC.

[16]  Bart Selman,et al.  The state of SAT , 2007, Discret. Appl. Math..

[17]  Teresa Alsinet,et al.  Improved branch and bound algorithms for Max-SAT , 2003 .

[18]  Felip Manyà,et al.  Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers , 2005, CP.

[19]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

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