{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T19:34:19Z","timestamp":1790451259578,"version":"4.1.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031742088","type":"print"},{"value":"9783031742095","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74209-5_15","type":"book-chapter","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T06:01:44Z","timestamp":1728626504000},"page":"187-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Answer Set Explanations via\u00a0Preferred Unit-Provable Unsatisfiable Subsets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2052-2063","authenticated-orcid":false,"given":"Mario","family":"Alviano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2622-2632","authenticated-orcid":false,"given":"Susana","family":"Hahn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1432-042X","authenticated-orcid":false,"given":"Orkunt","family":"Sabuncu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9663-2666","authenticated-orcid":false,"given":"Hannes","family":"Weichelt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"key":"15_CR1","unstructured":"Alviano, M., Cirimele, D., Rodriguez\u00a0Reiners, L.A.: Introducing ASP recipes and ASP chef. In: ICLP 2023 Workshops, London, United Kingdom, 9\u201310 July 2023. CEUR Workshop Proceedings, vol.\u00a03437. CEUR-WS.org (2023). https:\/\/ceur-ws.org\/Vol-3437\/paper4ASPOCP.pdf"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Alviano, M., Dodaro, C., Fiorentino, S., Previti, A., Ricca, F.: ASP and subset minimality: enumeration, cautious reasoning and muses. Artif. Intell. 320 (2023)","DOI":"10.1016\/j.artint.2023.103931"},{"key":"15_CR3","unstructured":"Alviano, M., Trieu, L.L.T., Son, T.C., Balduccini, M.: Advancements in xASP, an XAI system for answer set programming. In: CILC. CEUR Workshop Proceedings, vol.\u00a03428. CEUR-WS.org (2023)"},{"key":"15_CR4","unstructured":"Beame, P., Kautz, H.A., Sabharwal, A.: Understanding the power of clause learning. In: IJCAI, pp. 1194\u20131201. Morgan Kaufmann (2003)"},{"key":"15_CR5","unstructured":"B\u00e9atrix, C., Lef\u00e8vre, C., Garcia, L., St\u00e9phan, I.: Justifications and blocking sets in a rule-based answer set computation. In: ICLP (TC). OASIcs, vol.\u00a052, pp. 6:1\u20136:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"124","DOI":"10.4204\/EPTCS.325.19","volume":"325","author":"P Cabalar","year":"2020","unstructured":"Cabalar, P., Fandinno, J., Mu\u00f1iz, B.: A system for explainable answer set programming. Electron. Proc. Theor. Comput. Sci. 325, 124\u2013136 (2020)","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S1471068419000450","volume":"20","author":"F Calimeri","year":"2020","unstructured":"Calimeri, F., et al.: ASP-Core-2 input language format. Theory Pract. Log. Program. 20(2), 294\u2013309 (2020)","journal-title":"Theory Pract. Log. Program."},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-642-40564-8_53","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C Viegas Dam\u00e1sio","year":"2013","unstructured":"Viegas Dam\u00e1sio, C., Analyti, A., Antoniou, G.: Justifications for logic programming. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol. 8148, pp. 530\u2013542. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40564-8_53"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1017\/S1471068418000492","volume":"19","author":"C Dodaro","year":"2019","unstructured":"Dodaro, C., Gasteiger, P., Reale, K., Ricca, F., Schekotihin, K.: Debugging non-ground ASP programs: technique and graphical tools. Theory Pract. Log. Program. 19(2), 290\u2013316 (2019)","journal-title":"Theory Pract. Log. Program."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1613\/jair.1.14260","volume":"78","author":"E Gamba","year":"2023","unstructured":"Gamba, E., Bogaerts, B., Guns, T.: Efficiently explaining CSPs with unsatisfiable subset optimization. J. Artif. Intell. Res. 78, 709\u2013746 (2023)","journal-title":"J. Artif. Intell. Res."},{"key":"15_CR11","unstructured":"Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Warren, D., Szeredi, P. (eds.) Logic Programming: Proceedings of the Seventh International Conference, pp. 579\u2013597 (1990)"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Hahn, S., Sabuncu, O., Schaub, T., Stolzmann, T.: Clingraph: a system for asp-based visualization. CoRR abs\/2303.10118 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2303.10118","DOI":"10.48550\/ARXIV.2303.10118"},{"key":"15_CR13","unstructured":"Huitzil, I., Mazzotta, G., Pe\u00f1aloza, R., Ricca, F.: ASP-based axiom pinpointing for description logics. In: Description Logics. CEUR Workshop Proceedings, vol.\u00a03515. CEUR-WS.org (2023)"},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S1471068421000508","volume":"23","author":"R Kaminski","year":"2023","unstructured":"Kaminski, R., Romero, J., Schaub, T., Wanko, P.: How to build your own asp-based system?! Theory Pract. Log. Program. 23(1), 299\u2013361 (2023)","journal-title":"Theory Pract. Log. Program."},{"issue":"1","key":"15_CR15","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. J. Autom. Reason. 40(1), 1\u201333 (2008)","journal-title":"J. Autom. Reason."},{"issue":"5","key":"15_CR16","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1017\/S1471068422000266","volume":"22","author":"S Marynissen","year":"2022","unstructured":"Marynissen, S., Heyninck, J., Bogaerts, B., Denecker, M.: On nested justification systems. Theory Pract. Log. Program. 22(5), 641\u2013657 (2022)","journal-title":"Theory Pract. Log. Program."},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1017\/S1471068414000702","volume":"16","author":"C Schulz","year":"2016","unstructured":"Schulz, C., Toni, F.: Justifying answer sets using argumentation. Theory Pract. Logic Program. 16(1), 59\u2013110 (2016)","journal-title":"Theory Pract. Logic Program."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-031-15707-3_28","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"LLT Trieu","year":"2022","unstructured":"Trieu, L.L.T., Son, T.C., Balduccini, M.: xASP: an explanation generation system for answer set programming. In: Gottlob, G., Inclezan, D., Maratea, M. (eds.) LPNMR 2022. LNCS, vol. 13416, pp. 363\u2013369. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15707-3_28"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74209-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:03:05Z","timestamp":1736614985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74209-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"ISBN":["9783031742088","9783031742095"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74209-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"9 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2024.demacs.unical.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}