Inseparability and conservative extensions of description logic ontologies: A survey

28Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

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 modeltheoretic 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.

Cite

CITATION STYLE

APA

Botoeva, E., Konev, B., Lutz, C., Ryzhikov, V., Wolter, F., & Zakharyaschev, M. (2017). Inseparability and conservative extensions of description logic ontologies: A survey. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9885 LNCS, pp. 27–89). Springer Verlag. https://doi.org/10.1007/978-3-319-49493-7_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free