{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T18:21:58Z","timestamp":1769278918753,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319662626","type":"print"},{"value":"9783319662633","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66263-3_12","type":"book-chapter","created":{"date-parts":[[2017,8,8]],"date-time":"2017-08-08T08:05:11Z","timestamp":1502179511000},"page":"184-194","source":"Crossref","is-referenced-by-count":9,"title":["Improving MCS Enumeration via Caching"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Previti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Menc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matti","family":"J\u00e4rvisalo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,9]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-24318-4_24","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"MF Arif","year":"2015","unstructured":"Arif, M.F., Menc\u00eda, 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\u2013342. Springer, Cham (2015). doi: 10.1007\/978-3-319-24318-4_24"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1613\/jair.2648","volume":"34","author":"F Bacchus","year":"2009","unstructured":"Bacchus, F., Dalmao, S., Pitassi, T.: Solving #SAT and Bayesian inference with backtracking search. J. Artif. Intell. Res. 34, 391\u2013442 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bacchus, F., Davies, J., Tsimpoukelli, M., Katsirelos, G.: Relaxation search: a simple way of managing optional clauses. In: Proceedings of AAAI, pp. 835\u2013841. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.8849"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-30557-6_14","volume-title":"Practical Aspects of Declarative Languages","author":"J Bailey","year":"2005","unstructured":"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\u2013186. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-30557-6_14"},{"issue":"3","key":"12_CR5","first-page":"9:1","volume":"1","author":"P Beame","year":"2010","unstructured":"Beame, P., Impagliazzo, R., Pitassi, T., Segerlind, N.: Formula caching in DPLL. Trans. Comput. Theor. 1(3), 9:1\u20139:33 (2010)","journal-title":"Trans. Comput. Theor."},{"issue":"1","key":"12_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/0952813021000026795","volume":"15","author":"E Birnbaum","year":"2003","unstructured":"Birnbaum, E., Lozinskii, E.L.: Consistent subsets of inconsistent systems: structure and behaviour. J. Exp. Theor. Artif. Intell. 15(1), 25\u201346 (2003)","journal-title":"J. Exp. Theor. Artif. Intell."},{"issue":"2","key":"12_CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1006\/inco.1995.1087","volume":"119","author":"Z Chen","year":"1995","unstructured":"Chen, Z., Toda, S.: The complexity of selecting maximal solutions. Inf. Comput. 119(2), 231\u2013239 (1995)","journal-title":"Inf. Comput."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of STOC, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-24605-3_37"},{"issue":"1","key":"12_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1017\/S0890060411000011","volume":"26","author":"A Felfernig","year":"2012","unstructured":"Felfernig, A., Schubert, M., Zehentner, C.: An efficient diagnosis algorithm for inconsistent constraint sets. Artif. Intell. Eng. Des. Anal. Manuf. 26(1), 53\u201362 (2012)","journal-title":"Artif. Intell. Eng. Des. Anal. Manuf."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Lagniez, J., Mazure, B.: An experimentally efficient method for (MSS, coMSS) partitioning. In: Proceedings of AAAI, pp. 2666\u20132673. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.9118"},{"key":"12_CR12","unstructured":"Kitching, M., Bacchus, F.: Symmetric component caching. In: Proceedings of IJCAI, pp. 118\u2013124 (2007)"},{"key":"12_CR13","unstructured":"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)"},{"issue":"2","key":"12_CR14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10601-015-9183-0","volume":"21","author":"MH Liffiton","year":"2016","unstructured":"Liffiton, M.H., Previti, A., Malik, A., Marques-Silva, J.: Fast, flexible MUS enumeration. Constraints 21(2), 223\u2013250 (2016)","journal-title":"Constraints"},{"issue":"1","key":"12_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"MH Liffiton","year":"2008","unstructured":"Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reasoning 40(1), 1\u201333 (2008)","journal-title":"J. Autom. Reasoning"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Malitsky, Y., O\u2019Sullivan, 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\u20131066. IOS Press (2014)","DOI":"10.1007\/978-3-319-07046-9_26"},{"key":"12_CR17","unstructured":"Marques-Silva, J., Heras, F., Janota, M., Previti, A., Belov, A.: On computing minimal correction subsets. In: Proceedings of IJCAI, pp. 615\u2013622. AAAI Press (2013)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-319-40970-2_21","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"C Menc\u00eda","year":"2016","unstructured":"Menc\u00eda, 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\u2013360. Springer, Cham (2016). doi: 10.1007\/978-3-319-40970-2_21"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Menc\u00eda, C., Marques-Silva, J.: Efficient relaxations of over-constrained CSPs. In: Proceedings of ICTAI, pp. 725\u2013732. IEEE Computer Society (2014)","DOI":"10.1109\/ICTAI.2014.113"},{"key":"12_CR20","unstructured":"Menc\u00eda, C., Previti, A., Marques-Silva, J.: Literal-based MCS extraction. In: Proceedings of IJCAI, pp. 1973\u20131979. AAAI Press (2015)"},{"issue":"1","key":"12_CR21","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1021902812784","volume":"8","author":"P Meseguer","year":"2003","unstructured":"Meseguer, P., Bouhmala, N., Bouzoubaa, T., Irgens, M., S\u00e1nchez, M.: Current approaches for solving over-constrained problems. Constraints 8(1), 9\u201339 (2003)","journal-title":"Constraints"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-39611-3_13","volume-title":"Hardware and Software: Verification and Testing","author":"A Morgado","year":"2013","unstructured":"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\u2013101. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39611-3_13"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of DAC, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"N\u00f6hrer, A., Biere, A., Egyed, A.: Managing SAT inconsistencies with HUMUS. In: Proceedings of VaMoS, pp. 83\u201391. ACM (2012)","DOI":"10.1145\/2110147.2110157"},{"key":"12_CR25","unstructured":"O\u2019Sullivan, B., Papadopoulos, A., Faltings, B., Pu, P.: Representative explanations for over-constrained problems. In: Proceedings of AAAI, pp. 323\u2013328. AAAI Press (2007)"},{"issue":"1","key":"12_CR26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32(1), 57\u201395 (1987)","journal-title":"Artif. Intell."},{"key":"12_CR27","unstructured":"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)"},{"issue":"5","key":"12_CR28","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JPM Silva","year":"1999","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"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\u2013848. IOS Press (2014)","DOI":"10.3233\/978-1-61499-419-0-843"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11814948_38","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"M Thurley","year":"2006","unstructured":"Thurley, M.: sharpSAT \u2013 counting models with advanced component caching and implicit BCP. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 424\u2013429. Springer, Heidelberg (2006). doi: 10.1007\/11814948_38"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-24318-4_28","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"C Zielke","year":"2015","unstructured":"Zielke, C., Kaufmann, M.: A new approach to partial MUS enumeration. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 387\u2013404. Springer, Cham (2015). doi: 10.1007\/978-3-319-24318-4_28"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66263-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T20:59:51Z","timestamp":1750798791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66263-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319662626","9783319662633"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66263-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}