Semantisches Browsen

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.

Andreas Ecke, Anni-Yasmin Turhan<br/> '''[[LATPub485|<b>Optimizations for the role-depth bounded least common subsumer in el+</b>]]''' <br/>__NOTOC__In Matthew Horridge and Pavel Klinov, eds., <i>Proc. of 9th OWL: Experiences and Directions Workshop (OWLED 2012)</i>, volume 849, 2012<br/><span class="glyphicon glyphicon-chevron-right" style="font-size: 85%;" ></span> [[LATPub485|Details]] <span class="glyphicon glyphicon-chevron-right" style="font-size: 85%; margin-left: 2ex; "></span> [[Media:EcTu-OWled-12.pdf|Download]]

Andreas Ecke, Anni-Yasmin Turhan<br/> '''[[LATPub485/en|<b>Optimizations for the role-depth bounded least common subsumer in el+</b>]]''' <br/>__NOTOC__In Matthew Horridge and Pavel Klinov, eds., <i>Proc. of 9th OWL: Experiences and Directions Workshop (OWLED 2012)</i>, volume 849, 2012<br/><span class="glyphicon glyphicon-chevron-right" style="font-size: 85%;" ></span> [[LATPub485|Details]] <span class="glyphicon glyphicon-chevron-right" style="font-size: 85%; margin-left: 2ex;" ></span> [[Media:EcTu-OWled-12.pdf|Download]]