Complexity of Horn Description Logics

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Toggle side column
Complexity of Horn Description Logics

Markus Krötzsch, Sebastian Rudolph, Pascal Hitzler
Complexity of Horn Description Logics
Technical Report, Instistute AIFB, Universität Karlsruhe, volume 1432, February 2007
  • KurzfassungAbstract
    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:Further Information: Link
  • Forschungsgruppe:Research Group: Computational LogicComputational LogicWissensbasierte SystemeKnowledge-Based Systems
  author      = {Markus Kr{\"{o}}tzsch and Sebastian Rudolph and Pascal Hitzler},
  title       = {Complexity of Horn Description Logics},
  institution = {Instistute {AIFB,} Universit{\"{a}}t Karlsruhe},
  year        = {2007},
  month       = {February}