Complexities of Horn Description Logics

From korrekt.org

Jump to: navigation, search


Markus Krötzsch, Sebastian Rudolph, Pascal Hitzler

Complexities of Horn Description Logics



Abstract. Description Logics (DLs) have become a prominent paradigm for representing knowledge in a variety of application areas, partly due to their ability to achieve a favourable balance between expressivity of the logic and performance of reasoning. Horn description logics are obtained, roughly speaking, by disallowing all forms of disjunctions. They have attracted attention since their (worst-case) data complexities are in general lower than for their non-Horn counterparts, which makes them attractive for reasoning with large sets of instance data (ABoxes). It is therefore natural to ask whether Horn DLs also provide advantages for schema (TBox) reasoning, i.e., whether they also feature lower combined complexities. This paper settles this question for a variety of Horn DLs. An example of a tractable Horn logic is the DL underlying the ontology language OWL RL, which we characterise as the Horn fragment of the description logic SROIQ without existential quantifiers. If existential quantifiers are allowed, however, many Horn DLs become intractable. We find that Horn-ALC already has the same worst-case complexity as ALC, i.e., ExpTime, but we also identify various DLs for which reasoning is PSpace-complete. As a side effect, we derive simplified syntactic definitions of Horn DLs, for which we exploit suitable normal form transformations.

Published at ACM Transactions on Computational Logic (Journal paper)

Download PDF (last update: Feb 2 2013)

Citation details

Remarks

This work completely subsumes, extends, and improves earlier results on Complexity Boundaries for Horn Description Logics.

Topics

Description logics

Personal tools