1. Termination of term rewriting using dependency pairs;Arts;Theoret. Comput. Sci.,2000
2. Term Rewriting and All That;Baader,1998
3. C. Borralleras, Ordering-based methods for proving termination automatically, Ph.D. thesis, Dpto. LSI, Universitat Politècnica de Catalunya, España, 2003
4. Recursive path orderings can be context-sensitive;Borralleras,2002
5. Modular termination proofs for rewriting using dependency pairs;Giesl;J. Symbolic Comput.,2002