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 a...

Expand abstract

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