1. Aoto, T.: Automated confluence proof by decreasing diagrams based on rule-labelling. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics 6, 7–16 (2010)
2. Aoto, T., Toyama, Y.: A reduction-preserving completion for proving confluence of non-terminating term rewriting systems. Logical Methods in Computer Science 8(1:31), 1–29 (2012)
3. Aoto, T., Toyama, Y.: Persistency of confluence. Journal of Universal Computer Science 3(11), 1134–1147 (1997)
4. Aoto, T., Yoshida, J., Toyama, Y.: Proving confluence of term rewriting systems automatically. In: Proceedings of the 20th International Conference on Rewriting Techniques and Applications. Lect. Notes Comput. Sci. 5595, 93–102 (2009)
5. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)