LATPub439: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| (2 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt) | |||
| Zeile 6: | Zeile 6: | ||
{{Inproceedings | {{Inproceedings | ||
|Referiert=1 | |Referiert=1 | ||
|Title=Role-depth Bounded Least Common Subsumers by Completion for | |Title=Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes | ||
|Year=2010 | |Year=2010 | ||
|Month= | |Month= | ||
|Booktitle=Proc. | |Booktitle=Proc. of the 2010 Description Logic Workshop (DL'10) | ||
|Editor=V. | |Editor=V. Haarslev and D. Toman and G. Weddell | ||
|Note= | |Note= | ||
|Organization= | |Organization= | ||
| Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=The least common subsumer (lcs) w.r.t general EL-TBoxes does not need | |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-EL^01. | ||
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 | |||
a recently introduced probabilistic variant of EL: Prob-EL^01. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 43: | Zeile 38: | ||
year = {2010}, | year = {2010}, | ||
} | } | ||
}} | }} | ||
Aktuelle Version vom 25. März 2015, 15:34 Uhr
{{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 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-EL^01. |ISBN= |ISSN= |Link= |Download=PenTur-dl10.pdf |Slides= |DOI Name= |Projekt= |Forschungsgruppe=Automatentheorie |BibTex=@inproceedings{ PenTur-dl10,
author = {Rafael {Pe{\~n}aloza} and Anni-Yasmin {Turhan} },
booktitle = {Proc.\ of the 2010 Description Logic Workshop (DL'10)},
editor = {V. {Haarslev} and D. {Toman} and G. {Weddell} },
series = {CEUR-WS},
title = {Role-depth Bounded Least Common Subsumers by Completion for {$\mathcal{EL}$}- and {Prob-${\mathcal{EL} }$}-{TBoxes} },
volume = {573},
year = {2010},
} }}
