Stage-oe-small.jpg

Inproceedings1482

Aus Aifbportal
Version vom 16. Oktober 2009, 22:54 Uhr von Nicole Arlt (Diskussion | Beiträge) (Wikipedia python library)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche


Complexity Boundaries for Horn Description Logics


Complexity Boundaries for Horn Description Logics



Published: 2007

Buchtitel: Proceedings of the 22nd AAAI Conference on Artficial Intelligence
Seiten: 452--457
Verlag: AAAI Press
Erscheinungsort: Vancouver, British Columbia, Canada

Referierte Veröffentlichung

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: LinkLinkLink

Projekt

ReaSem



Forschungsgruppe

Wissensmanagement


Forschungsgebiet

Komplexitätstheorie, Logik, Theoretische Informatik