Deciding inseparability and conservative extensions in the description logic EL

  • Authors:

  • Carsten Lutz;Frank Wolter

  • Affiliations:

  • Fachbereich Mathematik und Informatik, Universität Bremen, Germany;Department of Computer Science, University of Liverpool, UK

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature @S, i.e., whether they have the same consequences in the signature @S. A special case is to decide whether the extension of an ontology is conservative. By varying the language in which ontologies are formulated and the query language that is used to describe consequences, we obtain different versions of the problem. We focus on the lightweight description logic EL as an ontology language, and consider query languages based on (i) subsumption queries, (ii) instance queries over ABoxes, (iii) conjunctive queries over ABoxes, and (iv) second-order logic. For query languages (i) to (iii), we establish ExpTime-completeness of both inseparability and conservative extensions. Case (iv) is equivalent to a model-theoretic version of inseparability and conservative extensions, and we prove it to be undecidable. We also establish a number of robustness properties for inseparability.