A Practical Automata-Based Technique for Reasoning in Expressive Description Logics

The automata-based approach is based on translating a knowledge base (KB) whose satisfiability is to be checked In this work we describe the theoretical foundations into some variant of automata on infinite trees that accepts and the implementation of a new automata-based tree-shaped models of the KB, and checking such an automaton technique for reasoning over expressive Description for non-emptiness. This approach is powerful and flexible. Logics that is worst-case optimal and lends itself It is acknowledged that it provides a very robust basis to an efficient implementation. In order to show for showing worst-case optimal complexity upper bounds, the feasibility of the approach, we have realized a and has been applied for a wide range of expressive DLs working prototype of a reasoner based upon these and reasoning services (cf.