1. Arts, T.: Automatically proving termination and innermost normalization of term rewriting systems. Ph.D. thesis, Utrecht University, Utrecht, The Netherlands (1997)
2. Arts, T., Giesl, J.: Automatically proving termination where simplification orderings fail. In: Proc. 7th Int. Joint Conf. on Theory and Practice of Software Development, LNCS 1214 (TAPSOFT’97), pp. 261–272. Springer, Berlin Heidelberg New York (1997)
3. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comp. Sci. 236, 133–178 (2000)
4. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, New York (1998)
5. Bachmair, T., Plaisted, D.A.: Termination orderings for associative–commutative rewriting systems. J. Symb. Comput. 1, 329–349 (1985)