Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes
Anni-Yasmin Turhan, Rafael Peñaloza · 2010
Abstract. The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL01. 1