Author:
Decorte Stefaan,De Schreye Danny,Leuschel Michael,Martens Bern,Sagonas Konstantinos
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. K. R. Apt and D. Pedreschi. Reasoning about Termination of Pure Prolog Programs. Information and Computation, 106(1):109–157, 1993.
2. R. Bol and L. Degerstedt. The Underlying Search for Magic Templates and Tabulation. In D. S. Warren, editor, Proceedings of the Tenth International Conference on Logic Programming, pages 793–811, Budapest, Hungary, June 1993. The MIT Press.
3. A. Bossi, N. Cocco, and M. Fabris. Norms on Terms and their use in Proving Universal Termination of a Logic Program. Theoretical Computer Science, 124(2):297–328, February 1994.
4. W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20–74, January 1996.
5. D. De Schreye, S. Decorte. Termination of Logic Programs: The never-ending story. Journal of Logic Programming, 19/20:199–260, May/July 1994.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献