Stage-oe-small.jpg

Techreport1432

Aus Aifbportal
Wechseln zu:Navigation, Suche


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