|Title||A Complete Resolution Calculus for Signed Max-SAT|
|Publication Type||Conference Paper|
|Year of Publication||2007|
|Authors||Ansótegui C, Bonet MLuisa, Levy J, Manyà F|
|Conference Name||Proc. of the 37th International Symposium on Multiple-Valued Logic, ISMVL'07|
We define a resolution-style rule for solving the Max-SAT problem of Signed CNF formulas (Signed Max-SAT) and prove that our rule provides a complete calculus for that problem. From the completeness proof we derive an original exact algorithm for solving Signed Max-SAT. Finally, we present some connections between our approach and the work done in the Weighted CSP community.
- About IIIA
- Current news