U. Hustadt and R. A. Schmidt (2000a): ``Issues of Decidability for Description Logics in the Framework of Resolution.'' In G. Salzer and R. Caferra, editors, Automated Deduction in Classical and Non-Classical Logics, pp. 192-206. LNAI 1761, Springer 2000.
Abstract, BiBTeX, PDF (© Springer-Ver$

We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an ordering restriction and applies to the description logic ALB, which extends ALC with the top role, full role negation, role intersection, role disjunction, role converse, domain restriction, range restriction, and role hierarchies. The second method is based solely on a selection restriction and applies to reducts of ALB without the top role and role negation. The latter method can be viewed as a polynomial simulation of familiar tableaux-based decision procedures. It can also be employed for automated model generation. [an error occurred while processing this directive]