{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:56:41Z","timestamp":1742990201089,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030974534"},{"type":"electronic","value":"9783030974541"}],"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:\/\/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:\/\/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-030-97454-1_4","type":"book-chapter","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:02:28Z","timestamp":1645646548000},"page":"41-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Answer-Set Programs for Reasoning About Counterfactual Interventions and Responsibility Scores for Classification"],"prefix":"10.1007","author":[{"given":"Leopoldo","family":"Bertossi","sequence":"first","affiliation":[]},{"given":"Gabriela","family":"Reyes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,24]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1017\/S1471068408003645","volume":"9","author":"C Baral","year":"2009","unstructured":"Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theor. Pract. Logic Program. 9(1), 57\u2013144 (2009)","journal-title":"Theor. Pract. Logic Program."},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00224-016-9718-9","volume":"61","author":"L Bertossi","year":"2016","unstructured":"Bertossi, L., Salimi, B.: From causes for database queries to repairs and model-based diagnosis and back. Theor. Comput. Syst. 61(1), 191\u2013232 (2016). https:\/\/doi.org\/10.1007\/s00224-016-9718-9","journal-title":"Theor. Comput. Syst."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bertossi, L., Li, J., Schleich, M., Suciu, D., Vagena, Z.: Causality-based explanation of classification outcomes. In: Proceedings of the Fourth Workshop on Data Management for End-To-End Machine Learning, DEEM@SIGMOD 2020, pp. 6:1\u20136:10 (2020)","DOI":"10.1145\/3399579.3399865"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-030-57977-7_5","volume-title":"Rules and Reasoning","author":"L Bertossi","year":"2020","unstructured":"Bertossi, L.: An ASP-based approach to counterfactual explanations for classification. In: Guti\u00e9rrez-Basulto, V., Kliegr, T., Soylu, A., Giese, M., Roman, D. (eds.) RuleML+RR 2020. LNCS, vol. 12173, pp. 70\u201381. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57977-7_5"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Bertossi, L.: Declarative approaches to counterfactual explanations for classification. Theory Pract. Logic Program. (2021). https:\/\/doi.org\/10.1017\/S1471068421000582","DOI":"10.1017\/S1471068421000582"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Bertossi, L.: Score-based explanations in data management and machine learning: an answer-set programming approach to counterfactual analysis. In: \u0160imkus, M., Varzinczak, I. (eds.) Reasoning Web 2021. LNCS, vol. 13100, pp. 145\u2013184. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95481-9_7","DOI":"10.1007\/978-3-030-95481-9_7"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bertossi, L., Reyes, G.: Answer-set programs for reasoning about counterfactual interventions and responsibility scores for classification. Extended version of this paper. arXiv Paper 2107.10159 (2021)","DOI":"10.1007\/978-3-030-97454-1_4"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3386687","volume":"12","author":"L Bertossi","year":"2020","unstructured":"Bertossi, L., Geerts, F.: Data quality and explainable AI. ACM J. Data Inf. Qual. 12(2), 1\u20139 (2020)","journal-title":"ACM J. Data Inf. Qual."},{"issue":"12","key":"4_CR9","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-89982-2_37","volume-title":"Logic Programming","author":"F Calimeri","year":"2008","unstructured":"Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable functions in ASP: theory and implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 407\u2013424. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89982-2_37"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-04238-6_46","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"F Calimeri","year":"2009","unstructured":"Calimeri, F., Cozza, S., Ianni, G., Leone, N.: An ASP system with functions, lists, and sets. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 483\u2013489. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04238-6_46"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1613\/jair.1391","volume":"22","author":"H Chockler","year":"2004","unstructured":"Chockler, H., Halpern, J.: Responsibility and blame: a structural-model approach. J. Artif. Intell. Res. 22, 93\u2013115 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"De Raedt, L., Kimmig, A.: Probabilistic (logic) programming concepts. Mach. Learn. 100(1), 5\u201347 (2015)","DOI":"10.1007\/s10994-015-5494-z"},{"key":"4_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01574-8","volume-title":"Statistical Relational Artificial Intelligence","author":"L De Raedt","year":"2016","unstructured":"De Raedt, L., Kersting, K., Natarajan, S., Poole, D.: Statistical Relational Artificial Intelligence. Morgan & Claypool Publishers, Synthesis Lectures on Artificial Intelligence and Machine Learning (2016)"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9, 365\u2013385 (1991)","journal-title":"New Gener. Comput."},{"key":"4_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139342124","volume-title":"Knowledge Representation and Reasoning, and the Design of Intelligent Agents","author":"M Gelfond","year":"2014","unstructured":"Gelfond, M., Kahl, Y.: Knowledge Representation and Reasoning, and the Design of Intelligent Agents. Cambridge Univ, Press (2014)"},{"issue":"1\u20132","key":"4_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1018999404360","volume":"19","author":"F Giannotti","year":"1997","unstructured":"Giannotti, F., Greco, S., Sacca, D., Zaniolo, C.: Programming with non-determinism in deductive databases. Ann. Math. Artif. Intell. 19(1\u20132), 97\u2013125 (1997)","journal-title":"Ann. Math. Artif. Intell."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Halpern, J., Pearl, J.: Causes and explanations: a structural-model approach. part I: causes. Br. J. Philos. Sci. 56(4), 843\u2013887 (2005)","DOI":"10.1093\/bjps\/axi147"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y.A.: Modification of the Halpern-Pearl definition of causality. In: Proceedings of IJCAI 2015, pp. 3022\u20133033 (2015)","DOI":"10.7551\/mitpress\/9780262035026.003.0002"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Kaminski, R., Romero, J., Schaub, T., Wanko, P.: How to Build Your Own ASP-based system?! arXiv:2008.06692 (2020)","DOI":"10.1017\/S1471068421000508"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Karimi, A.-H., von K\u00fcgelgen, B.J., Sch\u00f6lkopf, B., Valera, I.: A probabilistic approach. In: Proceedings NeurIPS, Algorithmic Recourse under Imperfect Causal Knowledge (2020)","DOI":"10.1145\/3442188.3445899"},{"issue":"2\u20133","key":"4_CR22","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1017\/S1471068410000566","volume":"11","author":"A Kimmig","year":"2011","unstructured":"Kimmig, A., Demoen, B., De Raedt, L., Santos Costa, V., Rocha, R.: On the implementation of the probabilistic logic programming language ProbLog. Theor. Pract. Logic Programm. 11(2\u20133), 235\u2013262 (2011)","journal-title":"Theor. Pract. Logic Programm."},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N Leone","year":"2006","unstructured":"Leone, N., et al.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Logic 7(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Logic"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Lundberg, S., et al.: From local explanations to global understanding with explainable AI for trees. Nat. Mach. Intell. 2(1), 2522\u20135839 (2020)","DOI":"10.1038\/s42256-019-0138-9"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Meliou, A., Gatterbauer, W., Moore, K.F., Suciu, D. The complexity of causality and responsibility for query answers and non-answers. In: Proceedings of VLDB 2010, pp. 34\u201341 (2010)","DOI":"10.14778\/1880172.1880176"},{"issue":"3","key":"4_CR26","first-page":"59","volume":"33","author":"A Meliou","year":"2010","unstructured":"Meliou, A., Gatterbauer, W., Halpern, J.Y., Koch, C., Moore, K.F., Suciu, D.: Causality in databases. IEEE Data Eng. Bull. 33(3), 59\u201367 (2010)","journal-title":"IEEE Data Eng. Bull."},{"key":"4_CR27","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)"},{"key":"4_CR28","unstructured":"Molnar, C.: Interpretable Machine Learning: A Guide for Making Black Box Models Explainable (2020). https:\/\/christophm.github.io\/interpretable-ml-book"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Riguzzi, F.: Foundations of Probabilistic Logic Programming. River Publ. (2018)","DOI":"10.1145\/3191315.3191319"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Roth, A.E. (ed.): The Shapley Value: Essays in Honor of Lloyd S. Cambridge University Press, Shapley (1988)","DOI":"10.1017\/CBO9780511528446"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Rudin, C.: Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nat. Mach. Intell. 2019(1), 206\u2013215. Also arXiv:1811.10154 (2018)","DOI":"10.1038\/s42256-019-0048-x"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Ustun, B., Spangher, A., Liu, Y.: Actionable recourse in linear classification. In: Proceedings of FAT, pp. 10\u201319 (2019)","DOI":"10.1145\/3287560.3287566"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97454-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T20:12:19Z","timestamp":1674850339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97454-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030974534","9783030974541"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97454-1_4","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":"24 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lr2020.iit.demokritos.gr\/","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":"10","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":"16","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":"3","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":"160% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}