{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T05:00:57Z","timestamp":1762750857006,"version":"build-2065373602"},"reference-count":57,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Semantic Web: \u2013 Interoperability, Usability, Applicability"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:p>\n                    \n                    \n                    \n                    Explainable artificial intelligence (XAI) attempts to give explanations for decisions made by AI systems. Despite the fact that for knowledge-based systems this is perceived as inherently easier than for black-box AI systems based on Machine Learning, research is still required for computing satisfactory explanations of reasoning results. In this article, we focus on explaining non-entailments as a result of semantic matching in\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:msub>\n                          <mml:mrow>\n                            <mml:mi mathvariant=\"script\">E<\/mml:mi>\n                            <mml:mi mathvariant=\"script\">L<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:mrow>\n                            <mml:mi mathvariant=\"normal\">\u22a5<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:msub>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    ontologies. In the cases where the result of semantic matching is an entailment, the already established methods of justifications and proofs provide excellent results. On the other hand, the cases in which the result of semantic matching presents in the form of a non-entailment demand an alternative approach. Inspired by abductive reasoning techniques, we present a method for computing subtree isomorphisms between graphical representations of\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:msub>\n                          <mml:mrow>\n                            <mml:mi mathvariant=\"script\">E<\/mml:mi>\n                            <mml:mi mathvariant=\"script\">L<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:mrow>\n                            <mml:mi mathvariant=\"normal\">\u22a5<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:msub>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    concept descriptions, which are then used to construct solutions to abduction problems, that is, explanations, for semantic matching non-entailments in\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:msub>\n                          <mml:mrow>\n                            <mml:mi mathvariant=\"script\">E<\/mml:mi>\n                            <mml:mi mathvariant=\"script\">L<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:mrow>\n                            <mml:mi mathvariant=\"normal\">\u22a5<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:msub>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    ontologies. We improve existing results by generalizing our approach to be able to abduct complex concept expressions of all formats that also consist of role restrictions, rather than concepts alone, as well as the time needed to compute solutions to abduction problems in\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:msub>\n                          <mml:mrow>\n                            <mml:mi mathvariant=\"script\">E<\/mml:mi>\n                            <mml:mi mathvariant=\"script\">L<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:mrow>\n                            <mml:mi mathvariant=\"normal\">\u22a5<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:msub>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    ontologies. We then illustrate our method with an example scenario and perform synthetic experiments to stress the methods\u2019 capabilities and experiments on realistic ontologies to show the practical performance of our method.\n                  <\/jats:p>","DOI":"10.1177\/22104968251386880","type":"journal-article","created":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T18:40:35Z","timestamp":1762454435000},"update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Abduction-Based Method for Explaining Non-Entailments of Semantic Matching"],"prefix":"10.1177","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0894-6901","authenticated-orcid":false,"given":"Ivan","family":"Gocev","sequence":"first","affiliation":[{"name":"School of Informatics, Aristotle University of Thessaloniki, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4242-5245","authenticated-orcid":false,"given":"Georgios","family":"Meditskos","sequence":"additional","affiliation":[{"name":"School of Informatics, Aristotle University of Thessaloniki, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6035-1038","authenticated-orcid":false,"given":"Nick","family":"Bassiliades","sequence":"additional","affiliation":[{"name":"School of Informatics, Aristotle University of Thessaloniki, Greece"}]}],"member":"179","published-online":{"date-parts":[[2025,11,6]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093239"},{"key":"e_1_3_3_3_1","doi-asserted-by":"crossref","unstructured":"Alrabbaa C. Baader F. Borgwardt S. Koopmann P. Kovtunova A. (2020). Finding small proofs for description logic entailments: Theory and practice. In 23rd International conference on logic for programming artificial intelligence and reasoning LPAR23 2020 (pp. 32\u201367). EasyChair.","DOI":"10.29007\/nhpp"},{"key":"e_1_3_3_4_1","doi-asserted-by":"crossref","unstructured":"Alrabbaa C. Baader F. Borgwardt S. Koopmann P. Kovtunova A. (2021). Finding good proofs for description logic entailments using recursive quality measures. In CADE (Vol. 28 pp. 291\u2013308).","DOI":"10.1007\/978-3-030-79876-5_17"},{"key":"e_1_3_3_5_1","unstructured":"Alrabbaa C. Borgwardt S. Koopmann P. Kovtunova A. (2022). Finding good proofs for answers to conjunctive queries mediated by lightweight ontologies. In DL Workshop."},{"key":"e_1_3_3_6_1","doi-asserted-by":"crossref","unstructured":"Alrabbaa C. Borgwardt S. Koopmann P. Kovtunova A. (2022 December). Explaining ontology-mediated query answers using proofs over universal models. In Rules and Reasoning: 6th international joint conference on rules and reasoning RuleML+ RR 2022 Berlin Germany September 26\u201328 2022 Proceedings (pp. 167\u2013182). Cham: Springer International Publishing.","DOI":"10.1007\/978-3-031-21541-4_11"},{"key":"e_1_3_3_7_1","doi-asserted-by":"crossref","unstructured":"Arena D. Kiritsis D. Ziogou C. Voutetakis S. (2017). Semantics-driven knowledge representation for decision support and status awareness at process plant floors. In 2017 International conference on engineering technology and innovation (ICE\/ITMC) (pp. 902\u2013908). IEEE.","DOI":"10.1109\/ICE.2017.8279979"},{"key":"e_1_3_3_8_1","unstructured":"Baader F. Brandt S. Lutz C. (2005). Pushing the el envelope (pp. 364\u2013369)."},{"key":"e_1_3_3_9_1","doi-asserted-by":"crossref","unstructured":"Baader F. K\u00fcsters R. Molitor R. (1999). Computing least common subsumers in description logics with existential restrictions. In IJCAI (Vol. 99 pp. 96\u2013101).","DOI":"10.25368\/2022.85"},{"issue":"1","key":"e_1_3_3_10_1","first-page":"61","article-title":"Effective automatic dynamic semantic web service composition","volume":"3","author":"Bartalos P.","year":"2011","unstructured":"Bartalos P. (2011). Effective automatic dynamic semantic web service composition. Information Sciences and Technologies Bulletin of the ACM Slovakia, 3(1), 61\u201372.","journal-title":"Information Sciences and Technologies Bulletin of the ACM Slovakia"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.09.032"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.3390\/math12040502"},{"key":"e_1_3_3_13_1","unstructured":"Bienvenu M. (2008). Complexity of abduction in the EL family of lightweight description logics. In KR (pp. 220\u2013230)."},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3870"},{"key":"e_1_3_3_15_1","doi-asserted-by":"crossref","unstructured":"Ceylan I. Lukasiewicz T. Malizia E. Molinaro C. Vaicenavicius A. (2020). Explanations for negative query answers under existential rules.","DOI":"10.24963\/kr.2020\/23"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.2753\/JEC1086-4415120205"},{"key":"e_1_3_3_17_1","doi-asserted-by":"crossref","unstructured":"Colucci S. Noia T. D. Sciascio E. D. Mongiello M. Donini F. M. (2004). Concept abduction and contraction for semantic-based discovery of matches and negotiation spaces in an e-marketplace. In Proceedings of the 6th international conference on electronic commerce (pp. 41\u201350).","DOI":"10.1145\/1052220.1052226"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkm791"},{"key":"e_1_3_3_19_1","doi-asserted-by":"crossref","unstructured":"Del-Pinto W. Schmidt R. A. (2019). ABox abduction via forgetting in ALC. In Proceedings of the AAAI conference on artificial intelligence (Vol. 33 No. 01 pp. 2768\u20132775).","DOI":"10.1609\/aaai.v33i01.33012768"},{"key":"e_1_3_3_20_1","doi-asserted-by":"crossref","unstructured":"Di Noia T. Di Sciascio E. Donini F. Mongiello M. (2003). Semantic matchmaking in a P-2-P electronic marketplace. In Proccedings of symposium on applied computing (SAC \u201903) (pp. 582\u2013586). ACM.","DOI":"10.1145\/952532.952649"},{"key":"e_1_3_3_21_1","doi-asserted-by":"crossref","unstructured":"Di Noia T. Di Sciascio E. Donini F. M. (2004). Extending semantic-based matchmaking via concept abduction and contraction. In Engineering knowledge in the age of the semantic web: 14th International conference EKAW 2004 Whittlebury Hall UK October 5\u20138 2004. Proceedings 14 (pp. 307\u2013320). Springer.","DOI":"10.1007\/978-3-540-30202-5_21"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2153"},{"key":"e_1_3_3_23_1","doi-asserted-by":"crossref","unstructured":"Di Noia T. Di Sciascio E. Donini F. M. (2009). Computing information minimal match explanations for logic-based matchmaking. In 2009 IEEE\/WIC\/ACM International joint conference on web intelligence and intelligent agent technology (Vol. 2 pp. 411\u2013418). IEEE.","DOI":"10.1109\/WI-IAT.2009.186"},{"key":"e_1_3_3_24_1","doi-asserted-by":"crossref","unstructured":"Di Noia T. Di Sciascio E. Donini F. M. Mongiello M. (2003). A system for principled matchmaking in an electronic marketplace. In Proceedings of the 12th international conference on World Wide Web (pp. 321\u2013330).","DOI":"10.1145\/775152.775198"},{"key":"e_1_3_3_25_1","unstructured":"Di Noia T. Di Sciascio E. Donini F. M. Mongiello M. (2003). Abductive matchmaking using description logics. In IJCAI (Vol. 3 pp. 337\u2013342)."},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.4018\/jswis.2012040101"},{"key":"e_1_3_3_27_1","doi-asserted-by":"crossref","unstructured":"Du J. Wan H. Ma H. (2017). Practical tbox abduction based on justification patterns. In Proceedings of the AAAI conference on artificial intelligence (Vol. 31).","DOI":"10.1609\/aaai.v31i1.10683"},{"key":"e_1_3_3_28_1","doi-asserted-by":"crossref","unstructured":"Du J. Wang K. Shen Y. D. (2014). A tractable approach to ABox abduction over description logic ontologies. In Proceedings of the AAAI conference on artificial intelligence (Vol. 28 No. 1).","DOI":"10.1609\/aaai.v28i1.8852"},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12911-018-0651-5"},{"key":"e_1_3_3_30_1","unstructured":"Elsenbroich C. Kutz O. Sattler U. (2006). A case for abductive reasoning over ontologies. In OWLED (Vol. 216)."},{"key":"e_1_3_3_31_1","doi-asserted-by":"crossref","unstructured":"Gocev I. Grimm S. Runkler T. (2020). Supporting skill-based flexible manufacturing with symbolic AI methods. In IECON 2020 The 46th annual conference of the IEEE Industrial Electronics Society Singapore (pp. 769\u2013774). https:\/\/doi.org\/10.1109\/IECON43393.2020.9254797.","DOI":"10.1109\/IECON43393.2020.9254797"},{"key":"e_1_3_3_32_1","doi-asserted-by":"crossref","unstructured":"Gocev I. Meditskos G. Bassiliades N. (2022). Towards explaining DL non-entailments by utilizing subtree isomorphisms. In International conference on information integration and Web (pp. 385\u2013390). Cham: Springer Nature Switzerland.","DOI":"10.1007\/978-3-031-21047-1_32"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.06.005"},{"key":"e_1_3_3_34_1","doi-asserted-by":"crossref","unstructured":"Haifani F. Koopmann P. Tourret S. Weidenbach C. (2022). Connection minimal abduction in EL via translation to FOL. In Proc. IJCAR.","DOI":"10.1007\/978-3-031-10769-6_12"},{"key":"e_1_3_3_35_1","unstructured":"Hakeem A. Sheikh Y. Shah M. (2004). CASEE: A hierarchical event representation for the analysis of videos. In AAAI (pp. 263\u2013268)."},{"key":"e_1_3_3_36_1","doi-asserted-by":"crossref","unstructured":"Halland K. Britz K. (2012). ABox abduction in ALC using a DL tableau. In Proceedings of the South African institute for computer scientists and information technologists conference (pp. 51\u201358).","DOI":"10.1145\/2389836.2389843"},{"key":"e_1_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.3233\/SW-2011-0025"},{"key":"e_1_3_3_38_1","doi-asserted-by":"crossref","unstructured":"Horridge M. Parsia B. Sattler U. (2008). Laconic and precise justifications in OWL. In International semantic web conference (pp. 323\u2013338). Berlin Heidelberg: Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-540-88564-1_21"},{"key":"e_1_3_3_39_1","doi-asserted-by":"crossref","unstructured":"Kalyanpur A. Parsia B. Horridge M. Sirin E. (2007). Finding all justifications of OWL DL entailments. In Aberer K. et\u00a0al. (eds) The Semantic Web. ISWC 2007 ASWC 2007. Lecture Notes in Computer Science (Vol. 4825). Berlin Heidelberg: Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-540-76298-0_20"},{"key":"e_1_3_3_40_1","doi-asserted-by":"crossref","unstructured":"Kindermann C. George A. M. Parsia B. Sattler U. (2024). Minimal macro-based rewritings of formal languages: Theory and applications in ontology engineering (and beyond). In Proceedings of the AAAI conference on artificial intelligence (Vol. 38 No. 9 pp. 10581\u201310588).","DOI":"10.1609\/aaai.v38i9.28928"},{"key":"e_1_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9168-z"},{"key":"e_1_3_3_42_1","doi-asserted-by":"crossref","unstructured":"Koopmann P. (2021). Signature-based abduction with fresh individuals and complex concepts for description logics. In Description Logics.","DOI":"10.24963\/ijcai.2021\/266"},{"key":"e_1_3_3_43_1","doi-asserted-by":"crossref","unstructured":"Li L. Horrocks I. (2003). A software framework for matchmaking based on semantic web technology. In Proceedings of the 12th international conference on World Wide Web (pp. 331\u2013339).","DOI":"10.1145\/775152.775199"},{"key":"e_1_3_3_44_1","doi-asserted-by":"crossref","unstructured":"Liu J. Wang Y. Morris J. Kristiansen H. (2005). Development of ontology for the anisotropic conductive adhesive interconnect technology in electronics applications. In Proceedings International symposium on advanced packaging materials: Processes properties and interfaces (pp. 193\u2013208). IEEE.","DOI":"10.1109\/ISAPM.2005.1432076"},{"key":"e_1_3_3_45_1","unstructured":"Matentzoglu N. Parsia B. (2017). Bioportal snapshot 30.03.2017 (Mar 2017). https:\/\/doi.org\/10.5281\/zenodo.439510."},{"key":"e_1_3_3_46_1","unstructured":"McGuinness D. L. Shvaiko P. Giunchiglia F. da Silva P. P. (2004). Towards explaining semantic matching."},{"key":"e_1_3_3_47_1","first-page":"31","article-title":"A hypergraph approach for logic-based abduction","volume":"2023","author":"Ouyang Q.","year":"2023","unstructured":"Ouyang Q., Dai T., Ma Y. (2023). A hypergraph approach for logic-based abduction. DBKDA, 2023, 31.","journal-title":"DBKDA"},{"key":"e_1_3_3_48_1","doi-asserted-by":"crossref","unstructured":"Paolucci M. Kawamura T. Payne T. R. Sycara K. (2002). Semantic matching of web services capabilities. In The Semantic Web\u2014ISWC 2002: First international semantic web conference sardinia Italy June 9\u201312 2002 Proceedings 1 (pp. 333\u2013347). Springer: Berlin Heidelberg.","DOI":"10.1007\/3-540-48005-6_26"},{"key":"e_1_3_3_49_1","unstructured":"Pukancov\u00e1 J. Homola M. (2017). Tableau-based abox abduction for the ALCHO description logic. In Description Logics."},{"key":"e_1_3_3_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-020-00685-4"},{"key":"e_1_3_3_51_1","doi-asserted-by":"crossref","unstructured":"Rouached M. Godart C. (2008). A Run-time service discovery tool for Web services compositions. In 2008 IEEE International conference on e-business engineering (pp. 179\u2013187). IEEE.","DOI":"10.1109\/ICEBE.2008.49"},{"key":"e_1_3_3_52_1","doi-asserted-by":"crossref","unstructured":"Santos G. Silva F. Teixeira B. Vale Z. Pinto T. (2018). Power systems simulation using ontologies to enable the interoperability of multi-agent systems. In 2018 Power systems computation conference (PSCC) (pp. 1\u20137). IEEE.","DOI":"10.23919\/PSCC.2018.8442888"},{"key":"e_1_3_3_53_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1044"},{"key":"e_1_3_3_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2007.03.004"},{"key":"e_1_3_3_55_1","doi-asserted-by":"crossref","unstructured":"Sorli M. Mendikoa I. P\u00e9rez J. Soares A. Urosevic L. Stokic D. Moreira J. Corvacho H. (2006). Knowledge-based collaboration in construction industry. In 2006 IEEE international technology management conference (ICE) (pp. 1\u20138). IEEE.","DOI":"10.1109\/ICE.2006.7477062"},{"key":"e_1_3_3_56_1","first-page":"23","article-title":"Foundations of explainable knowledge-enabled systems","volume":"47","author":"Tiddi I.","year":"2020","unstructured":"Tiddi I. (2020). Foundations of explainable knowledge-enabled systems. Knowledge Graphs for eXplainable Artificial Intelligence: Foundations, Applications and Challenges, 47, 23.","journal-title":"Knowledge Graphs for eXplainable Artificial Intelligence: Foundations, Applications and Challenges"},{"key":"e_1_3_3_57_1","doi-asserted-by":"crossref","unstructured":"Wei-Kleiner F. Dragisic Z. Lambrix P. (2014). Abduction framework for repairing incomplete EL ontologies: Complexity results and algorithms. In Proceedings of the AAAI conference on artificial intelligence (Vol. 28 No. 1).","DOI":"10.1609\/aaai.v28i1.8858"},{"key":"e_1_3_3_58_1","doi-asserted-by":"crossref","unstructured":"Wiesner A. Saxena A. Marquardt W. (2010). An ontology-based environment for effective collaborative and concurrent process engineering. In 2010 IEEE international conference on industrial engineering and engineering management (pp. 2518\u20132522). IEEE.","DOI":"10.1109\/IEEM.2010.5674186"}],"container-title":["Semantic Web: \u2013 Interoperability, Usability, Applicability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/22104968251386880","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/22104968251386880","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/22104968251386880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T04:58:16Z","timestamp":1762750696000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/22104968251386880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":57,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["10.1177\/22104968251386880"],"URL":"https:\/\/doi.org\/10.1177\/22104968251386880","relation":{},"ISSN":["1570-0844","2210-4968"],"issn-type":[{"type":"print","value":"1570-0844"},{"type":"electronic","value":"2210-4968"}],"subject":[],"published":{"date-parts":[[2025,11]]},"article-number":"22104968251386880"}}