Abstract
Traditional SAT-based MaxSAT solvers encode cardinality constraints directly as part of the CNF and solve the entire optimization problem by a sequence of iterative calls of the underlying SAT solver. The main drawback of such approaches is their dependence on the number of soft clauses: The more soft clauses the MaxSAT instance contains, the larger is the CNF part encoding the cardinality constraints. To counter this drawback, we introduce an innovative encoding of cardinality constraints: Instead of translating the entire and probably bloated constraint network into CNF, a divide-and-conquer approach is used to encode partial constraint networks successively. The resulting subproblems are solved and merged incrementally, reusing not only intermediate local optima, but also additional constraints which are derived from solving the individual subproblems by the back-end SAT solver. Extensive experimental results for the last MaxSAT evaluation benchmark suitew demonstrate that our encoding is in general smaller compared to existing methods using a monolithic encoding of the constraints and converges faster to the global optimum.
This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lin, P.-C.K., Khatri, S.P.: Application of Max-SAT-based ATPG to optimal cancer therapy design. BMC Genomics 13(suppl. 6), S5 (2012)
Favier, A., Elsen, J.-M., De Givry, S., Legarra, A.: Optimal haplotype reconstruction in half-sib families. In: Proceedings of WCB 2010, p. 20 (2010)
Reimer, S., Sauer, M., Schubert, T., Becker, B.: Using MaxBMC for Pareto-optimal circuit initialization. In: DATE. IEEE (2014)
Menai, M., Al-Yahya, T.: A taxonomy of exact methods for partial Max-SAT. Journal of Computer Science and Technology 28(2), 232–246 (2013)
Zhang, H., Shen, H., Manya, F.: Exact algorithms for MAX-SAT. Electronic Notes in Theoretical Computer Science 86(1), 190–203 (2003)
Sinz, C.: Towards an optimal CNF encoding of boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827–831. Springer, Heidelberg (2005)
Batcher, K.E.: Sorting networks and their applications. In: AFIPS Spring Joint Computing Conference, pp. 307–314. ACM (1968)
Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108–122. Springer, Heidelberg (2003)
Codish, M., Zazon-Ivry, M.: Pairwise cardinality networks. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol. 6355, pp. 154–172. Springer, Heidelberg (2010)
Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: Cardinality networks: a theoretical and empirical study. Constraints 16(2), 195–221 (2011)
Morgenstern, A., Schneider, K.: Synthesis of parallel sorting networks using SAT solvers. In: MBMV, pp. 71–80 (2011)
Eén, N., Sörensson, N.: Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation 2, 1–26 (2006)
Martins, R., Manquinho, V., Lynce, I.: Exploiting cardinality encodings in parallel maximum satisfiability. In: 2011 23rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp. 313–320. IEEE (2011)
Martins, R., Manquinho, V., Lynce, I.: Community-based partitioning for maxSAT solving. In: Järvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 182–191. Springer, Heidelberg (2013)
Manolios, P., Papavasileiou, V.: Pseudo-Boolean solving by incremental translation to SAT. In: Formal Methods in Computer-Aided Design (FMCAD), pp. 41–45. IEEE (2011)
Marques-Silva, J., Planes, J.: Algorithms for maximum satisfiability using unsatisfiable cores. In: Advanced Techniques in Logic Synthesis, Optimizations and Applications, pp. 171–182. Springer (2011)
Eighth MaxSAT evaluation (2013), http://maxsat.ia.udl.cat:81/13/
Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5(7), 394–397 (1962)
Eén, N., Sörensson, N.: Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science 89(4), 543–560 (2003)
Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. Advances in Computers 58, 117–148 (2003)
Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 252–265. Springer, Heidelberg (2006)
Parberry, I.: The pairwise sorting network. Parallel Processing Letters 2(02n03), 205–211 (1992)
Schubert, T., Reimer, S.: Antom (2013), https://projects.informatik.uni-freiburg.de/projects/antom
Koshimura, M., Zhang, T., Fujita, H., Hasegawa, R.: QMaxSAT: A partial Max-SAT solver system description. Journal on Satisfiability, Boolean Modeling and Computation 8, 95–100 (2012), https://sites.google.com/site/qmaxsat/
Morgado, A., Heras, F., Marques-Silva, J.: Improvements to core-guided binary search for MaxSAT. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 284–297. Springer, Heidelberg (2012), http://logos.ucd.ie/wiki/doku.php?id=msuncore
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
Reimer, S., Sauer, M., Schubert, T., Becker, B. (2014). Incremental Encoding and Solving of Cardinality Constraints. In: Cassez, F., Raskin, JF. (eds) Automated Technology for Verification and Analysis. ATVA 2014. Lecture Notes in Computer Science, vol 8837. Springer, Cham. https://doi.org/10.1007/978-3-319-11936-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-11936-6_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11935-9
Online ISBN: 978-3-319-11936-6
eBook Packages: Computer ScienceComputer Science (R0)