Abstract
In order to disprove confluence of term rewriting systems, we develop new criteria for ensuring non-joinability of terms based on interpretation and ordering. We present some instances of the criteria which are amenable for automation, and report on an implementation of a confluence disproving procedure based on these instances. The experiments reveal that our method is successfully applied to automatically disprove confluence of some term rewriting systems, on which state-of-the-art automated confluence provers fail. A key idea to make our method effective is the introduction of usable rules—this allows one to decompose the constraint on rewrite rules into smaller components that depend on starting terms.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aoto, T.: Automated confluence proof by decreasing diagrams based on rule-labelling. In: Proc. of 21st RTA. LIPIcs, vol. 6, pp. 7–16. Schloss Dagstuhl (2010)
Aoto, T., Toyama, Y.: A reduction-preserving completion for proving confluence of non-terminating term rewriting systems. Logical Methods in Computer Science 1(31), 1–29 (2012)
Aoto, T., Yoshida, J., Toyama, Y.: Proving confluence of term rewriting systems automatically. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 93–102. Springer, Heidelberg (2009)
Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133–178 (2000)
Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)
Comon, H., Godoy, G., Nieuwenhuis, R., Tiwari, A.: The confluence of ground term rewrite systems is decidable in polynomial time. In: Proc. of 42nd LICS, pp. 263–297. IEEE Computer Society Press (2001)
Contejean, E., Marché, C., Tomás, A.P., Urbain, X.: Mechanically proving termination using polynomial interpretation. Journal of Automated Reasoning 34, 325–363 (2005)
Dauchet, M., Heuillard, T., Lescanne, P., Tison, S.: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Information and Computation 88, 187–201 (1990)
Durand, I., Middeldorp, A.: Decidable call by need computations in term rewriting. In: McCune, W. (ed.) CADE 1997. LNCS (LNAI), vol. 1249, pp. 4–18. Springer, Heidelberg (1997)
Felgenhauer, B.: Deciding confluence of ground term rewrite systems in cubic time. In: Proc. of 23rd RTA. LIPIcs, vol. 15, pp. 165–175. Schloss Dagstuhl (2012)
Felgenhauer, B.: A proof order for decreasing diagrams. In: Proc. of 1st IWC, pp. 9–15 (2012)
Genet, T.: Decidable approximations of sets of descendants and sets of normal forms. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 151–165. Springer, Heidelberg (1998)
Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 216–231. Springer, Heidelberg (2005)
Giesl, J., Thiemann, R., Schneider-Kamp, P.: Mechanizing and improving dependency pairs. Journal of Automated Reasoning 37(3), 155–203 (2006)
Godoy, G., Tiwari, A.: Confluence of shallow right-linear rewrite systems. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 541–556. Springer, Heidelberg (2005)
Godoy, G., Tiwari, A., Verma, R.: Characterizing confluence by rewrite closure and right ground term rewriting systems. Applicable Algebra in Engineering, Communication and Computing 15, 13–36 (2004)
Hirokawa, N., Klein, D.: Saigawa: A confluence tool. In: Proc. of 1st IWC, p. 49 (2012)
Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: Techniques and features. Information and Computation 205(4), 474–511 (2007)
Hirokawa, N., Middeldorp, A.: Decreasing diagrams and relative termination. Journal of Automated Reasoning 47(4), 481–501 (2011)
Kaiser, Ł.: Confluence of right ground term rewriting systems is decidable. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 470–489. Springer, Heidelberg (2005)
Klein, D., Hirokawa, N.: Confluence of non-left-linear TRSs via relative termination. In: Bjørner, N., Voronkov, A. (eds.) LPAR-18. LNCS, vol. 7180, pp. 258–273. Springer, Heidelberg (2012)
Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press (1970)
Korp, M., Middeldorp, A.: Match-bounds revisited. Information and Computation 207(11), 1259–1283 (2009)
Kusakari, K., Nakamura, M., Toyama, Y.: Argument filtering transformation. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 47–61. Springer, Heidelberg (1999)
Middeldorp, A.: Approximating dependency graphs using tree automata techniques. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 593–610. Springer, Heidelberg (2001)
Oyamaguchi, M.: The Church-Rosser property for ground term rewriting systems is decidable. Theoretical Computer Science 49, 43–79 (1987)
Payet, É.: Loop detection in term rewriting using eliminating unfoldings. Theoretical Computer Science 403, 307–327 (2008)
Salomaa, K.: Decidability of confluence and termination of monadic term rewriting systems. In: Book, R.V. (ed.) RTA 1991. LNCS, vol. 488, pp. 275–286. Springer, Heidelberg (1991)
Standard ML of New Jersey, http://www.sml.org/
Terese: Term Rewriting Systems. Cambridge University Press (2003)
Toyama, Y.: Confluent term rewriting systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, p. 1. Springer, Heidelberg (2005) slides are available from, http://www.nue.riec.tohoku.ac.jp/user/toyama/slides/toyama-RTA05.pdf
Urbain, X.: Modular & incremental automated termination proofs. Journal of Automated Reasoning 32, 315–355 (2004)
Zankl, H., Felgenhauer, B., Middeldorp, A.: CSI – A confluence tool. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS (LNAI), vol. 6803, pp. 499–505. Springer, Heidelberg (2011)
Zankl, H., Felgenhauer, B., Middeldorp, A.: Labelings for decreasing diagrams. In: Proc. of 22nd RTA. LIPIcs, vol. 10, pp. 377–392. Schloss Dagstuhl (2011)
Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae 24, 89–105 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aoto, T. (2013). Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds) Frontiers of Combining Systems. FroCoS 2013. Lecture Notes in Computer Science(), vol 8152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40885-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-40885-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40884-7
Online ISBN: 978-3-642-40885-4
eBook Packages: Computer ScienceComputer Science (R0)