Author:
Badea Liviu,Nienhuys-Cheng Shan -Hwei
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Baader F., Küsters R. Least common subsumer computation w.r.t. cyclic ALNterminologies. In Proc. Int. Workshop on Description Logics (DL’98), Trento, Italy.
2. Baader F., R. Küsters, R. Molitor. Computing Least Common Subsumers in Description Logics with Existential Restrictions. Proc. IJCAI’99, pp. 96–101.
3. Badea Liviu, Stanciu Monica. Refinement Operators Can Be (Weakly) Perfect. Proc. ILP-99, LNAI 1631, Springer, 1999, pp. 21–32.
4. Badea Liviu. Perfect Refinement Operators Can Be Flexible. Proc. ECAI-2000.
5. Borgida A. On the relative Expressiveness of Description Logics and Predicate Logics. Artificial Intelligence, Vol. 82, Number 1–2, pp. 353–367, 1996.
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献