Knuth, D. E. (1973). The Art of Computer Programming, Vol. 3. Addison-Wesley, Mass. Kracht, M., & Wolter, F. (1991). Properties of independently axiomatizable bimodal logics.

The Journal of Symbolic Logic, 56 (4), 1469–1485.

Kutz, O., Wolter, F., & Zakharyaschev, M. (2001). Connecting abstract description systems.

Submitted. Available from http://www.informatik.uni-leipzig.de/~wolter/.

Levesque, H. J., & Brachman, R. J. (1987). Expressiveness and tractability in knowledge representation and reasoning. Computational Intelligence, 3, 78-93.

Lutz, C. (1999). Reasoning with concrete domains. In Dean, T. (Ed.), Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI'99), pp. 90-95, Stockholm, Sweden.

Morgan Kaufmann, Los Altos.

Lutz, C. (2001). Interval-based temporal reasoning with general TBoxes. In Proc. of the 1 Ith Int. Joint Conf. on Artificial Intelligence (IJCAI 2001), pp. 89–94.

Lutz, C., & Sattler, U. (2000).  Mary likes all cats.  In Proc. of the 2000 Description Logic Workshop (DL 2000), pp. 213–226. CEUR Electronic Workshop Proceedings, http://ceur-ws.org/Vol-33/.

Nebel, B. (1988). Computational complexity of terminological reasoning in BACK.  Artificial Intelligence, 34 (3), 371–383.

Nebel, B. (1990). Terminological reasoning is inherently intractable. Artificial Intelligence, 43, 235-249.

Parikh, R. (1980). Propositional logics of programs: Systems, models and complexity. In Proc. of the Ith ACM SIGACT-SIGPLAN Symp. on Principles of Programming Languages (POPL'80), pp. 186-192, Las Vegas (USA).

Prior, A. N. (1967). Past, Present and Future. Oxford University Press. Sattler, U. (1996). A concept language extended with different kinds of transitive roles. In Görz, G., & Hölldobler, S. (Eds.), Proc. of the 20th German Annual Conf. on Artificial Intelligence (KI'96) , No. 1137 in Lecture Notes in Artificial Intelligence, pp. 333–345.

Springer-Verlag.

Schaerf, A. (1993). On the complexity of the instance checking problem in concept languages with existential quantification. J. of Intelligent Information Systems, 2, 265-278.

Schaerf, A. (1994). Reasoning with individuals in concept languages. Data and Knowledge Engineering, 13 (2), 141–176.

Schild, K. (1991). A correspondence theory for terminological logics: Preliminary report. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91), pp. 466–471.

Schmidt-Schauß, M. (1989). Subsumption in KL-ONE is undecidable. In Brachman, R. J.,
Levesque, H. J., & Reiter, R. (Eds.), Proc. of the 1st Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'89), pp. 421–431. Morgan Kaufmann, Los Altos.

Schmidt-Schauß, M., & Smolka, G. (1991). Attributive concept descriptions with complements. Artificial Intelligence, 48 (1), 1–26.