Complexity boundaries for horn description logics

  • Authors:
  • Markus Krötzsch;Sebastian Rudolph;Pascal Hitzler

  • Affiliations:
  • Institute AIFB, Universität Karlsruhe, Germany;Institute AIFB, Universität Karlsruhe, Germany;Institute AIFB, Universität Karlsruhe, Germany

  • Venue:
  • AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.