Completion-based computation of least common subsumers with limited role-depth for EL and Prob-EL⁰¹
Institut für Theoretische Informatik TU Dresden, Rafael Peñaloza, Anni-Yasmin Turhan, Institut für Theoretische Informatik TU Dresden · 2010
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this report 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-EL⁰¹.