The Complexity of Reasoning with Cardinality
Restrictions and Nominals in Expressive Descriprion Logics
-
Online Appendix
The following papers cited in the article are available online:
-
F. Baader and U. Sattler.
Expressive number restrictions in description logics.
Journal of Logic and Computation, 9(3):319-350, 1999.
-
G. De Giacomo.
Decidability of Class-Based Knowledge Representation Formalisms.
PhD thesis, Dip. di Inf. e Sist., Univ. di Roma ``La Sapienza'',
1995.
-
I. Horrocks, U. Sattler, and S. Tobies.
Practical reasoning for expressive
description logics.
In Proceedings of the 6th International Conference on Logic
for Programming and Automated Reasoning (LPAR'99), pages
161-180, 1999.
-
S. Tobies.
A NExpTime-complete description logic strictly contained in
C2.
In J. Flum and M. RodrÃguez-Artalejo, editors, Proceedings
of the Annual Conference of the European Association for Computer Science
Logic (CSL-99), LNCS 1683, pages 292-306. Springer-Verlag,
1999.
-
S. Tobies.
PSPACE reasoning for graded modal logics.
Journal of Logic and Computation.
To appear.
Stephan Tobies
Last modified: Mon Feb 28 13:47:19 CET 2000