Abstract
The Max-SAT problem consists in finding an assignment maximizing the number of satisfied clauses. Complete methods for this problem include Branch and Bound (BnB) algorithms which use max-resolution, the inference rule for Max-SAT, to ensure that every computed Inconsistent Subset (IS) is counted only once in the lower bound estimation. However, learning max-resolution transformations can be detrimental to their performance so they are usually selectively learned if they respect certain patterns. In this paper, we focus on recently introduced patterns called Unit Clause Subsets (UCSs). We characterize the transformations of certain UCS patterns using the UP-resilience property. Finally, we explain how our result can help extend the current patterns.
This work is funded by the French National Research Agency (ANR), reference ANR-16-C40-0028.
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
References
Abramé, A., Habet, D.: Efficient application of Max-SAT resolution on inconsistent subsets. In: O’Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 92–107. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10428-7_10
Abramé, A., Habet, D.: On the extension of learning for Max-SAT. In: Endriss, U., Leite, J. (eds.) Frontiers in Artificial Intelligence and Applications, vol. 241, pp. 1–10. IOS Press, Amsterdam (2014)
Abramé, A., Habet, D.: AHMAXSAT: description and evaluation of a branch and bound Max-SAT solver. J. Satisf. Boolean Model. Computation 9, 89–128 (2015)
Abramé, A., Habet, D.: On the resiliency of unit propagation to max-resolution. In: Yang, Q., Wooldridge, M. (eds.) Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pp. 268–274. AAAI Press (2015)
Ansótegui, C., Bonet, M.L., Levy, J.: Solving (weighted) partial MaxSAT through satisfiability testing. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 427–440. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02777-2_39
Bonet, M.L., Levy, J., Manyà, F.: Resolution for Max-SAT. Artif. Intell. 171(8), 606–618 (2007)
Davies, J., Bacchus, F.: Solving MAXSAT by solving a sequence of simpler SAT instances. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 225–239. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23786-7_19
Heras, F., Larrosa, J.: New inference rules for efficient Max-SAT solving. In: Cohn, A. (ed.) Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), pp. 68–73. AAAI Press (2006)
Küegel, A.: Improved exact solver for the weighted Max-SAT problem. In: Berre, D.L. (ed.) POS-10. Pragmatics of SAT. EPiC Series in Computing, vol. 8, pp. 15–27. EasyChair (2012)
Li, C.M., Manyà, F., Mohamedou, N.O., Planes, J.: Resolution-based lower bounds in MaxSAT. Constraints 15, 456–484 (2010)
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-06), Boston, Massachusetts, vol. 1, pp. 86–91. AAAI Press (2006)
Li, C.M., Manyà, F., Planes, J.: New inference rules for Max-SAT. J. Artif. Intell. Res. 30, 321–359 (2007)
Martins, R., Manquinho, V., Lynce, I.: Open-WBO: a modular MaxSAT solver,. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 438–445. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09284-3_33
Narodytska, N., Bacchus, F.: Maximum satisfiability using core-guided MaxSAT resolution. In: Proceedings of the Twenty-Eighth Conference on Artificial Intelligence (AAAI-14), pp. 2717–2723. AAAI Press (2014)
Marques-Silva, J.P., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48, 506–521 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Cherif, M.S., Habet, D. (2019). Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience. In: Schiex, T., de Givry, S. (eds) Principles and Practice of Constraint Programming. CP 2019. Lecture Notes in Computer Science(), vol 11802. Springer, Cham. https://doi.org/10.1007/978-3-030-30048-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-30048-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30047-0
Online ISBN: 978-3-030-30048-7
eBook Packages: Computer ScienceComputer Science (R0)