{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T21:40:02Z","timestamp":1766439602705,"version":"3.48.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003032","name":"Association Nationale de la Recherche et de la Technologie","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003032","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10994-025-06869-z","type":"journal-article","created":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T16:07:35Z","timestamp":1761667655000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Common abductive explanations in first order logic"],"prefix":"10.1007","volume":"114","author":[{"given":"C\u00e9line","family":"Rouveirol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry","family":"Soldano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malik","family":"Kazi Aoual","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e9ronique","family":"Ventos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,28]]},"reference":[{"issue":"4","key":"6869_CR1","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s10994-020-05941-0","volume":"110","author":"L Ai","year":"2021","unstructured":"Ai, L., Muggleton, S. H., Hocquette, C., Gromowski, M., & Schmid, U. (2021). Beneficial and harmful explanatory machine learning. Machine Learning, 110(4), 695\u2013721.","journal-title":"Machine Learning"},{"key":"6869_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103500","volume":"297","author":"S Arora","year":"2021","unstructured":"Arora, S., & Doshi, P. (2021). A survey of inverse reinforcement learning: Challenges, methods and progress. Artificial Intelligence, 297, 103500.","journal-title":"Artificial Intelligence"},{"key":"6869_CR3","doi-asserted-by":"crossref","unstructured":"Audemard, G., Bellart, S., Bounia, L., Koriche, F., Lagniez, J. & Marquis, P. (2022a). On preferred abductive explanations for decision trees and random forests. In: Proc. IJCAI\u201922, pp. 643\u2013650. ijcai.org, Online.","DOI":"10.24963\/ijcai.2022\/91"},{"key":"6869_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2022.102088","volume":"142","author":"G Audemard","year":"2022","unstructured":"Audemard, G., Bellart, S., Bounia, L., Koriche, F., Lagniez, J., & Marquis, P. (2022b). On the explanatory power of Boolean decision trees. Data & Knowledge Engineering, 142, 102088.","journal-title":"Data & Knowledge Engineering"},{"key":"6869_CR4","doi-asserted-by":"crossref","unstructured":"Audemard, G., Lagniez, J., Marquis, P. & Szczepanski, N. (2023). On contrastive explanations for tree-based classifiers. In: Proc. ECAI\u201923. Frontiers in Artificial Intelligence and Applications, vol. 372, pp. 117\u2013124. IOS Press, Amsterdam, The Netherlands.","DOI":"10.3233\/FAIA230261"},{"key":"6869_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009867806624","volume":"3","author":"H Blockeel","year":"1999","unstructured":"Blockeel, H., Raedt, L. D., Jacobs, N., & Demoen, B. (1999). Scaling up inductive logic programming by learning from interpretations. Data Mining and Knowledge Discovery, 3, 59\u201393.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"6869_CR7","doi-asserted-by":"crossref","unstructured":"Calders, T. & Goethals, B. (2005). Depth-first non-derivable itemset mining. In: Proc. SDM\u201905, pp. 250\u2013261. SIAM, Newport Beach, California, USA.","DOI":"10.1137\/1.9781611972757.23"},{"key":"6869_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF03037231","volume":"13","author":"WW Cohen","year":"1995","unstructured":"Cohen, W. W. (1995). Polynomial learnability and inductive logic programming: Methods and results. New Generation Computing, 13, 369\u2013409.","journal-title":"New Generation Computing"},{"key":"6869_CR9","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1613\/jair.1.13507","volume":"74","author":"A Cropper","year":"2022","unstructured":"Cropper, A., & Dumancic, S. (2022). Inductive logic programming at 30: A new introduction. Journal of Artificial Intelligence Research, 74, 765\u2013850.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6869_CR10","doi-asserted-by":"crossref","unstructured":"Darwiche, A. & Hirth, A. (2020). On the reasons behind decisions. In: Proc. ECAI\u201920. Frontiers in Artificial Intelligence and Applications, vol. 325, pp. 712\u2013720.","DOI":"10.3233\/FAIA200158"},{"issue":"1","key":"6869_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L Dehaspe","year":"1999","unstructured":"Dehaspe, L., & Toivonen, H. (1999). Discovery of frequent DATALOG patterns. Data Mining & Knowledge Discovery, 3(1), 7\u201336.","journal-title":"Data Mining & Knowledge Discovery"},{"key":"6869_CR12","doi-asserted-by":"crossref","unstructured":"Denecker, M., & Kakas, A. (2002). Abduction in logic programming. Lecture Notes in Computer ScienceComputational Logic: Logic Programming and Beyond (Vol. 2407, pp. 402\u2013436). Heidelberg, Germany: Springer.","DOI":"10.1007\/3-540-45628-7_16"},{"key":"6869_CR13","doi-asserted-by":"crossref","unstructured":"Echenim, M. & Peltier, N. (2012). A calculus for generating ground explanations. In: Proc. IJCAR\u201912, vol. 7364, pp. 194\u2013209. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-31365-3_17"},{"key":"6869_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.3233\/FI-2009-0004","volume":"90","author":"S Ferilli","year":"2009","unstructured":"Ferilli, S., Basile, T. M. A., Biba, M., Di Mauro, N., & Esposito, F. (2009). A general similarity framework for horn clause logic. Fundamenta Informaticae, 90, 43\u201366.","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"6869_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10472-012-9324-8","volume":"69","author":"GC Garriga","year":"2013","unstructured":"Garriga, G. C., Khardon, R., & Raedt, L. D. (2013). Mining closed patterns in relational, graph and network data. Annals of Mathematics and Artificial Intelligence, 69(4), 315\u2013342.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"6869_CR16","doi-asserted-by":"crossref","unstructured":"Gorji, N. & Rubin, S. (2022). Sufficient reasons for classifier decisions in the presence of domain constraints. In: Proc. AAAI\u201922, pp. 5660\u20135667. AAAI Press, Washington, DC, USA.","DOI":"10.1609\/aaai.v36i5.20507"},{"issue":"2","key":"6869_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(93)90069-N","volume":"61","author":"G Gottlob","year":"1993","unstructured":"Gottlob, G., & Ferm\u00fcller, C. G. (1993). Removing redundancy from a clause. Artificial Intelligence, 61(2), 263\u2013289.","journal-title":"Artificial Intelligence"},{"issue":"5","key":"6869_CR18","first-page":"93","volume":"51","author":"R Guidotti","year":"2019","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., & Pedreschi, D. (2019). A survey of methods for explaining black box models. ACM ACM Computing Surveys, 51(5), 93\u201319342.","journal-title":"ACM ACM Computing Surveys"},{"key":"6869_CR19","doi-asserted-by":"crossref","unstructured":"Huang, X., Izza, Y., Ignatiev, A. & Marques-Silva, J. (2021). On efficiently explaining graph-based classifiers. In: Proc. KR\u201921, pp. 356\u2013367.","DOI":"10.24963\/kr.2021\/34"},{"key":"6869_CR20","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Narodytska, N. & Marques-Silva, J. (2019). Abduction-based explanations for machine learning models. In: Proc. AAAI\u201919, pp. 1511\u20131519. AAAI Press, Washington, DC, USA.","DOI":"10.1609\/aaai.v33i01.33011511"},{"key":"6869_CR21","unstructured":"Inoue, K. (1991). Consequence-finding based on ordered linear resolution. In: Proc. IJCAI\u201991, pp. 158\u2013164. Morgan Kaufmann, Burlington, Massachusetts."},{"key":"6869_CR23","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1613\/jair.1.13575","volume":"75","author":"Y Izza","year":"2022","unstructured":"Izza, Y., Ignatiev, A., & Marques-Silva, J. (2022). On tackling explanation redundancy in decision trees. Journal of Artificial Intelligence Research, 75, 261\u2013321.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6869_CR22","doi-asserted-by":"crossref","unstructured":"Izza, Y. & Marques-Silva, J. (2021). On explaining random forests with SAT. In: Proc. IJCAI\u201921, pp. 2584\u20132591. ijcai.org, Online.","DOI":"10.24963\/ijcai.2021\/356"},{"key":"6869_CR24","doi-asserted-by":"crossref","unstructured":"Khan, O.Z., Poupart, P. & Black, J.P. (2009). Minimal sufficient explanations for factored Markov decision processes. In: Proc. ICAPS\u201909. AAAI Press, Washington, DC, USA.","DOI":"10.1609\/icaps.v19i1.13365"},{"key":"6869_CR25","doi-asserted-by":"crossref","unstructured":"Kuzelka, O., Szab\u00f3ov\u00e1, A. & Zelezn\u00fd, F. (2012). Bounded least general generalization. In: Proc. ILP\u201912. Lecture Notes in Computer Science, vol. 7842, pp. 116\u2013129. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-38812-5_9"},{"key":"6869_CR26","doi-asserted-by":"crossref","unstructured":"Li, J., Zanuttini, B. & Ventos, V. (2024). Opponent-model search in games with incomplete information. In: Proc. AAAI\u201924, pp. 9840\u20139847. AAAI Press, Washington, DC, USA.","DOI":"10.1609\/aaai.v38i9.28844"},{"key":"6869_CR27","unstructured":"Lundberg, S.M. & Lee, S.-I. (2017). A unified approach to interpreting model predictions. In: Proc. NIPS\u201917, pp. 4768\u20134777. Curran Associates Inc., Red Hook, NY, USA."},{"key":"6869_CR28","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J. & Ignatiev, A. (2022). Delivering trustworthy AI through formal XAI. In: Proc. AAAI\u201922, pp. 12342\u201312350. AAAI Press, Washington, DC, USA.","DOI":"10.1609\/aaai.v36i11.21499"},{"key":"6869_CR29","doi-asserted-by":"crossref","unstructured":"Marquis, P. (1991). Extending abduction from propositional to first-order logic. In: Proc. FAIR\u201991. Lecture Notes in Computer Science, vol. 535, pp. 141\u2013155. Springer, Heidelberg, Germany.","DOI":"10.1007\/3-540-54507-7_12"},{"issue":"7","key":"6869_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3616864","volume":"56","author":"S Milani","year":"2024","unstructured":"Milani, S., Topin, N., Veloso, M., & Fang, F. (2024). Explainable reinforcement learning: A survey and comparative review. ACM Computing Surveys, 56(7), 1\u201336.","journal-title":"ACM Computing Surveys"},{"key":"6869_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2018.07.007","volume":"267","author":"T Miller","year":"2019","unstructured":"Miller, T. (2019). Explanation in artificial intelligence: Insights from the social sciences. Artificial Intelligence, 267, 1\u201338.","journal-title":"Artificial Intelligence"},{"key":"6869_CR32","unstructured":"Molnar, C. (2018). Interpretable Machine Learning - A Guide for Making Black Box Models Explainable. https:\/\/christophm.github.io\/interpretable-ml-book\/"},{"issue":"3 &4","key":"6869_CR34","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"SH Muggleton","year":"1995","unstructured":"Muggleton, S. H. (1995). Inverse entailment and progol. New Generation Computing, 13(3 &4), 245\u2013286.","journal-title":"New Generation Computing"},{"issue":"20","key":"6869_CR35","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S Muggleton","year":"1994","unstructured":"Muggleton, S., & Raedt, L. D. (1994). Inductive logic programming: Theory and methods. Journal of Logic Programming, 19(20), 629\u2013679.","journal-title":"Journal of Logic Programming"},{"key":"6869_CR33","doi-asserted-by":"crossref","unstructured":"Muggleton, S.H., Santos, J.C.A. & Tamaddoni-Nezhad, A. (2009). Progolem: A system based on relative minimal generalisation. In: Proc. ILP\u201909. Lecture Notes in Computer Science, vol. 5989, pp. 131\u2013148. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-13840-9_13"},{"issue":"2\u20133","key":"6869_CR36","doi-asserted-by":"publisher","first-page":"183","DOI":"10.3233\/AIC-2010-0465","volume":"23","author":"H Nabeshima","year":"2010","unstructured":"Nabeshima, H., Iwanuma, K., Inoue, K., & Ray, O. (2010). SOLAR: an automated deduction system for consequence finding. AI Communications, 23(2\u20133), 183\u2013203.","journal-title":"AI Communications"},{"key":"6869_CR37","doi-asserted-by":"crossref","unstructured":"Nienhuys-Cheng, S.-H., & Wolf, R. D. (1997). Foundations of Inductive Logic Programming Lecture Notes in Computer Science (Vol. 1228). New York: Springer.","DOI":"10.1007\/3-540-62927-0"},{"key":"6869_CR38","unstructured":"Otterlo, M. (2008). The logic of adaptive behavior: Knowledge representation and algorithms for the markov decision process framework in first-order domains. PhD thesis, University of Twente, Enschede, Netherlands."},{"key":"6869_CR39","first-page":"153","volume":"5","author":"GD Plotkin","year":"1970","unstructured":"Plotkin, G. D. (1970). A note on inductive generalization. Machine Intelligence, 5, 153\u2013163.","journal-title":"Machine Intelligence"},{"key":"6869_CR40","doi-asserted-by":"crossref","unstructured":"Prentzas, N., Pattichis, C.S. & Kakas, A.C. (2023). Explainable machine learning via argumentation. In: Proc. xAI (part III). Communications in Computer and Information Science, vol. 1903, pp. 371\u2013398. Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-031-44070-0_19"},{"key":"6869_CR41","doi-asserted-by":"crossref","unstructured":"Quinlan, J.R. & Cameron-Jones, R.M. (1993). FOIL: A midterm report. In: Proc. ECML\u201993. Lecture Notes in Computer Science, vol. 667, pp. 3\u201320. Springer, Heidelberg, Germany.","DOI":"10.1007\/3-540-56602-3_124"},{"issue":"5","key":"6869_CR42","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1007\/s10994-021-06048-w","volume":"111","author":"J Rabold","year":"2022","unstructured":"Rabold, J., Siebers, M., & Schmid, U. (2022). Generating contrastive explanations for inductive logic programming based on a near miss approach. Machine Learning, 111(5), 1799\u20131820.","journal-title":"Machine Learning"},{"key":"6869_CR43","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S. & Guestrin, C. (2016). \"Why Should I Trust You?\": Explaining the predictions of any classifier. In: Proc. ACM SIGKDD KDD \u201916, pp. 1135\u20131144.","DOI":"10.1145\/2939672.2939778"},{"key":"6869_CR44","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S. & Guestrin, C. (2018). Anchors: High-precision model-agnostic explanations. In: Proc. AAAI\u201918, vol. 32. AAAI Press, Washington, DC, USA.","DOI":"10.1609\/aaai.v32i1.11491"},{"key":"6869_CR45","doi-asserted-by":"crossref","unstructured":"Rouveirol, C., Aoual, M. K., Soldano, H., & Ventos, V. (2023). Explaining optimal trajectories. Lecture Notes in Computer ScienceRuleML+RR (Vol. 14244, pp. 206\u2013221). Heidelberg, Germany: Springer.","DOI":"10.1007\/978-3-031-45072-3_15"},{"key":"6869_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103367","volume":"288","author":"P Sequeira","year":"2020","unstructured":"Sequeira, P., & Gervasio, M. T. (2020). Interestingness elements for explainable reinforcement learning: Understanding agents\u2019 capabilities and limitations. Artififical Intelligence, 288, Article 103367.","journal-title":"Artififical Intelligence"},{"key":"6869_CR47","doi-asserted-by":"crossref","unstructured":"Shakerin, F. & Gupta, G. (2019). Induction of non-monotonic logic programs to explain boosted tree models using LIME. In: Proc. AAAI 2019, pp. 3052\u20133059. AAAI Press, Washington, DC, USA.","DOI":"10.1609\/aaai.v33i01.33013052"},{"key":"6869_CR48","doi-asserted-by":"crossref","unstructured":"Shih, A., Choi, A. & Darwiche, A. (2018). A symbolic approach to explaining Bayesian network classifiers. In: Proc. IJCAI\u201918, pp. 5103\u20135111. ijcai.org, Online.","DOI":"10.24963\/ijcai.2018\/708"},{"key":"6869_CR49","doi-asserted-by":"crossref","unstructured":"Soldano, H., Santini, G. & Bouthinon, D. (2020). Attributed graph pattern set selection under a distance constraint. In: Complex Networks and Their Applications VIII, pp. 228\u2013241.","DOI":"10.1007\/978-3-030-36683-4_19"},{"key":"6869_CR50","doi-asserted-by":"crossref","unstructured":"Soulet, A. & Rioult, F. (2017). Exact and approximate minimal pattern mining. In: Advances in Knowledge Discovery and Management vol. 6, pp. 61\u201381. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-319-45763-5_4"},{"key":"6869_CR51","unstructured":"Srinivasan, A. (2001). The Aleph Manual. https:\/\/www.cs.ox.ac.uk\/activities\/programinduction\/Aleph\/"},{"key":"6869_CR52","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton, R. S., & Barto, A. G. (1998). Reinforcement Learning: An Introduction. MIT Press."},{"key":"6869_CR53","doi-asserted-by":"crossref","unstructured":"Szathmary, L., Valtchev, P., Napoli, A. & Godin, R. (2009). Efficient vertical mining of frequent closures and generators. In: Proc. IDA\u201909. Lecture Notes in Computer Science, vol. 5772, pp. 393\u2013404. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-03915-7_34"},{"key":"6869_CR54","unstructured":"Winston, P.H. (1970). Learning structural descriptions from examples. PhD thesis, Massachusetts Institute of Technology, USA."},{"key":"6869_CR55","doi-asserted-by":"crossref","unstructured":"Yu, J., Ignatiev, A., Stuckey, P.J., Narodytska, N. & Marques-Silva, J. (2023). Eliminating the impossible, whatever remains must be true: On extracting and applying background knowledge in the context of formal explanations. In: Proc. AAAI, pp. 4123\u20134131. AAAI Press, Washington, DC, USA.","DOI":"10.1609\/aaai.v37i4.25528"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06869-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-025-06869-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06869-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T21:29:38Z","timestamp":1766438978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-025-06869-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,28]]},"references-count":55,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["6869"],"URL":"https:\/\/doi.org\/10.1007\/s10994-025-06869-z","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2025,10,28]]},"assertion":[{"value":"13 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"264"}}