Author:
Courtieu Pierre,Gbedo Gladys,Pons Olivier
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Annov, E., Codish, M., Giesl, J., Schneider-Kamp, P., Thiemann, R.: A Sat-Based Implementation for rpo Termination. In: International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Short Paper) (November 2006)
2. Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236, 133–178 (2000)
3. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
4. Cherifa, A.B., Lescanne, P.: Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation. Science of Computer Programming 9(2), 137–159 (1987)
5. Lecture Notes in Artificial Intelligence;E. Contejean,2007
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献