Stage-oe-small.jpg

Techreport1731: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
K (Added from ontology)
K (Added from ontology)
Zeile 1: Zeile 1:
{{Publikation Author
+
{{Publikation Erster Autor
|Rank=3
+
|ErsterAutorNachname=Rudolph
|Author=Pascal Hitzler
+
|ErsterAutorVorname=Sebastian
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
Zeile 8: Zeile 8:
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
|Rank=1
+
|Rank=3
|Author=Sebastian Rudolph
+
|Author=Pascal Hitzler
 
}}
 
}}
 
{{Techreport
 
{{Techreport
Zeile 26: Zeile 26:
 
|Projekt=ReaSem,  
 
|Projekt=ReaSem,  
 
|Forschungsgruppe=
 
|Forschungsgruppe=
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Logik
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl
Zeile 32: Zeile 35:
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl
 
|Forschungsgebiet=Beschreibungslogik
 
|Forschungsgebiet=Beschreibungslogik
}}
 
{{Forschungsgebiet Auswahl
 
|Forschungsgebiet=Logik
 
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl
 
|Forschungsgebiet=Semantic Web
 
|Forschungsgebiet=Semantic Web
 
}}
 
}}

Version vom 8. September 2009, 10:00 Uhr


What Is Approximate Reasoning?




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

BibTeX



Kurzfassung
Approximate reasoning for the Semantic Web is based on the idea of sacrificing soundness or completeness for a significant speed-up of reasoning. This is to be done in such a way that the number of introduced mistakes is at least outweighed by the obtained speed-up. When pursuing such approximate reasoning approaches, however, it is important to be critical not only about appropriate application domains, but also about the quality of the resulting approximate reasoning procedures. With different approximate reasoning algorithms discussed and developed in the literature, it needs to be clarified how these approaches can be compared, i.e. what it means that one approximate reasoning approach is better than some other. In this paper, we will formally define such a foundation for approximate reasoning research. We will clarify -- by means of notions from statistics -- how different approximate algorithms can be compared, and ground the most fundamental notions in the field formally. We will also exemplify what a corresponding statistical comparison of algorithms would look like.

Download: Media:2008_1731_Rudolph_What_Is_Approxi_1.pdf,Media:2008_1731_Rudolph_What_Is_Approxi_2.pdf

Projekt

ReaSem



Forschungsgebiet

Beschreibungslogik, Logik, Theoretische Informatik, Semantic Web