Author:
Hirokawa Nao,Middeldorp Aart
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference26 articles.
1. T. Arts, System description: the dependency pair method, in: Proceedings of the 11th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 1833, 2000, pp. 261–264
2. T. Arts, J. Giesl, A Collection of Examples for Termination of Term Rewriting Using Dependency Pairs, Technical Report AIB-2001-09, RWTH Aachen, 2001
3. Termination of term rewriting using dependency pairs;Arts;Theoretical Computer Science,2000
4. Term Rewriting and All That;Baader,1998
5. Termination by completion;Bellegarde;Applicable Algebra in Engineering, Communication and Computing,1990
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献