Author:
Ishizuki Sayaka,Oyamaguchi Michio,Sakai Masahiko
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Algebra and Number Theory
Reference14 articles.
1. Aoto, T., Yoshida, J., Toyama, Y.: Proving confluence of term rewriting systems automatically. In: Proceedings of RTA 2009. LNCS, vol. 5595, pp. 93–102 (2009)
2. Aoto, T., Toyama, Y., Uchida, K.: Proving confluence of term rewriting systems via persistency and decreasing diagrams. In: Proceedings of RTA-TLCA 2014, LNCS, vol. 8560, pp. 46–60 (2014)
3. Baeten, J.C.M., Bergstra, J.A., Klop, J.W., Weijland, W.P.: Term-rewriting systems with rule priorities. Theor. Comput. Sci. 67, 283–301 (1989)
4. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 243–320. MIT Press, Cambridge (1990)
5. Giesl, J., Aschermann, C., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Hensel, J., Otto, C., Plücker, M., Schneider-Kamp, P., Ströder, T., Swiderski, S., Thiemann, R.: Analyzing program termination and complexity automatically with AProVE. J. Autom. Reason. 58, 3–31 (2017)