(2015)
Conservative Rewritability of Description Logic TBoxes: First Results.
In: 28th International Workshop on Description Logics, June 7 to 10, 2015, 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' such that T' is a conservative extension of T. We consider two notions of conservative rewritability: model-conservative rewritability (T' entails T and all models of T can be expanded to models of T') and L-conservative rewritability (T' has the same L-consequences in the signature of T as T) and investigate conservative rewritability from ALCI to ALC, ALCQ to ALC, ALC to EL, and from ALC to DL-Lite_horn. We compare conservative rewritability and equivalent rewritability, give model-theoretic characterizations of conservative rewritability, prove complexity results for the rewritability problem, and provide some rewriting algorithms.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Depositing User: | Symplectic Admin |
Date Deposited: | 31 Mar 2016 10:03 |
Last Modified: | 31 Mar 2016 10:03 |
: | 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. |
URI: | http://livrepository.liverpool.ac.uk/id/eprint/2022438 |