Issues of Decidability for Description Logics in the Framework of Resolution

Hustadt, U. and Schmidt, R. A. (2000)

In Caferra, R. and Salzer, G. (eds), Automated Deduction in Classical and Non-Classical Logics, Lecture Notes in Artificial Intelligence, Vol. 1761, Springer, 191-205. BiBTeX, PostScript (Copyright © Springer)

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.

The previous version appears in Caferra, R. and Salzer, G. (eds), Technical Report E1852-GS-981, Technische Universität Wien, Vienna, Austria, 152-161. Abstract, BiBTeX, PostScript.
Renate A. Schmidt
Home | Publications | Tools | FM Group | School | Man Univ

Last modified: 27 Apr 2001
Copyright © 1999 Renate A. Schmidt, School of Computer Science, Man Univ,