Conservative rewritability of description logic TBoxes: First results

Konev, B ORCID: 0000-0002-6507-0494, Lutz, C, Wolter, F 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.

[img] Text
paper-29.pdf - Published version

Download (388kB)


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⊥, and ALCI to DL-Litehorn. 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 or Workshop Item (Paper)
Subjects: ?? QA75 ??
Depositing User: Symplectic Admin
Date Deposited: 21 Aug 2015 15:04
Last Modified: 17 Dec 2022 01:40
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 URLs: