Abstract
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reason uniformly over these families. Unlike previous work, the vocabulary on which a rewrite system in the family is built depends itself on the integer parameters. Rewriting makes use of a toolkit for parameterized words which allows to describe a rewrite step made independently by all systems in an infinite family by a single, effective parameterized rewrite step. The main result is a confluence test for all systems in a family at once, based on a critical pair lemma classically based on computing finitely many overlaps between lefthand sides of parameterized rules and then checking for their joinability (which decidability is not garanteed).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Book, R.V., Otto, F.: String Rewriting Systems. In: Text and monographs in Computer Science. Springer, Berlin (1993)
Comon, H.: On unification of terms with integer exponents. Math. Systems Theory 28, 67–88 (1995)
Contejean, E., Marché, C., Monate, B., Urbain, X.: Cime version 2. Technical report, Université Paris-Sud (2000)
Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 243–309. North-Holland, Amsterdam (1990)
Hermann, M., Galbavý, R.: Unification of infinite sets of terms schematized by primal grammars. Theoretical Computer Science 176(1–2), 111–158 (1997)
Klop, J.W., et al.: Term rewriting systems. In: Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)
Le Chenadec, P.: Canonical forms in finitely presented algebras. Pitman, London (1986)
Le Chenadec, P.: Analysis of dehn’s algorithm by critical pairs. Theoretical Computer Science 51(1-2), 27–52 (1987)
Peltier, N.: A unified view of tree automata and term schematisations. In: Ausiello, G., Karhumäki, J., Mauri, G., Luke Ong, C.-H. (eds.) IFIP TCS. IFIP, vol. 273, pp. 491–505. Springer, Heidelberg (2008)
Salzer, G.: On unification of infinite sets of terms and its applications. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol. 624, pp. 409–421. Springer, Heidelberg (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jouannaud, JP., Monate, B. (2010). Infinite Families of Finite String Rewriting Systems and Their Confluence. In: Fermüller, C.G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2010. Lecture Notes in Computer Science, vol 6397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16242-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-16242-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16241-1
Online ISBN: 978-3-642-16242-8
eBook Packages: Computer ScienceComputer Science (R0)