Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
Motivated by the possibilities of applying deductive database technology for efficient query answering in description logics, we present a translation operator µ that transforms...
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
We introduce an extension of Description Logics (DLs) for representing and reasoning about contextualized knowledge. Our formalism is inspired by McCarthy’s theory of formalizing...
Abstract. A four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases. This approach has a distinct advantage that it can ...