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.

Peñaloza, R., Turhan, A. (2010). Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes. In Proceedings of the 23rd International Workshop on Description Logics, DL 2010, May 4-7, 2010, Waterloo, Canada (pp.255-266). CEUR.

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

Peñaloza, R
;
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.
Si
paper
non-standard reasoning, description logics
English
International Workshop on Description Logics (DL 2010)
Peñaloza, R., Turhan, A. (2010). Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes. In Proceedings of the 23rd International Workshop on Description Logics, DL 2010, May 4-7, 2010, Waterloo, Canada (pp.255-266). CEUR.
Peñaloza, R; Turhan, A
File in questo prodotto:
File Dimensione Formato  
PenTur-dl10.pdf

accesso aperto

Tipologia di allegato: Submitted Version (Pre-print)
Dimensione 219.33 kB
Formato Adobe PDF
219.33 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/256773
Citazioni
  • Scopus 2
  • ???jsp.display-item.citation.isi??? ND
Social impact