Abstract
Term rewriting systems provide a versatile model of computation. An important property which allows to abstract from potential nondeterminism of parallel execution of the modelled program is confluence. In this paper we prove that confluence of a fairly large class of systems, namely right ground term rewriting systems, is decidable. We introduce a labelling of variables with colours and constrain substitutions according to these colours. We show how right ground rewriting systems can be reduced to simple systems with coloured variables. Such systems can be analysed using reduction-automata techniques which leads to an interesting decision procedure for confluence.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Comon, H., Godoy, G., Nieuwenhuis, R.: The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. In: 42nd Annual IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, USA (2001)
Comon, H., Jacquemard, F., Dauchet, M., Lugiez, D., Gilleron, R., Tison, S., Tomassi, M.: Tree Automata Techniques and Applications, available on internet under, http://www.grappa.univ-lille3.fr/tata/
Comon, H., Narendran, P., Nieuwenhuis, R., Rusinowitch, M.: Decision Problems in Ordered Rewriting. In: IEEE Symposium on Logic in Computer Science, Indianapolis, IN, USA (1998)
Comon, H., Narendran, P., Nieuwenhuis, R., Rusinowitch, M.: Deciding the Confluence of Ordered Term Rewrite Systems. ACM Transactions on Computational Logic, 33–55 (2003)
Dauchet, M., Tison, S.: The Theory of Ground Rewrite Systems is Decidable. In: IEEE Symposium on Logic in Computer Science, Philadelphia, PA (1990)
Godoy, G., Nieuwenhuis, R., Tiwari, A.: Classes of Term Rewrite Systems with Polynomial Confluence Problems. ACM Transactions on Computational Logic 5(2), 321–331 (2004)
Godoy, G., Tiwari, A., Verma, R.: On the Confluence of Linear Shallow Term Rewrite Systems. In: Symposium on Theoretical Aspects of Computer Science, Berlin, Germany (2003)
Jacquemard, F.: Reachability and Confluence are Undecidable for Flat Term Rewriting Systems. Information Processing Letters 87(5), 265–270 (2003)
Kaiser, L.: Confluence of Right Ground Term Rewriting Systems is Decidable, Masters Thesis, University of Wroclaw (June 2003)
Marcinkowski, J.: Undecidability of the First Order Theory of One-Step Right Ground Rewriting. In: Intl. Conference on Rewriting Techniques and Applications, Sitges, Spain (1997)
Oyamaguchi, M.: The Church-Rosser Property for Ground Term Rewriting Systems is Decidable. Theoretical Computer Science 49(1), 43–79 (1987)
Oyamaguchi, M.: The Reachability and Joinability Problems for Right-Ground Term-Rewriting Systems. Journal of Information Processing 13(3), 347–354 (1990)
Tiwari, A.: Polynomial time Algorithms for Deciding Confluence of Certain Term Rewrite Systems. In: IEEE Symposium on Logic in Computer Science, Copenhagen, Denmark (2002)
Tiwari, A., Godoy, G., Verma, R.: Confluence Characterization Using Rewrite Closure with Application to Right Ground Systems. Applicable Algebra in Engeneering, Communication and Computing 15(1), 13–36 (2004)
Verma, R., Rusinowitch, M., Lugiez, D.: Algorithms and Reductions for Rewriting Problems. In: Intl. Conference on Rewriting Techniques and Applications, Tsukuba, Japan (1998)
RTA list of open problems, available on internet under http://www.lsv.ens-cachan.fr/~treinen/rtaloop/problems/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaiser, L. (2005). Confluence of Right Ground Term Rewriting Systems Is Decidable. In: Sassone, V. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2005. Lecture Notes in Computer Science, vol 3441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31982-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-31982-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25388-4
Online ISBN: 978-3-540-31982-5
eBook Packages: Computer ScienceComputer Science (R0)