Optimizations for the Role-Depth Bounded Least Common Subsumer in EL+.
Andreas Ecke, Anni-Yasmin Turhan · OWL: Experiences and Directions · 2012
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 EL+, 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 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.