Inproceedings1482: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Added from ontology) |
||
| Zeile 1: | Zeile 1: | ||
| + | {{Publikation Author | ||
| + | |Rank=2 | ||
| + | |Author=Sebastian Rudolph | ||
| + | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=3 | |Rank=3 | ||
| Zeile 6: | Zeile 10: | ||
|Rank=1 | |Rank=1 | ||
|Author=Markus Krötzsch | |Author=Markus Krötzsch | ||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
| Zeile 24: | Zeile 24: | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
| − | |Download= | + | |Download=2007_1482_Krötzsch_Complexity_Boun_1.pdf, 2007_1482_Krötzsch_Complexity_Boun_2.pdf |
|Link=http://www.aifb.uni-karlsruhe.de/Publikationen/showPublikation?publ_id=1432 | |Link=http://www.aifb.uni-karlsruhe.de/Publikationen/showPublikation?publ_id=1432 | ||
|DOI Name= | |DOI Name= | ||
| Zeile 31: | Zeile 31: | ||
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Logik |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| Zeile 37: | Zeile 37: | ||
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Komplexitätstheorie |
}} | }} | ||
Version vom 15. August 2009, 19:03 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.
Download: Media:2007_1482_Krötzsch_Complexity_Boun_1.pdf,Media:2007_1482_Krötzsch_Complexity_Boun_2.pdf
Weitere Informationen unter: Link
Komplexitätstheorie, Logik, Theoretische Informatik