LATPub417: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| (Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt) | |||
| Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=We study the problem of reasoning over weighted ontologies. We assume that | |Abstract=We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute its so-called boundary, with respect to a given property. We show that axiom pinpointing is the most general instance of this problem. Finally, we present three applications of the problem of boundary computation. | ||
every axiom is labeled with an element of a distributive lattice (called its | |||
weight) and try to compute its so-called boundary, with respect to a given | |||
property. We show that axiom pinpointing is the most general instance of | |||
this problem. Finally, we present three applications of the problem of | |||
boundary computation. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 44: | Zeile 38: | ||
year = {2009}, | year = {2009}, | ||
} | } | ||
}} | }} | ||
Aktuelle Version vom 25. März 2015, 16:34 Uhr
Reasoning With Weighted Ontologies
Rafael PeñalozaRafael Peñaloza
Rafael Peñaloza
Reasoning With Weighted Ontologies
In Bernardo Cuenca Grau and Ian Horrocks and Boris Motik and Ulrike Sattler, eds., Proceedings of the 2009 International Workshop on Description Logics (DL2009), volume 477 of CEUR-WS, 2009
Reasoning With Weighted Ontologies
In Bernardo Cuenca Grau and Ian Horrocks and Boris Motik and Ulrike Sattler, eds., Proceedings of the 2009 International Workshop on Description Logics (DL2009), volume 477 of CEUR-WS, 2009
- KurzfassungAbstract
We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute its so-called boundary, with respect to a given property. We show that axiom pinpointing is the most general instance of this problem. Finally, we present three applications of the problem of boundary computation. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Pena-DL09,
author = {Rafael {Pe{\~n}aloza}},
booktitle = {Proceedings of the 2009 International Workshop on Description Logics ({DL2009})},
editor = {Bernardo Cuenca {Grau} and Ian {Horrocks} and Boris {Motik} and Ulrike {Sattler}},
series = {CEUR-WS},
title = {Reasoning With Weighted Ontologies},
volume = {477},
year = {2009},
}
