Techreport1729: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
K (Textersetzung - „ID Number“ durch „Archivierungsnummer“)
K (Wikipedia python library)
Zeile 29: Zeile 29:
|DOI Name=
|DOI Name=
{{Forschungsgebiet Auswahl
{{Forschungsgebiet Auswahl

Aktuelle Version vom 16. Oktober 2009, 22:46 Uhr

Approximate OWL-Reasoning with SCREECH

Published: 2008 März
Institution: Institute AIFB, University of Karlsruhe
Archivierungsnummer: 1729


Applications of expressive ontology reasoning for the Semantic Web require scalable algorithms for deducing implicit knowledge from explicitly given knowledge bases. Besides the development of more efficient such algorithms, awareness is rising that approximate reasoning solutions will be helpful and needed for certain application domains. In this paper, we present a comprehensive overview of the Screech approach to approximate reasoning with OWL ontologies, which is based on the KAON2 algorithms, facilitating a compilation of OWL DL TBoxes into Datalog, which is tractable in terms of data complexity.We present three different instantiations of the Screech approach, and report on experiments which show that a significant gain in efficiency can be achieved.

Download: Media:2008_1729_Tserendorj_Approximate_OWL_1.pdf,Media:2008_1729_Tserendorj_Approximate_OWL_2.pdf






Beschreibungslogik, Logikprogrammierung