1. Baader, F.: Computing a minimal representation of the subsumption lattice of all conjunctions of concepts defined in a terminology. In: Ellis, G., Levinson, R.A., Fall, A., Dahl, V. (eds.) Knowledge Retrieval, Use and Storage for Efficiency: Proc. of the 1st Int. KRUSE Symposium, pp. 168–178 (1995)
2. Lecture Notes in Computer Science;F. Baader,2003
3. Lecture Notes in Artificial Intelligence;F. Baader,2003
4. Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 319–324. Morgan Kaufmann, San Francisco (2003)
5. Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 325–330. Morgan Kaufmann, San Francisco (2003)