Complexity boundaries for horn description logics
Markus Krötzsch, Sebastian Rudolph, Pascal Hitzler · Journal of Bioresource Management · 2007
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. com-bined) complexities, which makes them attractive for rea-soning with large ABoxes. However, the natural question whether Horn-DLs also provide advantages for TBox reason-ing has hardly been addressed so far. In this paper, we there-fore 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.