Conservative Rewritability of Description Logic TBoxes
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 1153-1158.
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.
@inproceedings{ijcai2016p167,
title = {Conservative Rewritability of Description Logic TBoxes},
author = {Konev, Boris and Lutz, Carsten and Wolter, Frank and Zakharyaschev, Michael},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {1153--1158},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/167},
}
TY - CPAPER TI - Conservative Rewritability of Description Logic TBoxes AU - Konev, Boris AU - Lutz, Carsten AU - Wolter, Frank AU - Zakharyaschev, Michael T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 1153 EP - 1158 UR - https://ijcai.org/proceedings/2016/167 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: