Complexity Boundaries for Horn Description Logics

TitleComplexity Boundaries for Horn Description Logics
Publication TypeConference Paper
Year of Publication2007
AuthorsSebastian Rudolph, Markus Krotzsch, Pascal Hitzler
Conference NameThe 22nd AAAI Conference on Artficial Intelligence
Conference LocationVancouver, British Columbia, Canada

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.

Full Text

Markus Kr&#246tzsch, Sebastian Rudolph, Pascal Hitzler, 'Complexity Boundaries for Horn Description Logics,' the 22nd AAAI Conference on Artficial Intelligence, AAAI, Vancouver, British Columbia, Canada, 2007, pp. 452-457.