1. Arts T., Giesl J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236, 133–178 (2000)
2. Baader F., Nipkow T.: Term Rewriting and All That. Cambridge University Press, London (1998)
3. Beklemishev, L.: Representing worms as a term rewriting system. In: Mini-Workshop: Logic, Combinatorics and Independence Results, pp. 3093–3095. Mathematisches Forschungsinstitut Oberwolfach, Report No. 52/2006, 2006, 2006 (abstract)
4. Buchholz W.: Proof-theoretical analysis of termination proofs. Ann. Pure Appl. Log. 75, 57–65 (1995)
5. Buchholz, W.: Another rewrite system for the standard Hydra battle. In: Mini-Workshop: Logic, Combinatorics and Independence Results, pp. 3011–3099. Mathematisches Forschungsinstitut Oberwolfach, Report No. 52/2006, 2006, 2006 (abstract)