Confluence of Non-Left-Linear TRSs via Relative Termination
Dominik Klein, Nao Hirokawa
Abstract
Open-access reader
Dominik Klein, Nao Hirokawa
Abstract
Open-access reader
Abstract. We present a confluence criterion for term rewrite systems by relaxing termination requirements of Knuth and Bendix ’ confluence criterion, using joinability of extended critical pairs. Because computa-tion of extended critical pairs requires equational unification, which is undecidable, we give a sufficient condition for testing joinability auto-matically. 1
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract. We present a confluence criterion for term rewrite systems by relaxing termination requirements of Knuth and Bendix ’ confluence criterion, using joinability of extended critical pairs. Because computa-tion of extended critical pairs requires equational unification, which is undecidable, we give a sufficient condition for testing joinability auto-matically. 1
Key concepts: Confluence, Undecidable problem, Unification, Computer science, Term (time), Computation, Normalization property, Algorithm