1. Lect Notes Comput Sci;A. Aiken,1993
2. F. Baader. Augmenting Concept Languages by Transitive Closure of Rules: An Alternativ to Terminological Cycles. In Proc. of the 12th International Joint Conference on Artificial Intelligence (IJCAI’91), pages 446–451, 1991. Morgan Kaufmann Publishers.
3. F. Baader. Using Automata Theory for Characterizing the Semantics of Terminological Cycles. Annals of Mathematics and Artificial Intelligence, 18(2–4):175–219, 1996.
4. Lect Notes Comput Sci;F. Baader,1991
5. F. Baader and R. Küsters. Matching in Description Logics with Existential Restrictions. In Proc. of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000), pages 261–272, 2000. Morgan Kaufmann Publishers.