Resolution for Max-SAT

Max-SAT is the problem of finding an assignment minimizing the number of unsatisfied clauses in a CNF formula. We propose a resolution-like calculus for Max-SAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completeness proof we derive an exact algorithm for Max-SAT and a time upper bound. We also define a weighted Max-SAT resolution-like rule, and show how to adapt the soundness and completeness proofs of the Max-SAT rule to the weighted Max-SAT rule. Finally, we give several particular Max-SAT problems that require an exponential number of steps of our Max-SAT rule to obtain the minimal number of unsatisfied clauses of the combinatorial principle. These results are based on the corresponding resolution lower bounds for those particular problems.

[1]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

[2]  Weixiong Zhang,et al.  Efficient Strategies for (Weighted) Maximum Satisfiability , 2004, CP.

[3]  Alexander S. Kulikov.  Automated Generation of Simplification Rules for SAT and MAXSAT , 2005, SAT.

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

[5]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

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

[7]  Teresa Alsinet,et al.  Improved Exact Solvers for Weighted Max-SAT , 2005, SAT.

[8]  Maria Luisa Bonet,et al.  The Logic Behind Weighted CSP , 2007, IJCAI.

[9]  Czech Republickrajicek.  Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic , 2007 .

[10]  Felip Manyà,et al.  Exact Algorithms for MAX-SAT , 2003, FTP.

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

[12]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[13]  Javier Larrosa,et al.  Bucket elimination for multiobjective optimization problems , 2006, J. Heuristics.

[14]  Michael E. Saks,et al.  The Efficiency of Resolution and Davis--Putnam Procedures , 2002, SIAM J. Comput..

[15]  Michael Alekhnovich,et al.  Mutilated chessboard problem is exponentially hard for resolution , 2004, Theor. Comput. Sci..

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

[17]  Luca Trevisan,et al.  The Approximability of Constraint Satisfaction Problems , 2001, SIAM J. Comput..

[18]  Maria Luisa Bonet,et al.  A Complete Calculus for Max-SAT , 2006, SAT.

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

[20]  Søren Riis,et al.  "Planar" tautologies hard for resolution , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

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

[22]  Rolf Niedermeier,et al.  New Upper Bounds for Maximum Satisfiability , 2000, J. Algorithms.

[23]  Ran Raz,et al.  Regular resolution lower bounds for the weak pigeonhole principle , 2001, STOC '01.

[24]  Maria Luisa Bonet,et al.  On the automatizability of resolution and related propositional proof systems , 2002, Inf. Comput..

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

[26]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[27]  Pavel Pudlák,et al.  Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.

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

[29]  Jan Krajícek,et al.  Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic , 1997, Journal of Symbolic Logic.

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

[31]  Toniann Pitassi,et al.  Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[32]  Alexander A. Razborov.  Improved Resolution Lower Bounds for the Weak Pigeonhole Principle , 2001, Electron. Colloquium Comput. Complex..

[33]  Teresa Alsinet,et al.  A Max-SAT Solver with Lazy Data Structures , 2004, IBERAMIA.

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

[35]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..