A Complete Calculus for Max-SAT

Abstract 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.

Authors

• Maria Luisa Bonet
• Jordi Levy
• Felip Manyà

Keywords

No keywords are indexed for this paper.