Completion Graph Caching for Expressive Description Logics.
Andreas Steigmiller, Birte Glimm, Thorsten Liebig · 2015
Reasoning in very expressive Description Logics (DLs) such as SROIQ is often hard since non-determinism, e.g., from disjunctions or cardinality restrictions, requires a case-by-case analysis and since a strict separation between intensional (TBox) and ex-tensional (ABox) knowledge is not possible due to nominals. Current state-of-the-art