Skip to main content
SpringerLink
Log in
Book cover

Colloquium on Trees in Algebra and Programming

CAAP 1992: CAAP '92 pp 86–101Cite as

Decidability of reachability and disjoint union of term rewriting systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 581))

Abstract

The reachability problem for term rewriting systems is to decide whether, given a system S and two terms t and t′, t can be reduced in t′ with rules of S. We study the disjoint union of term rewriting systems whose reachability problem is decidable and give sufficient conditions for obtaining the modularity of decidability of this problem.

This work was supported in part by PRC-Mathématique et Informatique and by ESPRIT2-working group ASMICS.

I am grateful for my referees for their useful remarks.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.V. Book, M. Jantzen, and C. Wrathall. Monadic Thue systems. Theoretical Computer Science, 19(3):231–252, 1982.

    Google Scholar 

  2. K. Drosten. Termersetzungssysteme. Informatik-Fachberichte 210, Springer, Germany, 1989.

    Google Scholar 

  3. J.H. Gallier and R.V. Book. Reductions in tree replacement systems. Theoretical Computer Science, 37(2):123–150, 1985.

    Google Scholar 

  4. M. Kurihara and A. Ohuchi. Modularity of simple termination of term rewriting systems. Journal of IPS Japan, 31(5):633–642, 1990.

    Google Scholar 

  5. A. Middeldorp. Modular aspects of properties of term rewriting systems related to normal forms. In Lecture Notes in Computer Science Vol 355, pages 263–277, Chapel Hill, 1989. 3rd International Conference on Rewriting Techniques and Applications. Full version: Report IR-164, Vrije Universiteit, Amsterdam, 1988.

    Google Scholar 

  6. A. Middeldorp. A sufficient condition for the termination of the direct sum of term rewriting systems. In Proceeding of the 4th IEEE Symposium on Logic in Computer Science, pages 396–401, Pacific Grove, 1989.

    Google Scholar 

  7. A. Middeldorp. Modular Properties of Term Rewriting Systems. PhD thesis, Vrije Universiteit, Amsterdam, 1990.

    Google Scholar 

  8. A. Middeldorp. Modular properties of conditional term rewriting systems. Report CS R9105, Centre for Mathematics and Computer Science, Amsterdam, 1991.

    Google Scholar 

  9. M. Oyamaguchi. The reachability problem for quasi-ground term rewriting systems. Journal of Information Processing, pages 9–4, 1986.

    Google Scholar 

  10. M. Rusinowitch. On termination of the direct sum of term rewriting systems. Information Processing Letters, 26:65–70, 1987.

    Google Scholar 

  11. Y. Toyama, J.W. Klop, and H.P. Barendregt. Termination for the direct sum of left-linear term rewriting systems. In Lecture Notes in Computer Science Vol 355, pages 477–491, Chapel Hill, 1989. 3rd International Conference on Rewriting Techniques and Applications.

    Google Scholar 

  12. Y. Toyama. Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141–143, 1987.

    Google Scholar 

  13. Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM, 34(1):128–143, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Fondamentale de Lille UFR IEEA. UA 369 CNRS, Université des Sciences et Techniques de Lille I, 59655, Villeneuve d'Ascq Cedex, France

    Anne -Cécile Caron

Authors
  1. Anne -Cécile Caron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. -C. Raoult

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caron, A.C. (1992). Decidability of reachability and disjoint union of term rewriting systems. In: Raoult, J.C. (eds) CAAP '92. CAAP 1992. Lecture Notes in Computer Science, vol 581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55251-0_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-55251-0_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55251-2

  • Online ISBN: 978-3-540-46799-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation