Journal of Automated Reasoning

, Volume 46, Issue 1, pp 43–80

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

Article

DOI: 10.1007/s10817-010-9168-z

Cite this article as:
Klarman, S., Endriss, U. & Schlobach, S. J Autom Reasoning (2011) 46: 43. doi:10.1007/s10817-010-9168-z

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.

Keywords

Description logicAbductionNon-standard reasoning servicesSemantic tableauxResolution

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  • Szymon Klarman
    • 1
  • Ulle Endriss
    • 2
  • Stefan Schlobach
    • 1
  1. 1.Department of Computer ScienceVrije Universiteit AmsterdamAmsterdamThe Netherlands
  2. 2.Institute for Logic, Language and ComputationUniversity of AmsterdamAmsterdamThe Netherlands