PP-2010-06: ABox Abduction in the Description Logic ALC

PP-2010-06: Klarman, Szymon and Endriss, U. and Schlobach, Stefan (2010) ABox Abduction in the Description Logic ALC. [Report]

[thumbnail of Full Text]
Text (Full Text)

Download (562kB) | Preview
[thumbnail of Abstract] Text (Abstract)

Download (1kB)


Due to the growing popularity of Description Logics-based knowledge
representation systems, predominantly in the context of Semantic Web
applications, there is a rising demand for tools offering non-standard
reasoning services. One particularly interesting form of reasoning,
both from the user as well as the ontology engineering perspective, is
abduction. In this paper we introduce two novel reasoning calculi for
solving ABox abduction problems in the Description Logic ALC,
i.e. problems of finding minimal sets of ABox axioms, which when added
to the knowledge base enforce entailment of a requested set of
assertions. The algorithms are based on regular connection tableaux
and resolution with set-of-support and are proven to be sound and
complete. We elaborate on a number of technical issues involved and
discuss some practical aspects of reasoning with the methods.

Item Type: Report
Report Nr: PP-2010-06
Series Name: Prepublication (PP) Series
Year: 2010
Uncontrolled Keywords: description logic; abduction; non-standard reasoning services; semantic tableaux; resolution
Subjects: Logic
Depositing User: Ulle Endriss
Date Deposited: 12 Oct 2016 14:37
Last Modified: 12 Oct 2016 14:37
URI: https://eprints.illc.uva.nl/id/eprint/385

Actions (login required)

View Item View Item