Skip to main content

Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey

Botoeva, Elena and Konev, Boris and Lutz, Carsten and Ryzhikov, Vladislav and Wolter, Frank and Zakharyaschev, Michael (2017) Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey. In: Pan, Jeff Z. and Calvanese, Diego and Eiter, Thomas and Horrocks, Ian and Kifer, Michael and Lin, Fangzhen and Zhao, Yuting, eds. Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering. Lecture Notes in Computer Science, 9885 . Springer, Cham, Switzerland, pp. 27-89. ISBN 978-3-319-49492-0. E-ISBN 978-3-319-49493-7. (doi:10.1007/978-3-319-49493-7_2) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:90807)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Official URL
https://doi.org/10.1007/978-3-319-49493-7_2

Abstract

The question whether an ontology can safely be replaced by another, possibly simpler, one is fundamental for many ontology engineering and maintenance tasks. It underpins, for example, ontology versioning, ontology modularization, forgetting, and knowledge exchange. What ‘safe replacement’ means depends on the intended application of the ontology. If, for example, it is used to query data, then the answers to any relevant ontology-mediated query should be the same over any relevant data set; if, in contrast, the ontology is used for conceptual reasoning, then the entailed subsumptions between concept expressions should coincide. This gives rise to different notions of ontology inseparability such as query inseparability and concept inseparability, which generalize corresponding notions of conservative extensions. In this chapter, we survey results on various notions of inseparability in the context of description logic ontologies, discussing their applications, useful model-theoretic characterizations, algorithms for determining whether two ontologies are inseparable (and, sometimes, for computing the difference between them if they are not), and the computational complexity of this problem.

Item Type: Book section
DOI/Identification number: 10.1007/978-3-319-49493-7_2
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Amy Boaler
Date Deposited: 12 Oct 2021 08:16 UTC
Last Modified: 13 Oct 2021 09:49 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/90807 (The current URI for this page, for reference purposes)
  • Depositors only (login required):