1. Baader, F., ‘Using Automata Theory for Characterizing the Semantics of Terminological Cycles’. Annals of Mathematics and Artificial Intelligence 18(2–4):175–219, 1996.
2. Baader, F., ‘Computing the least common subsumer in the description logic EL w.r.t. terminological cycles with descriptive semantics’, in Proceedings of the 11th International Conference on Conceptual Structures (ICCS 2003), vol. 2746 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 2003, pp. 117–130.
3. Baader, F., ‘Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles’, in G. Gottlob and T. Walsh, (eds.), Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), Morgan Kaufmann, 2003, pp. 319–324. Structural Subsumption and Least Common Subsumers. 257
4. Baader, F., D. Calvanese, D. McGuinness, D. Nardi, and P. F. Patel- Schneider, (eds.), The Description Logic Handbook: Theory, Implementation, and Applications, Cambridge University Press, 2003.
5. Baader, F., and R. Küsters, ‘Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN -Concept Descriptions’, in O. Herzog and A. Günter, (eds.), Proceedings of the 22nd Annual German Conference on Artificial Intelligence, KI-98, volume 1504 of Lecture Notes in Computer Science, Bremen, Germany, Springer–Verlag, 1998, pp. 129–140,