# Optimizations for the role-depth bounded least common subsumer in el+

##### Andreas EckeAndreas Ecke,  Anni-Yasmin TurhanAnni-Yasmin Turhan
Andreas Ecke, Anni-Yasmin Turhan
Optimizations for the role-depth bounded least common subsumer in el+
In Matthew Horridge and Pavel Klinov, eds., Proc. of 9th OWL: Experiences and Directions Workshop (OWLED 2012), volume 849, 2012
• KurzfassungAbstract
Computing the least common subsumer (lcs) yields a generalization of a collection of concepts, computing such generalizations is a useful reasoning task for many ontology-based applications. Since the lcs need not exist, if computed w.r.t. general TBoxes, an approximative approach, the role-depth bounded lcs, has been proposed. Recently, this approach has been extended to the Description logic ELplus, which covers most of the OWL 2 EL profile. In this paper we present two kinds of optimizations for the computation of such approximative lcs: one to obtain succinct rewritings of $mathcal{el}+$-concepts and the other to speed-up the k-lcs computation. The evaluation of these optimizations give evidence that they can improve the computation of the role-depth bounded lcs by orders of magnitude.
• Forschungsgruppe:Research Group: Automatentheorie
@inproceedings{ EcTu-OWLED-12,
author = {Andreas {Ecke} and Anni-Yasmin {Turhan}},
booktitle = {Proc. of 9th OWL: Experiences and Directions Workshop (OWLED 2012)},
editor = {Matthew {Horridge} and Pavel {Klinov}},
title = {Optimizations for the role-depth bounded least common subsumer in $\mathcal{el}+$},
volume = {849},
year = {2012},
}