Connection-Minimal Abduction in $\mathcal {EL}$ via Translation to FOL
Open Access
- 1 August 2022
- book chapter
- Published by Springer Nature
- p. 188-207
Abstract
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 $$\mathcal {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.
Keywords
This publication has 26 references indexed in Scilit:
- A Generic Framework for Implicate Generation Modulo Theories2018
- An Introduction to Description Logic2017
- The OWL Reasoner Evaluation (ORE) 2015 Competition ReportJournal of Automated Reasoning, 2017
- The Incredible ELKJournal of Automated Reasoning, 2013
- ABox abduction in ALC using a DL tableau2012
- Towards Practical ABox Abduction in Large Description Logic OntologiesInternational Journal on Semantic Web and Information Systems, 2012
- ABox Abduction in the Description Logic $\boldsymbol{\mathcal{ALC}}$Journal of Automated Reasoning, 2010
- System Description: Spass Version 3.02007
- Resolution Theorem Proving2001
- Efficiency and Completeness of the Set of Support Strategy in Theorem ProvingJournal of the ACM, 1965