Role-depth Bounded Least Common Subsumers by Completion for EL- and prob-EL-TBoxes

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 .

• Type: Journal
• Year: 2010
• Where: DLOG
• Authors: Anni-Yasmin Turhan, Rafael Peñaloza
• Keywords: Algorithm, Automated Reasoning, DLOG 2010, Role-depth Bounded El-lcs, W.r.t General El-tboxes