ABox Abduction in the Description Logic $\boldsymbol{\mathcal{ALC}}$

  • Authors:

  • Szymon Klarman;Ulle Endriss;Stefan Schlobach

  • Affiliations:

  • Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands 1081 HV;Institute for Logic, Language and Computation, University of Amsterdam, Amsterdam, The Netherlands 1098 XH;Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands 1081 HV

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 $\mathcal{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.