@INPROCEEDINGS{Hustadt+Schmidt@SFTP1998,
 AUTHOR    = {Hustadt, U. and Schmidt, R. A.},
 TITLE     = {Issues of Decidability for Description Logics in the Framework of Resolution},
 EDITOR    = {Caferra, R. and Salzer, G.},
 PAGES     = {192-206},
 PMONTH    = jan,
 PYEAR     = {2000},
 CYEAR     = {1998},
 YEAR      = {1999},
 BOOKTITLE = {Automated Deduction in Classical and Non-Classical Logics},
 SERIES    = {LNAI},
 VOLUME    = {1761},
 PUBLISHER = {Springer},
 URL       = {Hustadt+Schmidt@SFTP1998.pdf},
 URL       = {http://dx.doi.org/10.1007/3-540-46508-1_13},
 ABSTRACT  = {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.}
}