Author:
Baader Franz,Binh Nguyen Thanh,Borgwardt Stefan,Morawska Barbara
Reference28 articles.
1. [1] Baader, F., “Terminological cycles in a description logic with existential restrictions,” pp. 325–30 in Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI’03), edited by G. Gottlob and T. Walsh, Morgan Kaufmann, San Francisco, Calif., 2003.
2. [2] Baader, F., N. T. Binh, S. Borgwardt, and B. Morawska, “Computing local unifiers in the description logic $\mathcal{EL}$ without the top concept,” pp. 2–8 in Proceedings of the 25th International Workshop on Unification (UNIF’11), edited by F. Baader, B. Morawska, and J. Otop, 2011.
3. [3] Baader, F., N. T. Binh, S. Borgwardt, and B. Morawska, “Unification in the description logic $\mathcal{EL}$ without the top concept,” pp. 70–84 in Automated Deduction—CADE-23, edited by N. Bjørner and V. Sofronie-Stokkermans, vol. 6803 of Lecture Notes in Computer Science, Springer, Heidelberg, 2011.
4. [4] Baader, F., S. Borgwardt, and B. Morawska, “A goal-oriented algorithm for unification in $\mathcal{ELH}_{R^{+}}$ w.r.t. cycle-restricted ontologies,” pp. 493–504 in AI 2012: Advances in Artificial Intelligence, edited by M. Thielscher and D. Zhang, vol. 7691 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012.
5. [5] Baader, F., S. Borgwardt, and B. Morawska, “SAT- encoding of unification in $\mathcal{ELH}_{R^{+}}$ w.r.t. cycle-restricted ontologies,” pp. 30–44 in Automated Reasoning, edited by B. Gramlich, D. Miller, and U. Sattler, vol. 7364 of Lecture Notes in Computer Science, Springer, Heidelberg, 2012.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献