Conservative Rewritability of Description Logic TBoxes
Abstract
We investigate the problem of conservative rewritability of a TBox T in a description logic L into a TBox T' in a weaker description logic 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 description logics 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. PDF
Cite
Text
Konev et al. "Conservative Rewritability of Description Logic TBoxes." International Joint Conference on Artificial Intelligence, 2016.Markdown
[Konev et al. "Conservative Rewritability of Description Logic TBoxes." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/konev2016ijcai-conservative/)BibTeX
@inproceedings{konev2016ijcai-conservative,
title = {{Conservative Rewritability of Description Logic TBoxes}},
author = {Konev, Boris and Lutz, Carsten and Wolter, Frank and Zakharyaschev, Michael},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2016},
pages = {1153-1159},
url = {https://mlanthology.org/ijcai/2016/konev2016ijcai-conservative/}
}