Abstract
Max-SAT resolution is the adaption of the powerful SAT resolution rule for the Max-SAT problem. One of the differences between these two rules is that Max-SAT resolution adds, besides the resolvent, several compensation clauses to keep the formula’s equivalency. We address in this paper the problem of reducing both the number and the size of these compensation clauses. We show that the order in which the Max-SAT resolution steps are applied on the inconsistent subsets of clauses has a direct impact on the number and the sizes of the compensation clauses added to the formula. Based on this observation, we present a new algorithm for applying Max-SAT resolution on inconsistent subsets which reduces the number and the sizes of the produced compensation clauses. We demonstrate experimentally the interest of our contribution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonet, M.L., Levy, J., Manyà, F.: A complete calculus for max-sat. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 240–251. Springer, Heidelberg (2006)
Bonet, M.L., Levy, J., Manyá, F.: Resolution for max-sat. Artificial Intelligence 171(8-9), 606–618 (2007)
Heras, F., Larrosa, J.: New inference rules for efficient max-sat solving. In: Proceedings of the 21st National Conference on Artificial Intelligence, AAAI 2006, vol. 1, pp. 68–73. AAAI Press (2006)
Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient max-sat solving. Artificial Intelligence 172(2-3), 204–233 (2008)
Li, C.M., Manyà, F., Mohamedou, N., Planes, J.: Exploiting cycle structures in max-sat. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 467–480. Springer, Heidelberg (2009)
Li, C.M., Manyà, F., Planes, J.: Exploiting unit propagation to compute lower bounds in branch and bound max-sat solvers. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 403–414. Springer, Heidelberg (2005)
Li, C.M., Manyà, F., Planes, J.: Detecting disjoint inconsistent subformulas for computing lower bounds for max-sat. In: Proceedings of the 21st National Conference on Artificial Intelligence, AAAI 2006, pp. 86–91. AAAI Press (2006)
Li, C.M., Manyà, F., Planes, J.: New inference rules for max-sat. Journal of Artificial Intelligence Research 30, 321–359 (2007)
Li, C., Manyá, F., Mohamedou, N., Planes, J.: Resolution-based lower bounds in maxsat. Constraints 15(4), 456–484 (2010)
Marques-Silva, J.P., Sakallah, K.A.: Grasp: A search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5), 506–521 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Abramé, A., Habet, D. (2014). Efficient Application of Max-SAT Resolution on Inconsistent Subsets. In: O’Sullivan, B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham. https://doi.org/10.1007/978-3-319-10428-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-10428-7_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10427-0
Online ISBN: 978-3-319-10428-7
eBook Packages: Computer ScienceComputer Science (R0)