Complexities of Horn Description Logics.

Journal article

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 those of 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, that is, whether they also feature lower combined complexities. This article 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 characterize 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, that is, 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. © 2013 ACM 1529-3785/2013/02-ART2 $15.00.

Authors: Krötzsch, M; Rudolph, S; Hitzler, P

• Journal: ACM Trans. Comput. Log.
• Volume: 14
• Issue: 1
• Pages: 2-2
• Publication date: 2013-01-01
• DOI: 10.1145/2422085.2422087
• EISSN: 1557-945X
• ISSN: 1529-3785
• Language: English
• Keywords: Horn logic; Description logics; Computational complexity