Stage-oe-small.jpg

Techreport1432: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
K (Added from ontology)
K (Wikipedia python library)
 
(Eine dazwischenliegende Version von einem anderen Benutzer wird nicht angezeigt)
Zeile 17: Zeile 17:
 
|Month=Februar
 
|Month=Februar
 
|Institution=Instistute AIFB, Universität Karlsruhe
 
|Institution=Instistute AIFB, Universität Karlsruhe
|ID Number=1432
+
|Archivierungsnummer=1432
 
}}
 
}}
 
{{Publikation Details
 
{{Publikation Details
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


Complexity of Horn Description Logics




Published: 2007 Februar
Institution: Instistute AIFB, Universität Karlsruhe
Archivierungsnummer: 1432

BibTeX



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

Projekt

ReaSem



Forschungsgruppe

Wissensmanagement


Forschungsgebiet

Komplexitätstheorie, Logik