{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:59:44Z","timestamp":1742950784602,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157066"},{"type":"electronic","value":"9783031157073"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15707-3_23","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T11:02:47Z","timestamp":1661511767000},"page":"301-314","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Smallest MUSes of\u00a0Quantified Boolean Formulas"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Niskanen","sequence":"first","affiliation":[]},{"given":"Jere","family":"Mustonen","sequence":"additional","affiliation":[]},{"given":"Jeremias","family":"Berg","sequence":"additional","affiliation":[]},{"given":"Matti","family":"J\u00e4rvisalo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Alfano, G., Calautti, M., Greco, S., Parisi, F., Trubitsyna, I.: Explainable acceptance in probabilistic abstract argumentation: complexity and approximation. In: KR, pp. 33\u201343 (2020)","DOI":"10.24963\/kr.2020\/4"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jal.2013.03.009","volume":"11","author":"O Arieli","year":"2013","unstructured":"Arieli, O., Caminada, M.W.A.: A QBF-based formalization of abstract argumentation semantics. J. Appl. Log. 11(2), 229\u2013252 (2013)","journal-title":"J. Appl. Log."},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"Bacchus, F., Hyttinen, A., J\u00e4rvisalo, M., Saikko, P.: Reduced cost fixing in MaxSAT. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 641\u2013651. Springer, Cham (2017). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-66158-2_41","DOI":"10.1007\/978-3-319-66158-2_41"},{"key":"23_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:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-21668-3_5"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Baumann, R., Ulbricht, M.: Choices and their consequences - explaining acceptable sets in abstract argumentation frameworks. In: KR, pp. 110\u2013119 (2021)","DOI":"10.24963\/kr.2021\/11"},{"key":"23_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103470","volume":"295","author":"D Baumeister","year":"2021","unstructured":"Baumeister, D., J\u00e4rvisalo, M., Neugebauer, D., Niskanen, A., Rothe, J.: Acceptance in incomplete argumentation frameworks. Artif. Intell. 295, 103470 (2021)","journal-title":"Artif. Intell."},{"key":"23_CR7","unstructured":"Belov, A., Marques-Silva, J.: Accelerating MUS extraction with recursive model rotation. In: FMCAD, pp. 37\u201340. FMCAD Inc. (2011)"},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Bend\u00edk, J., \u010cern\u00e1, I.: Replication-guided enumeration of minimal unsatisfiable subsets. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 37\u201354. Springer, Cham (2020). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-58475-7_3","DOI":"10.1007\/978-3-030-58475-7_3"},{"key":"23_CR9","unstructured":"Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: NMR, pp. 59\u201364 (2004)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.artint.2018.11.002","volume":"267","author":"G Brewka","year":"2019","unstructured":"Brewka, G., Thimm, M., Ulbricht, M.: Strong inconsistency. Artif. Intell. 267, 78\u2013117 (2019)","journal-title":"Artif. Intell."},{"key":"23_CR11","doi-asserted-by":"publisher","unstructured":"Brewka, G., Ulbricht, M.: Strong explanations for nonmonotonic reasoning. In: Lutz, C., Sattler, U., Tinelli, C., Turhan, A.-Y., Wolter, F. (eds.) Description Logic, Theory Combination, and All That. LNCS, vol. 11560, pp. 135\u2013146. Springer, Cham (2019). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-22102-7_6","DOI":"10.1007\/978-3-030-22102-7_6"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-40627-0_23","volume-title":"Principles and Practice of Constraint Programming","author":"E Delisle","year":"2013","unstructured":"Delisle, E., Bacchus, F.: Solving weighted CSPs by successive relaxations. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 273\u2013281. Springer, Heidelberg (2013). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-642-40627-0_23"},{"issue":"2","key":"23_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321\u2013358 (1995)","journal-title":"Artif. Intell."},{"key":"23_CR14","unstructured":"Egly, U., Woltran, S.: Reasoning in argumentation frameworks using quantified boolean formulas. In: COMMA. FAIA, vol. 144, pp. 133\u2013144. IOS Press (2006)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Fan, X., Toni, F.: On computing explanations in argumentation. In: AAAI, pp. 1496\u20131502. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9420"},{"issue":"2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10601-015-9195-9","volume":"21","author":"A Ignatiev","year":"2015","unstructured":"Ignatiev, A., Janota, M., Marques-Silva, J.: Quantified maximum satisfiability. Constraints 21(2), 277\u2013302 (2015). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10601-015-9195-9","journal-title":"Constraints"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-23219-5_13","volume-title":"Principles and Practice of Constraint Programming","author":"A Ignatiev","year":"2015","unstructured":"Ignatiev, A., Previti, A., Liffiton, M., Marques-Silva, J.: Smallest MUS extraction with minimal hitting set dualization. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 173\u2013182. Springer, Cham (2015). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-23219-5_13"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2016.01.004","volume":"234","author":"M Janota","year":"2016","unstructured":"Janota, M., Klieber, W., Marques-Silva, J., Clarke, E.M.: Solving QBF with counterexample guided refinement. Artif. Intell. 234, 1\u201325 (2016)","journal-title":"Artif. Intell."},{"key":"23_CR19","doi-asserted-by":"publisher","unstructured":"Jordan, C., Kaiser, \u0141.: Experiments with reduction finding. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 192\u2013207. Springer, Heidelberg (2013). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-642-39071-5_15","DOI":"10.1007\/978-3-642-39071-5_15"},{"issue":"2","key":"23_CR20","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.artint.2004.11.002","volume":"163","author":"P Liberatore","year":"2005","unstructured":"Liberatore, P.: Redundancy in logic I: CNF propositional formulae. Artif. Intell. 163(2), 203\u2013232 (2005)","journal-title":"Artif. Intell."},{"issue":"4","key":"23_CR21","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10601-008-9058-8","volume":"14","author":"MH Liffiton","year":"2009","unstructured":"Liffiton, M.H., Mneimneh, M.N., Lynce, I., Andraus, Z.S., Marques-Silva, J., Sakallah, K.A.: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. Constraints 14(4), 415\u2013442 (2009)","journal-title":"Constraints"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-319-10428-7_38","volume-title":"Principles and Practice of Constraint Programming","author":"F Lonsing","year":"2014","unstructured":"Lonsing, F., Egly, U.: Incremental QBF solving. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 514\u2013530. Springer, Cham (2014). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-10428-7_38"},{"key":"23_CR23","doi-asserted-by":"publisher","unstructured":"Lonsing, F., Egly, U.: Incrementally computing minimal unsatisfiable cores of QBFs via a clause group solver API. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 191\u2013198. Springer, Cham (2015). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-24318-4_14","DOI":"10.1007\/978-3-319-24318-4_14"},{"key":"23_CR24","doi-asserted-by":"publisher","unstructured":"Lonsing, F., Egly, U.: DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 371\u2013384. Springer, Cham (2017). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-63046-5_23","DOI":"10.1007\/978-3-319-63046-5_23"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Menc\u00eda, C.: Reasoning about inconsistent formulas. In: IJCAI, pp. 4899\u20134906. ijcai.org (2020)","DOI":"10.24963\/ijcai.2020\/682"},{"key":"23_CR26","doi-asserted-by":"publisher","unstructured":"Menc\u00eda, C., Marques-Silva, J.: Reasoning about strong inconsistency in ASP. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 332\u2013342. Springer, Cham (2020). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-51825-7_24","DOI":"10.1007\/978-3-030-51825-7_24"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Niskanen, A., J\u00e4rvisalo, M.: Smallest explanations and diagnoses of rejection in abstract argumentation. In: KR, pp. 667\u2013671 (2020)","DOI":"10.24963\/kr.2020\/67"},{"key":"23_CR28","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"issue":"1","key":"23_CR29","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0022-0000(88)90042-6","volume":"37","author":"CH Papadimitriou","year":"1988","unstructured":"Papadimitriou, C.H., Wolfe, D.: The complexity of facets resolved. J. Comput. Syst. Sci. 37(1), 2\u201313 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"23_CR30","doi-asserted-by":"publisher","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":"23_CR31","unstructured":"Saikko, P., Dodaro, C., Alviano, M., J\u00e4rvisalo, M.: A hybrid approach to optimization in answer set programming. In: KR, pp. 32\u201341. AAAI Press (2018)"},{"key":"23_CR32","unstructured":"Saikko, P., Wallner, J.P., J\u00e4rvisalo, M.: Implicit hitting set algorithms for reasoning beyond NP. In: KR, pp. 104\u2013113. AAAI Press (2016)"},{"issue":"2\u20133","key":"23_CR33","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1080\/11663081.2018.1487241","volume":"28","author":"C Sakama","year":"2018","unstructured":"Sakama, C.: Abduction in argumentation frameworks. J. Appl. Non Class. Logics 28(2\u20133), 218\u2013239 (2018)","journal-title":"J. Appl. Non Class. Logics"},{"key":"23_CR34","unstructured":"Saribatur, Z.G., Wallner, J.P., Woltran, S.: Explaining non-acceptability in abstract argumentation. In: ECAI, FAIA, vol. 325, pp. 881\u2013888. IOS Press (2020)"},{"key":"23_CR35","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1613\/jair.1.11791","volume":"66","author":"M Ulbricht","year":"2019","unstructured":"Ulbricht, M., Baumann, R.: If nothing is accepted - repairing argumentation frameworks. J. Artif. Intell. Res. 66, 1099\u20131145 (2019)","journal-title":"J. Artif. Intell. Res."},{"key":"23_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103344","volume":"286","author":"M Ulbricht","year":"2020","unstructured":"Ulbricht, M., Thimm, M., Brewka, G.: Handling and measuring inconsistency in non-monotonic logics. Artif. Intell. 286, 103344 (2020)","journal-title":"Artif. Intell."},{"key":"23_CR37","doi-asserted-by":"crossref","unstructured":"Ulbricht, M., Wallner, J.P.: Strong explanations in abstract argumentation. In: AAAI, pp. 6496\u20136504. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i7.16805"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15707-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T21:33:50Z","timestamp":1669412030000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-031-15707-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157066","9783031157073"],"references-count":37,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-031-15707-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Genoa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/lpnmr2022.dibris.unige.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"57","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":"34","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":"5","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":"60% - 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","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","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)"}}]}}