Conservative Rewritability of Description Logic TBoxes

Konev, B ORCID: 0000-0002-6507-0494, Lutz, C, Wolter, F and Zakharyaschev, M (2016) Conservative Rewritability of Description Logic TBoxes. In: Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, 2016-7-9 - 2016-7-15, New York.

Text IJCAI16-final.pdf - Author Accepted Manuscript Download (332kB)

Abstract

We investigate the problem of conservative rewritability of a TBox T in a description logic (DL) L into a TBox T' in a weaker DL L'. We focus on model-conservative rewritability (T' entails T and all models of T are expandable to models of T'), subsumption-conservative rewritability (T' entails T and all subsumptions in the signature of T entailed by T' are entailed by T), and standard DLs between ALC and ALCQI. We give model-theoretic characterizations of conservative rewritability via bisimulations, inverse p-morphisms and generated subinterpretations, and use them to obtain a few rewriting algorithms and complexity results for deciding rewritability.

Item Type:	Conference or Workshop Item (Unspecified)
Depositing User:	Symplectic Admin
Date Deposited:	06 Sep 2016 09:17
Last Modified:	19 Jan 2023 07:30
Related URLs:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3003128