TY - GEN
T1 - Connection-Minimal Abduction in EL via Translation to FOL
AU - Haifani, Fajar
AU - Koopmann, Patrick
AU - Tourret, Sophie
AU - Weidenbach, Christoph
PY - 2022
Y1 - 2022
N2 - Abduction in description logics finds extensions of a knowledge base to make it entail an observation. As such, it can be used to explain why the observation does not follow, to repair incomplete knowledge bases, and to provide possible explanations for unexpected observations. We consider TBox abduction in the lightweight description logic EL, where the observation is a concept inclusion and the background knowledge is a TBox, i.e., a set of concept inclusions. To avoid useless answers, such problems usually come with further restrictions on the solution space and/or minimality criteria that help sort the chaff from the grain. We argue that existing minimality notions are insufficient, and introduce connection minimality. This criterion follows Occam’s razor by rejecting hypotheses that use concept inclusions unrelated to the problem at hand. We show how to compute a special class of connection-minimal hypotheses in a sound and complete way. Our technique is based on a translation to first-order logic, and constructs hypotheses based on prime implicates. We evaluate a prototype implementation of our approach on ontologies from the medical domain.
AB - Abduction in description logics finds extensions of a knowledge base to make it entail an observation. As such, it can be used to explain why the observation does not follow, to repair incomplete knowledge bases, and to provide possible explanations for unexpected observations. We consider TBox abduction in the lightweight description logic EL, where the observation is a concept inclusion and the background knowledge is a TBox, i.e., a set of concept inclusions. To avoid useless answers, such problems usually come with further restrictions on the solution space and/or minimality criteria that help sort the chaff from the grain. We argue that existing minimality notions are insufficient, and introduce connection minimality. This criterion follows Occam’s razor by rejecting hypotheses that use concept inclusions unrelated to the problem at hand. We show how to compute a special class of connection-minimal hypotheses in a sound and complete way. Our technique is based on a translation to first-order logic, and constructs hypotheses based on prime implicates. We evaluate a prototype implementation of our approach on ontologies from the medical domain.
UR - https://www.scopus.com/pages/publications/85135854112
UR - https://www.scopus.com/inward/citedby.url?scp=85135854112&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-10769-6_12
DO - 10.1007/978-3-031-10769-6_12
M3 - Conference contribution
SN - 9783031107689
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 188
EP - 207
BT - Automated Reasoning
A2 - Blanchette, Jasmin
A2 - Kovács, Laura
A2 - Pattinson, Dirk
PB - Springer Science and Business Media Deutschland GmbH
T2 - 11th International Joint Conference on Automated Reasoning, IJCAR 2022, part of the Federated Logic Conference, FLoC 2022
Y2 - 8 August 2022 through 10 August 2022
ER -