LATPub703
From International Center for Computational Logic
{{Publikation Details |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 report 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-EL-01. |ISBN= |ISSN= |Link= |Download=PenTur-10-02.pdf |Slides= |DOI Name= |Projekt= |Forschungsgruppe=Automatentheorie |BibTex=@techreport{ PenTur-ltcs-10-02,
address = {Germany},
author = {Rafael {Pe{\~n}aloza} and Anni-Yasmin {Turhan} },
institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
number = {LTCS-10-02},
title = {Completion-based computation of least common subsumers with limited role-depth for {${\mathcal{EL} }$} and Prob-{${\mathcal{EL}^{01} }$} },
type = {LTCS-Report},
year = {2010},
} }}
