Abstract
We define a new heuristic that guides the application of cycle resolution (CR) in MaxSAT, and show that it produces better lower bounds than those obtained by applying CR exhaustively as in Max-DPLL, and by applying CR in a limited way when unit propagation detects a contradiction as in MaxSatz. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Li, C. M., Manyà, F., Mohamedou, N. O., & Planes, J. (2008). Transforming inconsistent subformulas in MaxSAT lower bound computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5202 LNCS, pp. 582–587). https://doi.org/10.1007/978-3-540-85958-1_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
