Techreport1432: 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=1 | |Rank=1 | ||
|Author=Markus Krötzsch | |Author=Markus Krötzsch | ||
− | |||
− | |||
− | |||
− | |||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
Zeile 31: | Zeile 31: | ||
simplifies reasoning. | simplifies reasoning. | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
− | |Download= | + | |Download=2007_1432_Krötzsch_Complexity_of_H_1.pdf |
|DOI Name= | |DOI Name= | ||
− | |||
|Projekt=ReaSem, | |Projekt=ReaSem, | ||
|Forschungsgruppe= | |Forschungsgruppe= | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Komplexitätstheorie | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Logik | ||
}} | }} |
Version vom 15. August 2009, 16:30 Uhr
Published: 2007
Februar
Institution: Instistute AIFB, Universität Karlsruhe
Archivierungsnummer:1432
Kurzfassung
Horn description logics (Horn-DLs) have recently started to attract attention
due to the fact that their (worst-case) data complexities are in general
lower than their overall (i.e. combined) complexities, which makes them
attractive for reasoning with large ABoxes. However, the natural question
whether Horn-DLs also provide advantages for TBox reasoning has hardly been
addressed so far. In this paper, we therefore provide a thorough and
comprehensive analysis of the combined complexities of Horn-DLs. While the
combined complexity for many Horn-DLs turns out to be the same as for their
non-Horn counterparts, we identify subboolean DLs where Hornness
simplifies reasoning.
Download: Media:2007_1432_Krötzsch_Complexity_of_H_1.pdf