A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems

We describe a two-phase algorithm for MAX-SAT and weighted MAX-SAT problems. In the first phase, we use the GSAT heuristic to find a good solution to the problem. In the second phase, we use an enumeration procedure based on the Davis-Putnam-Loveland algorithm, to find a provably optimal solution. The first heuristic stage improves the performance of the algorithm by obtaining an upper bound on the minimum number of unsatisfied clauses that can be used in pruning branches of the search tree.We compare our algorithm with an integer programming branch-and-cut algorithm. Our implementation of the two-phase algorithm is faster than the integer programming approach on many problems. However, the integer programming approach is more effective than the two-phase algorithm on some classes of problems, including MAX-2-SAT problems.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[3]  Satissed Now Consider.  Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming , 1997 .

[4]  William H. Cunningham,et al.  A linear programming and rounding approach to max 2-sat , 1993, Cliques, Coloring, and Satisfiability.

[5]  Bart Selman,et al.  An Empirical Study of Greedy Local Search for Satisfiability Testing , 1993, AAAI.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  J. Hooker.  Resolution vs. cutting plane solution of inference problems: Some computational experience , 1988 .

[8]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[9]  J. K. Lowe,et al.  Some results and experiments in programming techniques for propositional logic , 1986, Comput. Oper. Res..

[10]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[11]  Mauricio G. C. Resende,et al.  A GRASP for satisfiability , 1993, Cliques, Coloring, and Satisfiability.

[12]  John E. Mitchell,et al.  A branch and cut algorithm for MAX-SAT and weighted MAX-SAT , 1996, Satisfiability Problem: Theory and Applications.

[13]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[14]  Henry A. Kautz,et al.  Solving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for MAX-SAT , 1995 .

[15]  Eugene C. Freuder,et al.  Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems , 1993, Cliques, Coloring, and Satisfiability.

[16]  Martin W. P. Savelsbergh,et al.  MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..

[17]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[18]  Gerald L. Thompson,et al.  The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems , 1994, Comput. Oper. Res..

[19]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.