• Enno Ohlebusch


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.


Normal Form Critical Pair Combinatory Logic Reduction Sequence Independent Position 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Enno Ohlebusch
    • 1
  1. 1.Research Group in Practical Computer Science, Faculty of TechnologyUniversity of BielefeldBielefeldGermany

Personalised recommendations