Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation

Authors:
Chu Min Li;Felip Manyà;Nouredine Ould Mohamedou;Jordi Planes
Affiliations:
Hunan Normal University, Changsha, China and MIS, Université de Picardie Jules Verne, Amiens, France 80000;Artificial Intelligence Research Institue (IIIA, CSIC), Bellaterra, Spain 08193 and Computer Science Department, Universitat de Lleida, Lleida, Spain 25001;MIS, Université de Picardie Jules Verne, Amiens, France 80000;Computer Science Department, Universitat de Lleida, Lleida, Spain 25001
Venue:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 3
Cited 2

A logical approach to efficient Max-SAT solving

Artificial Intelligence
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
New inference rules for Max-SAT

Journal of Artificial Intelligence Research

Exploiting Cycle Structures in Max-SAT

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Resolution-based lower bounds in MaxSAT

Constraints

Quantified Score

Hi-index	0.00

Visualization

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.