Logo image
Back
Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes
Conference proceeding   Peer reviewed

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

R Peñaloza and Anni-Yasmin Turhan
Proceedings of the 23rd International Workshop on Description Logics, DL 2010, May 4-7, 2010, Waterloo, Canada, Vol.573, pp.255-266
CEUR Workshop Proceedings, 573
23rd International Workshop on Description Logics (DL 2010) (Waterloo, Ontario, 04/05/2010 - 07/05/2010)
2010
Handle:
https://hdl.handle.net/10863/34283

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.
url
http://ceur-ws.org/Vol-573/paper_37.pdfView

Details

Metrics

1 Record Views