Complexity Boundaries for Horn Description Logics.
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 whe...
Главные авторы: | Krötzsch, M, Rudolph, S, Hitzler, P |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
AAAI Press
2007
|
Схожие документы
-
Complexities of Horn Description Logics.
по: Krötzsch, M, и др.
Опубликовано: (2013) -
Cheap Boolean Role Constructors for Description Logics.
по: Rudolph, S, и др.
Опубликовано: (2008) -
Description Logic Reasoning with Decision Diagrams: Compiling SHIQ to Disjunctive Datalog.
по: Rudolph, S, и др.
Опубликовано: (2008) -
Type-elimination-based reasoning for the description logic SHIQbs using decision diagrams and disjunctive datalog
по: Rudolph, S, и др.
Опубликовано: (2012) -
Type-elimination-based reasoning for the description logic SHIQbs using decision diagrams and disjunctive datalog
по: Sebastian Rudolph, и др.
Опубликовано: (2012-02-01)