Techreport1729: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Wikipedia python library) |
||
(4 dazwischenliegende Versionen von 2 Benutzern werden nicht angezeigt) | |||
Zeile 1: | Zeile 1: | ||
− | {{Publikation | + | {{Publikation Erster Autor |
− | | | + | |ErsterAutorNachname=Tserendorj |
− | | | + | |ErsterAutorVorname=Tuvshintur |
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
Zeile 21: | Zeile 21: | ||
|Month=März | |Month=März | ||
|Institution=Institute AIFB, University of Karlsruhe | |Institution=Institute AIFB, University of Karlsruhe | ||
− | | | + | |Archivierungsnummer=1729 |
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=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. | |Abstract=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. | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
− | |Download= | + | |Download=2008_1729_Tserendorj_Approximate_OWL_1.pdf, 2008_1729_Tserendorj_Approximate_OWL_2.pdf |
|DOI Name= | |DOI Name= | ||
− | |||
|Projekt=ReaSem, | |Projekt=ReaSem, | ||
− | |Forschungsgruppe= | + | |Forschungsgruppe=Wissensmanagement |
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Logikprogrammierung | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Beschreibungslogik | ||
}} | }} |
Aktuelle Version vom 16. Oktober 2009, 22:46 Uhr
Published: 2008
März
Institution: Institute AIFB, University of Karlsruhe
Archivierungsnummer: 1729
Kurzfassung
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