Role-depth Bounded Least Common Subsumers for $\mathcal{EL}$+ and $\mathcal{ELI}$

Andreas EckeAndreas Ecke, Anni-Yasmin TurhanAnni-Yasmin Turhan

$Role-depth Bounded Least Common Subsumers for $\mathcal{EL}$+ and $\mathcal{ELI}$$

Download

Andreas Ecke, Anni-Yasmin Turhan
Role-depth Bounded Least Common Subsumers for $\mathcal{EL}$+ and $\mathcal{ELI}$
In Yevgeny {Kazakhov} and Frank {Wolter}, eds., Proc.\ of Description Logics Workshop, volume 846 of CEUR, 2012

Details
Bibtex

KurzfassungAbstract
For $\mathcal{EL}$ the least common subsumer (lcs) need not exist, if
computed w.r.t. general TBoxes. In case the role-depth of the lcs concept description is bounded, an approximate solution can be obtained. In this paper we extend the completion-based method for computing such approximate solutions to $\mathcal{ELI}$ and $\mathcal{EL}$+. For $\mathcal{ELI}$ the extension needs to be able to treat complex node labels. For \ELplus a naive method generates highly redundant concept descriptions for which we devise a heuristic that produces smaller, but equivalent concept descriptions. We
demonstrate the usefulness of this heuristic by an evaluation.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ EcTu-DL-12,
  author = {Andreas {Ecke} and Anni-Yasmin {Turhan}},
  booktitle = {Proc.\ of Description Logics Workshop},
  editor = {Yevgeny {Kazakhov} and Frank {Wolter}},
  series = {CEUR},
  title = {Role-depth Bounded Least Common Subsumers for $\mathcal{EL}$+ and $\mathcal{ELI}$},
  volume = {846},
  year = {2012},
}