论文信息 - A Complete Calculus for Max-SAT

A Complete Calculus for Max-SAT

Max-SAT is the problem of finding an assignment minimizing the number of unsatisfied clauses of a given 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.

Maria Luisa Bonet | Jordi Levy | Felip Manyà

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

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

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

[4] Hantao Zhang,et al. Improving exact algorithms for MAX-2-SAT , 2005, Annals of Mathematics and Artificial Intelligence.

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

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

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

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

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

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

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

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

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