Author:
Baader Franz,Molitor Ralf
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Baader, F.: Computing a Minimal Representation of the Subsumption Lattice of all Conjunctions of Concepts Defined in a Terminology. In: Proceedings of KRUSE 1995(1995)
2. Baader, F., Küsters, R.: Computing the least common subsumer and the most specific concept in the presence of cyclic $\mathcal{ALN}$ -concept descriptions. In: Herzog, O. (ed.) KI 1998. LNCS, vol. 1504. Springer, Heidelberg (1998)
3. Baader, F., Küsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Proceedings of IJCAI 1999. Morgan Kaufmann, San Francisco (1999)
4. Borgida, A., Patel-Schneider, P.: A semantics and complete algorithm for subsumption in the Classic description logic. J. Artificial Intelligence Research 1 (1994)
5. Cohen, W.W., Hirsh, H.: Learning the Classic description logic: Theoretical and experimental results. In: Proceedings of KR 1994. Morgan Kaufmann, San Francisco (1994)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献