Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation
Tipo de Publicación:
Conference PaperOrigen:
14th International Conference on Principles and Practice of Constraint Programming (CP-2008), Springer, Volumen5202, Sydney, Australia, p.582-587 (2008)Resumen:
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.
Proyectos:
