Inproceedings1482: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Wikipedia python library) |
||
(4 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt) | |||
Zeile 1: | Zeile 1: | ||
− | {{Publikation | + | {{Publikation Erster Autor |
− | | | + | |ErsterAutorNachname=Krötzsch |
− | | | + | |ErsterAutorVorname=Markus |
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
− | |Rank= | + | |Rank=2 |
− | |Author= | + | |Author=Sebastian Rudolph |
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
− | |Rank= | + | |Rank=3 |
− | |Author= | + | |Author=Pascal Hitzler |
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
Zeile 24: | Zeile 24: | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
− | | | + | |Link=http://korrekt.org/papers/KroetzschRudolphHitzler_HornTR2007.pdf, http://korrekt.org/papers/KroetzschRudolphHitzler_HornTR2007.pdf, http://www.aifb.uni-karlsruhe.de/Publikationen/showPublikation?publ_id=1432 |
− | |||
|DOI Name= | |DOI Name= | ||
|Projekt=ReaSem, | |Projekt=ReaSem, | ||
− | |Forschungsgruppe= | + | |Forschungsgruppe=Wissensmanagement |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl |
Aktuelle Version vom 16. Oktober 2009, 22:54 Uhr
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: Link, Link, Link
Komplexitätstheorie, Logik, Theoretische Informatik