Abstract
In this paper we extend the recent divide and conquer technique of Middeldorp and Toyama for establishing (semi-)completeness of constructor systems to conditional constructor systems. We show that both completeness (i.e. the combination of confluence and strong normalization) and semi-completeness (confluence plus weak normalization) are decomposable properties of conditional constructor systems without extra variables in the conditions of the rewrite rules.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.C. Caron, Decidability of Reachability and Disjoint Union of Term Rewriting Systems, Proc. CAAP'92, LNCS 581, pp. 86–101, 1992.
E. Giovannetti and C. Moiso, A Completeness Result for E-Unification Algorithms based on Conditional Narrowing, Proc. Workshop on Foundations of Logic and Functional Programming, Trento, LNCS 306, pp. 157–167, 1986.
B. Gramlich, Generalized Sufficient Conditions for Modular Termination of Rewriting, Proc. ALP'92, LNCS, 1992, to appear. Full version: A Structural Analysis of Modular Termination of Term Rewriting Systems, SEKI Report SR-91–15, Universität Kaiserslautern, 1991.
B. Gramlich, Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems, this volume.
J.W. Klop, A. Middeldorp, Y. Toyama and R.C. de Vrijer, A Simplified Proof of Toyama's Theorem, report CS-R9156, CWI, Amsterdam, 1991.
M. Kurihara and A. Ohuchi, Modularity of Simple Termination of Term Rewriting Systems, Journal of IPS Japan 31(5), pp. 633–642, 1990.
M. Kurihara and A. Ohuchi, Modularity of Simple Termination of Term Rewriting Systems with Shared Constructors, Report SF-36, Hokkaido University, Sapporo, 1990. To appear in Theoretical Computer Science, 1992.
A. Middeldorp, A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems, Proc. LICS'89, Pacific Grove, pp. 396–401, 1989.
A. Middeldorp, Modular Properties of Term Rewriting Systems, Ph.D. thesis, Vrije Universiteit, Amsterdam, 1990.
A. Middeldorp, Modular Properties of Conditional Term Rewriting Systems, report CS-R9105, CWI, Amsterdam, 1991. To appear in Information and Computation.
A. Middeldorp and E. Hamoen, Counterexamples to Completeness Results for Basic Narrowing, report CS-R9154, CWI, Amsterdam, 1991. Extended abstract to appear in Proc. ALP'92, LNCS.
A. Middeldorp and Y. Toyama, Completeness of Combinations of Constructor Systems, Proc. RTA'91, Como, LNCS 488, pp. 188–199, 1991.
E. Ohlebusch, Combinations of Simplifying Conditional Term Rewriting Systems, this volume.
M. Rusinowitch, On Termination of the Direct Sum of Term Rewriting Systems, Information Processing Letters 26, pp. 65–70, 1987.
Y. Toyama, On the Church-Rosser Property for the Direct Sum of Term Rewriting Systems, Journal of the ACM 34(1), pp. 128–143, 1987.
Y. Toyama, Counterexamples to Termination for the Direct Sum of Term Rewriting Systems, Information Processing Letters 25, pp. 141–143, 1987.
Y. Toyama, J.W. Klop and H.P. Barendregt, Termination for the Direct Sum of Left-Linear Term Rewriting Systems, Proc. RTA'89, Chapel Hill, LNCS 355, pp. 477–491, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Middeldorp, A. (1993). Completeness of combinations of conditional constructor systems. 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_6
Download citation
DOI: https://doi.org/10.1007/3-540-56393-8_6
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