1. Aoto, T.: Automated confluence proof by decreasing diagrams based on rule-labelling. In: Lynch, C. (ed.) Proc. 21st International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics, vol. 6, pp. 7–16 (2010)
2. Aoto, T., Toyama, Y.: Persistency of confluence. J. Univers. Comput. Sci. 3(11), 1134–1147 (1997)
3. Aoto, T., Toyama, Y.: A reduction-preserving completion for proving confluence of nonterminating term rewriting systems. In: Schmidt-Schauß, M. (ed.) Proc. 22nd International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics, vol. 10, pp. 91–106 (2011)
4. Aoto, T., Yoshida, J., Toyama, Y.: Proving confluence of term rewriting systems automatically. In: Treinen, R. (ed.) Proc. 20th International Conference on Rewriting Techniques and Applications. LNCS, vol. 5595, pp. 93–102 (2009)
5. Codish, M., Lagoon, V., Stuckey, P.: Solving partial order constraints for LPO termination. In: Pfenning, F. (ed.) Proc. 17th International Conference on Rewriting Techniques and Applications. LNCS, vol. 4098, pp. 4–18 (2006)