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

A Complete Resolution Calculus for Signed Max-SAT

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.

Maria Luisa Bonet | Carlos Ansótegui | Jordi Levy | Felip Manyà

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

[2] Carlos Ansótegui,et al. Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables , 2004, SAT.

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

[4] Josep Argelich,et al. Exact Max-SAT solvers for over-constrained problems , 2006, J. Heuristics.

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

[6] Bernhard Beckert,et al. Transformations between signed and classical clause logic , 1999, Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329).

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

[8] Thomas Schiex,et al. Soft Constraints , 2000, WLP.

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

[10] Xavier Domingo,et al. Towards Solving Many-Valued MaxSAT , 2006, 36th International Symposium on Multiple-Valued Logic (ISMVL'06).