Completion-based algorithms can be employed for computing the least common subsumer of two concepts up to a given role-depth, in extensions of the lightweight DL EL. This approach has been applied also to the probabilistic DL Prob-EL, which is variant of EL with subjective probabilities. In this paper we extend the completion-based lcscomputation algorithm to nominals, yielding a procedure for the DL Prob-ELO c01.
Ecke, A., Peñaloza, R., Turhan, A. (2013). Role-depth bounded Least Common Subsumer in Prob-EL with Nominals. In DL 2013: Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23 - 26, 2013 (pp.670-688). CEUR.
Role-depth bounded Least Common Subsumer in Prob-EL with Nominals
Peñaloza, R;
2013
Abstract
Completion-based algorithms can be employed for computing the least common subsumer of two concepts up to a given role-depth, in extensions of the lightweight DL EL. This approach has been applied also to the probabilistic DL Prob-EL, which is variant of EL with subjective probabilities. In this paper we extend the completion-based lcscomputation algorithm to nominals, yielding a procedure for the DL Prob-ELO c01.
| File | Dimensione | Formato | |
|---|---|---|---|
|
EcPeTu-DL-13.pdf
accesso aperto
Tipologia di allegato:
Author’s Accepted Manuscript, AAM (Post-print)
Dimensione
571.18 kB
Formato
Adobe PDF
|
571.18 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
