Abstract
Often non left-linear rules in term rewriting systems can be replaced by a finite set of left-linear ones without changing the set of irreducible ground terms. Using appropriate test sets, we can always decide if this is possible and, in case it is, effectively perform such a transformation. We thus can also decide if the set of irreducible ground terms is a regular tree language, using a result of Kucherov.
Supported by M.E.N.
Supported by M.R.T.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. Bündgen. Term completion versus algebraic completion. Dissertation, Universität Tübingen (1991).
R. Bündgen and W. Küchlin. Computing ground reducibility and inductively complete positions. Proc. 3rd RTA, LNCS Vol. 355 (1989), 59–75.
H. Comon. Unification et disunification. Théories et applications. Thèse de Doctorat d'Université, Institut Polytechnique de Grenoble (1988).
J. H. Gallier and R. V. Book. Reductions in tree replacement systems. Theoretical Computer Science 37 (1985), 123–150.
D. Hofbauer and M. Huber. Typical terms and test sets. Unpublished (1992).
M. Huber. Testmengen für Grundreduzierbarkeit: Konstruktionen, Komplikationen, Korollare. Diplomarbeit, Technische Universität Berlin (1991).
J.-P. Jouannaud and E. Kounalis. Proof by induction in equational theories without constructors. Proc. 1st LICS (1986), 358–366.
D. Kapur, P. Narendran, and H. Zhang. Proof by induction using test sets. Proc. 8th CADE, LNCS Vol. 230 (1986), 99–117.
D. Kapur, P. Narendran, and H. Zhang. On sufficient completeness and related properties of term rewriting systems. Acta Informatica 24 (1987), 395–415.
E. Kounalis. Testing for inductive (co)-reducibility. Proc. 15th CAAP, LNCS Vol. 431 (1990), 221–238.
E. Kounalis. Testing for the ground (co)-reducibility property in term rewriting systems. Revised version (1991), to appear.
G. A. Kucherov. On relationship between term rewriting systems and regular tree languages. Proc. 4th RTA, LNCS Vol. 488 (1991), 299–311.
G. A. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. This volume (1992).
J.-L. Lassez and K. Marriott. Explicit representation of terms defined by counter examples. Journal of Automated Reasoning 3 (1987), 301–317.
T. Nipkow and G. Weikum. A decidability result about sufficient completeness of axiomatically specified abstract data types. Proc. 6th GI Conf., LNCS Vol. 145 (1983), 257–268.
D. A. Plaisted. Semantic confluence tests and completion methods. Information and Control 65(2/3) (1985), 182–215.
S. Vágvölgyi and R. Gilleron. For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable. Unpublished (1992).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hofbauer, D., Huber, M. (1993). Computing linearizations using test sets. In: Rusinowitch, M., Rémy, JL. (eds) Conditional Term Rewriting Systems. CTRS 1992. Lecture Notes in Computer Science, vol 656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56393-8_21
Download citation
DOI: https://doi.org/10.1007/3-540-56393-8_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56393-8
Online ISBN: 978-3-540-47549-1
eBook Packages: Springer Book Archive