{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T17:21:54Z","timestamp":1775496114254,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030584740","type":"print"},{"value":"9783030584757","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58475-7_3","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"37-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Replication-Guided Enumeration of Minimal Unsatisfiable Subsets"],"prefix":"10.1007","author":[{"given":"Jaroslav","family":"Bend\u00edk","sequence":"first","affiliation":[]},{"given":"Ivana","family":"\u010cern\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"3_CR1","unstructured":"Andraus, Z.S., Liffiton, M.H., Sakallah, K.A.: Cegar-based formal hardware verification: a case study. Technical report, University of Michigan, CSE-TR-531-07 (2007)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-319-40970-2_32","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"MF Arif","year":"2016","unstructured":"Arif, M.F., Menc\u00eda, C., Ignatiev, A., Manthey, N., Pe\u00f1aloza, R., Marques-Silva, J.: BEACON: an efficient sat-based tool for debugging $${\\cal{EL}}{^+}$$ ontologies. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 521\u2013530. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_32"},{"key":"3_CR3","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: IJCAI, pp. 399\u2013404 (2009)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-319-21668-3_5","volume-title":"Computer Aided Verification","author":"F Bacchus","year":"2015","unstructured":"Bacchus, F., Katsirelos, G.: Using minimal correction sets to more efficiently compute minimal unsatisfiable sets. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9207, pp. 70\u201386. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21668-3_5"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-33954-2_3","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"F Bacchus","year":"2016","unstructured":"Bacchus, F., Katsirelos, G.: Finding a collection of MUSes incrementally. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 35\u201344. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33954-2_3"},{"key":"3_CR6","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). https:\/\/doi.org\/10.1007\/978-3-540-30557-6_14"},{"key":"3_CR7","unstructured":"Belov, A., Marques-Silva, J.: Accelerating MUS extraction with recursive model rotation. In: FMCAD, pp. 37\u201340. FMCAD Inc. (2011)"},{"key":"3_CR8","first-page":"123","volume":"8","author":"A Belov","year":"2012","unstructured":"Belov, A., Marques-Silva, J.: MUSer2: an efficient MUS extractor. JSAT 8, 123\u2013128 (2012)","journal-title":"JSAT"},{"key":"3_CR9","unstructured":"Bend\u00edk, J., Bene\u0161, N., \u010cern\u00e1, I., Barnat, J.: Tunable online MUS\/MSS enumeration. In: FSTTCS, LIPIcs, vol. 65, pages 50:1\u201350:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"3_CR10","unstructured":"Jaroslav Bend\u00edk and Ivana \u010cern\u00e1. Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets. In: LPAR, EPiC Series in Computing, vol. 57, pp. 131\u2013142. EasyChair (2018)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-45190-5_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Bend\u00edk","year":"2020","unstructured":"Bend\u00edk, J., \u010cern\u00e1, I.: MUST: minimal unsatisfiable subsets enumeration tool. TACAS 2020. LNCS, vol. 12078, pp. 135\u2013152. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45190-5_8"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-030-01090-4_9","volume-title":"Automated Technology for Verification and Analysis","author":"J Bend\u00edk","year":"2018","unstructured":"Bend\u00edk, J., \u010cern\u00e1, I., Bene\u0161, N.: Recursive online enumeration of all minimal unsatisfiable subsets. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 143\u2013159. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_9"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-92970-5_12","volume-title":"Software Engineering and Formal Methods","author":"J Bend\u00edk","year":"2018","unstructured":"Bend\u00edk, J., Ghassabani, E., Whalen, M., \u010cern\u00e1, I.: Online enumeration of all minimal inductive validity cores. In: Johnsen, E.B., Schaefer, I. (eds.) SEFM 2018. LNCS, vol. 10886, pp. 189\u2013204. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92970-5_12"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-030-53288-8_21","volume-title":"Computer Aided Verification","author":"J Bend\u00edk","year":"2020","unstructured":"Bend\u00edk, J., Meel, K.S.: Approximate counting of minimal unsatisfiable subsets. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12224, pp. 439\u2013462. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_21"},{"key":"3_CR15","unstructured":"Biere, A.: Cadical, lingeling, plingeling, treengeling and yalsat entering the sat competition 2018. In: Proceedings of SAT Competition, pp. 13\u201314 (2018)"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.1006","volume":"18","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Borgs, C., Chayes, J.T., Kim, J.H., Wilson, D.B.: The scaling window of the 2-sat transition. Random Struct. Algorithms 18(3), 201\u2013256 (2001)","journal-title":"Random Struct. Algorithms"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Chen, H., Marques-Silva, J.: Improvements to satisfiability-based Boolean function bi-decomposition. In: VLSI-SoC, pp. 142\u2013147. IEEE (2011)","DOI":"10.1007\/978-3-642-32770-4_4"},{"key":"3_CR18","unstructured":"Cohen, O., Gordon, M., Lifshits, M., Nadel, A., Ryvchin, V.: Designers work less with quality formal equivalence checking. In: Design and Verification Conference (DVCon). Citeseer (2010)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"de la Banda, M.J.G., Stuckey, P.J., Wazny, J.: Finding all minimal unsatisfiable subsets. In: PPDP, pp. 32\u201343. ACM (2003)","DOI":"10.1145\/888251.888256"},{"key":"3_CR20","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). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/3477.752801","volume":"29","author":"B Han","year":"1999","unstructured":"Han, B., Lee, S.-J.: Deriving minimal conflict sets by CS-trees with mark set in diagnosis from first principles. IEEE Trans. Syst. Man Cybern. Part B 29(2), 281\u2013286 (1999)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"issue":"2","key":"3_CR22","first-page":"281","volume":"65","author":"A Hou","year":"1994","unstructured":"Hou, A.: A theory of measurement in diagnosis from first principles. AI 65(2), 281\u2013328 (1994)","journal-title":"AI"},{"key":"3_CR23","unstructured":"Hunter, A., Konieczny, S.: Measuring inconsistency through minimal inconsistent sets. In: KR, pp. 358\u2013366. AAAI Press (2008)"},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10601-015-9204-z","volume":"21","author":"A Ivrii","year":"2015","unstructured":"Ivrii, A., Malik, S., Meel, K.S., Vardi, M.Y.: On computing minimal independent support and its applications to sampling and counting. Constraints 21(1), 41\u201358 (2015). https:\/\/doi.org\/10.1007\/s10601-015-9204-z","journal-title":"Constraints"},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10515-014-0141-7","volume":"23","author":"D Jannach","year":"2014","unstructured":"Jannach, D., Schmitz, T.: Model-based diagnosis of spreadsheet programs: a constraint-based debugging approach. Autom. Softw. Eng. 23(1), 105\u2013144 (2014). https:\/\/doi.org\/10.1007\/s10515-014-0141-7","journal-title":"Autom. Softw. Eng."},{"key":"3_CR26","unstructured":"Kilby, P., Slaney, J.K., Thi\u00e9baux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: AAAI, pp. 1368\u20131373. AAAI Press\/The MIT Press (2005)"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-38171-3_11","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"MH Liffiton","year":"2013","unstructured":"Liffiton, M.H., Malik, A.: Enumerating infeasibility: finding multiple MUSes Quickly. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 160\u2013175. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38171-3_11"},{"issue":"2","key":"3_CR28","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10601-015-9183-0","volume":"21","author":"MH Liffiton","year":"2015","unstructured":"Liffiton, M.H., Previti, A., Malik, A., Marques-Silva, J.: Fast, flexible MUS enumeration. Constraints 21(2), 223\u2013250 (2015). https:\/\/doi.org\/10.1007\/s10601-015-9183-0","journal-title":"Constraints"},{"issue":"1","key":"3_CR29","doi-asserted-by":"publisher","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. JAR 40(1), 1\u201333 (2008). https:\/\/doi.org\/10.1007\/s10817-007-9084-z","journal-title":"JAR"},{"issue":"11","key":"3_CR30","doi-asserted-by":"publisher","first-page":"212104","DOI":"10.1007\/s11432-019-9881-0","volume":"62","author":"J Luo","year":"2019","unstructured":"Luo, J., Liu, S.: Accelerating MUS enumeration by inconsistency graph partitioning. Sci. China Inf. Sci. 62(11), 212104 (2019). https:\/\/doi.org\/10.1007\/s11432-019-9881-0","journal-title":"Sci. China Inf. Sci."},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-030-24258-9_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"C Menc\u00eda","year":"2019","unstructured":"Menc\u00eda, C., Kullmann, O., Ignatiev, A., Marques-Silva, J.: On computing the union of MUSes. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 211\u2013221. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_15"},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1613\/jair.1.11720","volume":"66","author":"M Kedian","year":"2019","unstructured":"Kedian, M.: Formulas free from inconsistency: an atom-centric characterization in priest\u2019s minimally inconsistent LP. J. Artif. Intell. Res. 66, 279\u2013296 (2019)","journal-title":"J. Artif. Intell. Res."},{"key":"3_CR33","unstructured":"Narodytska, N., Bj\u00f8rner, N., Marinescu, M.-C., Sagiv, M.: Core-guided minimal correction set and core enumeration. In: IJCAI, pp. 1353\u20131361 (2018). https:\/\/www.ijcai.org\/"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Previti, A., Marques-Silva, J.: Partial MUS enumeration. In: AAAI. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8657"},{"issue":"1","key":"3_CR35","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"Sperner, E.: Ein satz \u00fcber untermengen einer endlichen menge. Math. Z. 27(1), 544\u2013548 (1928). https:\/\/doi.org\/10.1007\/BF01171114","journal-title":"Math. Z."},{"key":"3_CR36","unstructured":"Stern, R.T., Kalech, M., Feldman, A., Provan, G.M.: Exploring the duality in conflict-directed model-based diagnosis. In: AAAI. AAAI Press (2012)"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Stuckey, P.J., Sulzmann, M., Wazny, J.: Interactive type debugging in haskell. In: Haskell, pp. 72\u201383. ACM (2003)","DOI":"10.1145\/871895.871903"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/978-3-642-33558-7_49","volume-title":"Principles and Practice of Constraint Programming","author":"S Wieringa","year":"2012","unstructured":"Wieringa, S.: Understanding, improving and parallelizing MUS finding using model rotation. In: Milano, M. (ed.) CP 2012. LNCS, pp. 672\u2013687. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_49"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T22:49:40Z","timestamp":1668638980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"122","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.13","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.47","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}