{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:10:58Z","timestamp":1766441458386,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031450716"},{"type":"electronic","value":"9783031450723"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-45072-3_15","type":"book-chapter","created":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T11:01:34Z","timestamp":1697281294000},"page":"206-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Explaining Optimal Trajectories"],"prefix":"10.1007","author":[{"given":"Celine","family":"Rouveirol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malik","family":"Kazi Aoual","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry","family":"Soldano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veronique","family":"Ventos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,15]]},"reference":[{"issue":"4","key":"15_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.: Beneficial and harmful explanatory machine learning. Mach. Learn. 110(4), 695\u2013721 (2021)","journal-title":"Mach. Learn."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Audemard, G., Bellart, S., Bounia, L., Koriche, F., Lagniez, J., Marquis, P.: On preferred abductive explanations for decision trees and random forests. In: Raedt, L.D. (ed.) Proceedings of IJCAI 2022, pp. 643\u2013650 (2022)","DOI":"10.24963\/ijcai.2022\/91"},{"key":"15_CR3","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.: On the explanatory power of boolean decision trees. Data Knowl. Eng. 142, 102088 (2022)","journal-title":"Data Knowl. Eng."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Blockeel, H., Raedt, L.D., Jacobs, N., Demoen, B.: Scaling up inductive logic programming by learning from interpretations. In: DMKD 1999, vol. 3, pp. 59\u201393 (1999)","DOI":"10.1023\/A:1009867806624"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, W.W., Jr., Page, C.D.: Polynomial learnability and inductive logic programming: methods and results. New Gener. Comput. 13(3 &4), 369\u2013409 (1995)","DOI":"10.1007\/BF03037231"},{"key":"15_CR6","unstructured":"Darwiche, A., Hirth, A.: On the reasons behind decisions. In: ECAI 2020. Frontiers in Artificial Intelligence and Applications, vol. 325, pp. 712\u2013720 (2020)"},{"issue":"1\u20132","key":"15_CR7","first-page":"115","volume":"12","author":"L Dehaspe","year":"1999","unstructured":"Dehaspe, L.: Frequent pattern discovery in first-order logic. AI Commun. 12(1\u20132), 115\u2013117 (1999)","journal-title":"AI Commun."},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-31365-3_17","volume-title":"Automated Reasoning","author":"M Echenim","year":"2012","unstructured":"Echenim, M., Peltier, N.: A calculus for generating ground explanations. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 194\u2013209. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31365-3_17"},{"issue":"4","key":"15_CR9","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.: Mining closed patterns in relational, graph and network data. Ann. Math. Artif. Intell. 69(4), 315\u2013342 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Huang, X., Izza, Y., Ignatiev, A., Marques-Silva, J.: On efficiently explaining graph-based classifiers. In: Proceedings of KR 2021, pp. 356\u2013367 (2021)","DOI":"10.24963\/kr.2021\/34"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: Abduction-based explanations for machine learning models. In: AAAI 2019, pp. 1511\u20131519 (2019)","DOI":"10.1609\/aaai.v33i01.33011511"},{"key":"15_CR12","unstructured":"Inoue, K.: Consequence-finding based on ordered linear resolution. In: IJCAI 1991, pp. 158\u2013164. Morgan Kaufmann (1991)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-54507-7_12","volume-title":"Fundamentals of Artificial Intelligence Research","author":"P Marquis","year":"1991","unstructured":"Marquis, P.: Extending abduction from propositional to first-order logic. In: Jorrand, P., Kelemen, J. (eds.) FAIR 1991. LNCS, vol. 535, pp. 141\u2013155. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54507-7_12"},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0004-3702(82)90040-6","volume":"18","author":"TM Mitchell","year":"1982","unstructured":"Mitchell, T.M.: Generalization as search. Artif. Intell. 18(2), 203\u2013226 (1982)","journal-title":"Artif. Intell."},{"issue":"20","key":"15_CR15","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.: Inductive logic programming: theory and methods. J. Log. Program. 19(20), 629\u2013679 (1994)","journal-title":"J. Log. Program."},{"key":"15_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of Inductive Logic Programming","author":"SH Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S.H., de Wolf, R.: Foundations of Inductive Logic Programming. Springer, New York (1997). https:\/\/doi.org\/10.1007\/3-540-62927-0"},{"key":"15_CR17","first-page":"153","volume":"5","author":"GD Plotkin","year":"1970","unstructured":"Plotkin, G.D.: A note on inductive generalization. Mach. Intell. 5, 153\u2013163 (1970)","journal-title":"Mach. Intell."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-56602-3_124","volume-title":"Machine Learning: ECML-93","author":"JR Quinlan","year":"1993","unstructured":"Quinlan, J.R., Cameron-Jones, R.M.: FOIL: a midterm report. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol. 667, pp. 1\u201320. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56602-3_124"},{"issue":"5","key":"15_CR19","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.: Generating contrastive explanations for inductive logic programming based on a near miss approach. Mach. Learn. 111(5), 1799\u20131820 (2022)","journal-title":"Mach. Learn."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cWhy should i trust you?\u201d: explaining the predictions of any classifier. In: Proceedings of 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1135\u20131144 (2016)","DOI":"10.1145\/2939672.2939778"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Shakerin, F., Gupta, G.: Induction of non-monotonic logic programs to explain boosted tree models using LIME. In: Proceedings of AAAI 2019, pp. 3052\u20133059 (2019)","DOI":"10.1609\/aaai.v33i01.33013052"},{"key":"15_CR22","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-45763-5_4","volume-title":"Advances in Knowledge Discovery and Management","author":"A Soulet","year":"2017","unstructured":"Soulet, A., Rioult, F.: Exact and approximate minimal pattern mining. In: Guillet, F., Pinaud, B., Venturini, G. (eds.) Advances in Knowledge Discovery and Management. SCI, vol. 665, pp. 61\u201381. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-45763-5_4"}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45072-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T11:03:24Z","timestamp":1697281404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45072-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031450716","9783031450723"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45072-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RuleML+RR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rules and Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rulemlrr2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.declarativeai.net\/events\/ruleml-rr","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":"46","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":"13","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":"28% - 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":"4","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":"6 subreviewers were invited by the pc members and provided 7 reviews","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)"}}]}}