Techreport1432: Unterschied zwischen den Versionen
Dhe (Diskussion | Beiträge) K (Textersetzung - „ID Number“ durch „Archivierungsnummer“) |
K (Wikipedia python library) |
||
Zeile 34: | Zeile 34: | ||
|DOI Name= | |DOI Name= | ||
|Projekt=ReaSem, | |Projekt=ReaSem, | ||
− | |Forschungsgruppe= | + | |Forschungsgruppe=Wissensmanagement |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl |
Aktuelle Version vom 16. Oktober 2009, 22:47 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.
Weitere Informationen unter: Link