Author:
Bodirsky Manuel,Kutz Martin
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832–843, 1983.
2. E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren, and S. Thiel. An efficient algorithm for the configuration problem of dominance graphs. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 815–824, Washington, DC, Jan. 2001.
3. R. Backofen, J. Rogers, and K. Vijay-Shanker. A first-order axiomatization of the theory of finite trees. Journal of Logic, Language, and Information, 4:5–39, 1995.
4. M. Bodirsky, K. Erk, A. Koller, and J. Niehren. Beta Reduction Constraints. In Proceedings of the 12th International Conference on Rewriting Techniques and Applications, Utrecht, 2001.
5. T. Cornell. On determining the consistency of partial descriptions of trees. In 32nd Annual Meeting of the Association for Computational Linguistics, pages 163–170, 1994.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献