Skip to main content
Springer Nature Link
Log in

Improving MCS Enumeration via Caching

  • Conference paper
  • First Online:
Theory and Applications of Satisfiability Testing – SAT 2017 (SAT 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10491))

  • 1279 Accesses

Abstract

Enumeration of minimal correction sets (MCSes) of conjunctive normal form formulas is a central and highly intractable problem in infeasibility analysis of constraint systems. Often complete enumeration of MCSes is impossible due to both high computational cost and worst-case exponential number of MCSes. In such cases partial enumeration is sought for, finding applications in various domains, including axiom pinpointing in description logics among others. In this work we propose caching as a means of further improving the practical efficiency of current MCS enumeration approaches, and show the potential of caching via an empirical evaluation.

A. Previti and M. Järvisalo were supported by Academy of Finland (grants 251170 COIN, 276412, and 284591) and the Research Funds of the University of Helsinki. C. Mencía was supported by grant TIN2016-79190-R. J. Marques-Silva was supported by FCT funding of LASIGE Research Unit, ref. UID/CEC/00408/2013.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Arif, M.F., Mencía, C., Marques-Silva, J.: Efficient MUS enumeration of horn formulae with applications to axiom pinpointing. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 324–342. Springer, Cham (2015). doi:10.1007/978-3-319-24318-4_24

    Chapter  Google Scholar 

  2. Bacchus, F., Dalmao, S., Pitassi, T.: Solving #SAT and Bayesian inference with backtracking search. J. Artif. Intell. Res. 34, 391–442 (2009)

    MathSciNet  MATH  Google Scholar 

  3. Bacchus, F., Davies, J., Tsimpoukelli, M., Katsirelos, G.: Relaxation search: a simple way of managing optional clauses. In: Proceedings of AAAI, pp. 835–841. AAAI Press (2014)

    Google Scholar 

  4. Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2005. LNCS, vol. 3350, pp. 174–186. Springer, Heidelberg (2005). doi:10.1007/978-3-540-30557-6_14

    Chapter  Google Scholar 

  5. Beame, P., Impagliazzo, R., Pitassi, T., Segerlind, N.: Formula caching in DPLL. Trans. Comput. Theor. 1(3), 9:1–9:33 (2010)

    MATH  Google Scholar 

  6. Birnbaum, E., Lozinskii, E.L.: Consistent subsets of inconsistent systems: structure and behaviour. J. Exp. Theor. Artif. Intell. 15(1), 25–46 (2003)

    Article  MATH  Google Scholar 

  7. Chen, Z., Toda, S.: The complexity of selecting maximal solutions. Inf. Comput. 119(2), 231–239 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of STOC, pp. 151–158. ACM (1971)

    Google Scholar 

  9. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24605-3_37

    Chapter  Google Scholar 

  10. Felfernig, A., Schubert, M., Zehentner, C.: An efficient diagnosis algorithm for inconsistent constraint sets. Artif. Intell. Eng. Des. Anal. Manuf. 26(1), 53–62 (2012)

    Article  Google Scholar 

  11. Grégoire, É., Lagniez, J., Mazure, B.: An experimentally efficient method for (MSS, coMSS) partitioning. In: Proceedings of AAAI, pp. 2666–2673. AAAI Press (2014)

    Google Scholar 

  12. Kitching, M., Bacchus, F.: Symmetric component caching. In: Proceedings of IJCAI, pp. 118–124 (2007)

    Google Scholar 

  13. Kopp, T., Singla, P., Kautz, H.A.: Toward caching symmetrical subtheories for weighted model counting. In: Proceedings of AAAI Beyond NP Workshop. AAAI Workshops, vol. WS-16-05. AAAI Press (2016)

    Google Scholar 

  14. Liffiton, M.H., Previti, A., Malik, A., Marques-Silva, J.: Fast, flexible MUS enumeration. Constraints 21(2), 223–250 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  15. Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reasoning 40(1), 1–33 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Malitsky, Y., O’Sullivan, B., Previti, A., Marques-Silva, J.: Timeout-sensitive portfolio approach to enumerating minimal correction subsets for satisfiability problems. In: Proceedings of ECAI. Frontiers in Artificial Intelligence and Applications, vol. 263, pp. 1065–1066. IOS Press (2014)

    Google Scholar 

  17. Marques-Silva, J., Heras, F., Janota, M., Previti, A., Belov, A.: On computing minimal correction subsets. In: Proceedings of IJCAI, pp. 615–622. AAAI Press (2013)

    Google Scholar 

  18. Mencía, C., Ignatiev, A., Previti, A., Marques-Silva, J.: MCS extraction with sublinear oracle queries. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 342–360. Springer, Cham (2016). doi:10.1007/978-3-319-40970-2_21

    Google Scholar 

  19. Mencía, C., Marques-Silva, J.: Efficient relaxations of over-constrained CSPs. In: Proceedings of ICTAI, pp. 725–732. IEEE Computer Society (2014)

    Google Scholar 

  20. Mencía, C., Previti, A., Marques-Silva, J.: Literal-based MCS extraction. In: Proceedings of IJCAI, pp. 1973–1979. AAAI Press (2015)

    Google Scholar 

  21. Meseguer, P., Bouhmala, N., Bouzoubaa, T., Irgens, M., Sánchez, M.: Current approaches for solving over-constrained problems. Constraints 8(1), 9–39 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  22. Morgado, A., Liffiton, M.H., Marques-Silva, J.: MaxSAT-based MCS enumeration. In: Biere, A., Nahir, A., Vos, T. (eds.) HVC 2012. LNCS, vol. 7857, pp. 86–101. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39611-3_13

    Chapter  Google Scholar 

  23. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of DAC, pp. 530–535. ACM (2001)

    Google Scholar 

  24. Nöhrer, A., Biere, A., Egyed, A.: Managing SAT inconsistencies with HUMUS. In: Proceedings of VaMoS, pp. 83–91. ACM (2012)

    Google Scholar 

  25. O’Sullivan, B., Papadopoulos, A., Faltings, B., Pu, P.: Representative explanations for over-constrained problems. In: Proceedings of AAAI, pp. 323–328. AAAI Press (2007)

    Google Scholar 

  26. Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32(1), 57–95 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  27. Sang, T., Bacchus, F., Beame, P., Kautz, H.A., Pitassi, T.: Combining component caching and clause learning for effective model counting. In: SAT Online Proceedings (2004)

    Google Scholar 

  28. Silva, J.P.M., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506–521 (1999)

    Article  MathSciNet  Google Scholar 

  29. Slaney, J.: Set-theoretic duality: a fundamental feature of combinatorial optimisation. In: Proceedings of ECAI. Frontiers in Artificial Intelligence and Applications, vol. 263, pp. 843–848. IOS Press (2014)

    Google Scholar 

  30. Thurley, M.: sharpSAT – counting models with advanced component caching and implicit BCP. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 424–429. Springer, Heidelberg (2006). doi:10.1007/11814948_38

    Chapter  Google Scholar 

  31. Zielke, C., Kaufmann, M.: A new approach to partial MUS enumeration. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 387–404. Springer, Cham (2015). doi:10.1007/978-3-319-24318-4_28

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HIIT, Department of Computer Science, University of Helsinki, Helsinki, Finland

    Alessandro Previti & Matti Järvisalo

  2. Department of Computer Science, University of Oviedo, Gijón, Spain

    Carlos Mencía

  3. LASIGE, Faculty of Science, University of Lisbon, Lisbon, Portugal

    Joao Marques-Silva

Authors
  1. Alessandro Previti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlos Mencía
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Matti Järvisalo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Joao Marques-Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alessandro Previti .

Editor information

Editors and Affiliations

  1. UNSW Sydney, Sydney, New South Wales, Australia

    Serge Gaspers

  2. University of New South Wales , Sydney, New South Wales, Australia

    Toby Walsh

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Previti, A., Mencía, C., Järvisalo, M., Marques-Silva, J. (2017). Improving MCS Enumeration via Caching. In: Gaspers, S., Walsh, T. (eds) Theory and Applications of Satisfiability Testing – SAT 2017. SAT 2017. Lecture Notes in Computer Science(), vol 10491. Springer, Cham. https://doi.org/10.1007/978-3-319-66263-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66263-3_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66262-6

  • Online ISBN: 978-3-319-66263-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics