LATPub527
From International Center for Computational Logic
{{Publikation Details |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 lcs-computation algorithm to nominals, yielding a procedure for the DL Prob-ELO⁰¹. |ISBN= |ISSN= |Link= |Download=EcPeTu-DL-13.pdf |Slides= |DOI Name= |Projekt= |Forschungsgruppe=Automatentheorie |BibTex=@inproceedings{ EcPeTu-DL-13,
address = {Ulm, Germany},
author = {Andreas {Ecke} and Rafael {Pe{\~n}aloza} and Anni-Yasmin {Turhan} },
booktitle = {Proceedings of the 26th International Workshop on Description Logics ({DL-2013})},
editor = {Thomas {Eiter} and Birte {Glimm} and Yevgeny {Kazakov} and Markus {Kr{\"o}tzsch} },
month = {July},
pages = {670--688},
series = {CEUR-WS},
title = {Role-depth bounded Least Common Subsumer in Prob-{$\mathcal{EL}$} with Nominals},
volume = {1014},
year = {2013},
} }}
