Most Specific Generalizations w.r.t. General EL-TBoxes
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 1191-1196.
Abstract
In the area of Description Logics the least common subsumer (lcs) and the most specific concept (msc) are inferences that generalize a set of concepts or an individual, respectively, into a single concept. If computed w.r.t. a general EL-TBox neither the lcs nor the msc need to exist. So far in this setting no exact conditions for the existence of lcs- or msc-concepts are known. This paper provides necessary and sufficient conditions for the existence of these two kinds of concepts. For the lcs of a fixed number of concepts and the msc we show decidability of the existence in PTime and polynomial bounds on the maximal role-depth of the lcs- and msc-concepts. This bound allows to compute the lcs and the msc, respectively.
@inproceedings{ijcai2013p179,
title = {Most Specific Generalizations w.r.t. General EL-TBoxes},
author = {Zarrieß, Benjamin and Turhan, Anni-Yasmin},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {1191--1196},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/179},
}
TY - CPAPER TI - Most Specific Generalizations w.r.t. General EL-TBoxes AU - Zarrieß, Benjamin AU - Turhan, Anni-Yasmin T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 1191 EP - 1196 UR - https://ijcai.org/proceedings/2013/179 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
