• 203 Accesses

Abstract

In this chapter, we will recall several well-known results concerning confluence. First, it will be shown that confluence is in general an undecidable property of TRSs. Then we shall see that confluence is decidable for finite terminating systems. Moreover, two sufficient criteria for confluence of possibly nonterminating TRSs will be given.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook
USD 9.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media New York

About this chapter

Cite this chapter

Ohlebusch, E. (2002). Confluence. In: Advanced Topics in Term Rewriting. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3661-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3661-8_4

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4419-2921-1

  • Online ISBN: 978-1-4757-3661-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Navigation