Techreport1731: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Added from ontology) |
||
| Zeile 1: | Zeile 1: | ||
| + | {{Publikation Author | ||
| + | |Rank=3 | ||
| + | |Author=Pascal Hitzler | ||
| + | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=2 | |Rank=2 | ||
| Zeile 6: | Zeile 10: | ||
|Rank=1 | |Rank=1 | ||
|Author=Sebastian Rudolph | |Author=Sebastian Rudolph | ||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Techreport | {{Techreport | ||
| Zeile 22: | Zeile 22: | ||
|Abstract=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. | |Abstract=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. | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
| − | |Download= | + | |Download=2008_1731_Rudolph_What_Is_Approxi_1.pdf, 2008_1731_Rudolph_What_Is_Approxi_2.pdf |
|DOI Name= | |DOI Name= | ||
| − | |||
|Projekt=ReaSem, | |Projekt=ReaSem, | ||
|Forschungsgruppe= | |Forschungsgruppe= | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Theoretische Informatik | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Beschreibungslogik | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Logik | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Semantic Web | ||
}} | }} | ||
Version vom 15. August 2009, 16:18 Uhr
Published: 2008
März
Institution: Institute AIFB, University of Karlsruhe
Archivierungsnummer:1731
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
Beschreibungslogik, Logik, Theoretische Informatik, Semantic Web