Author:
Giesl Jürgen,Thiemann René,Schneider-Kamp Peter,Falke Stephan
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference45 articles.
1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236, 133–178 (2000)
2. Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical report AIB-2001-09, RWTH Aachen, Germany. Available from http://aib.informatik.rwth-aachen.de (2001)
3. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge, UK (1998)
4. Borralleras, C.: Ordering-based methods for proving termination automatically. Ph.D. thesis, Universitat Politècnica de Catalunya, Spain (2003)
5. Borralleras, C., Ferreira, M., Rubio, A.: Complete monotonic semantic path orderings. In: Proceedings of the 17th CADE. LNAI 1831, pp. 346–364 (2000)
Cited by
140 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献