Most Specific Generalizations W.r.t. General EL-TBoxes

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.

Cite

Text

Zarrieß and Turhan. "Most Specific Generalizations W.r.t. General EL-TBoxes." International Joint Conference on Artificial Intelligence, 2013.

Markdown

[Zarrieß and Turhan. "Most Specific Generalizations W.r.t. General EL-TBoxes." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/zarrie2013ijcai-most/)

BibTeX

@inproceedings{zarrie2013ijcai-most,
  title     = {{Most Specific Generalizations W.r.t. General EL-TBoxes}},
  author    = {Zarrieß, Benjamin and Turhan, Anni-Yasmin},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2013},
  pages     = {1191-1197},
  url       = {https://mlanthology.org/ijcai/2013/zarrie2013ijcai-most/}
}