Conservative rewritability of description logic TBoxes: First results

Konev, B ORCID: 0000-0002-6507-0494, Lutz, C, Wolter, F ORCID: 0000-0002-4470-606X and Zakharyaschev, M (2015) Conservative rewritability of description logic TBoxes: First results. In: 28th International Workshop on Description Logics, 2015-6-7 - 2015-6-10, Athens.

Text paper-29.pdf - Published version Download (388kB)

Abstract

We want to understand when a given TBox T in a description logic L can be rewritten into a TBox T′ in a weaker description logic L′. Two notions of rewritability are considered: model-conservative rewritability (T′ entails T and all models of T can be expanded to models of T′) and L-conservative rewritability (T′ entails T and every L-consequence of T′ in the signature of T is a consequence of T ) and investigate rewritability of TBoxes in ALCI to ALC, ALCQ to ALC, ALC to EL<inf>⊥</inf>, and ALCI to DL-Lite<inf>horn</inf>. We compare conservative rewritability with equivalent rewritability, give model-theoretic characterizations of conservative rewritability, prove complexity results for deciding rewritability, and provide some rewriting algorithms.

Item Type:	Conference Item (Paper)
Subjects:	?? QA75 ??
Depositing User:	Symplectic Admin
Date Deposited:	21 Aug 2015 15:04
Last Modified:	05 Jun 2025 07:18
Publisher's Statement :	Copyright © 2015 for the individual papers by the papers' authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors.
Related Websites:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/2021399