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

From International Center for Computational Logic

Toggle side column

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

Benjamin ZarrießBenjamin Zarrieß,  Anni-Yasmin TurhanAnni-Yasmin Turhan
Benjamin Zarrieß, Anni-Yasmin Turhan
Most Specific Generalizations w.r.t. General EL-TBoxes
Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI'13), 2013. AAAI Press
  • KurzfassungAbstract
    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 suffcient 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. The latter allows to compute the lcs and the msc, respectively.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ ZaTu-IJCAI13,
  address = {Beijing, China},
  author = {Benjamin {Zarrie{\ss}} and Anni-Yasmin {Turhan}},
  booktitle = {Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI'13)},
  publisher = {AAAI Press},
  title = {Most Specific Generalizations w.r.t.\ General $\mathcal{EL}$-TBoxes},
  year = {2013},
}