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

Benjamin Zarries̈Benjamin Zarries̈, Anni-Yasmin TurhanAnni-Yasmin Turhan

Download

Benjamin Zarries̈, Anni-Yasmin Turhan
Most Specific Generalizations w.r.t. General EL-TBoxes
Technical Report, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, volume 13-06, 2013. LTCS-Report

Details
Bibtex

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.
Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@techreport{ ZaTu-LTCS-13-06,
  address = {Dresden, Germany},
  author = {Benjamin {Zarrie{\"s}} and Anni-Yasmin {Turhan}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {13-06},
  title = {Most Specific Generalizations w.r.t.\ General $\mathcal{EL}$-TBoxes},
  type = {LTCS-Report},
  year = {2013},
}