Critical pair (term rewriting) explained

A critical pair arises in a term rewriting system when two rewrite rules overlap to yield two different terms. In more detail, (t₁, t₂) is a critical pair if there is a term t for which two different applications of a rewrite rule (either the same rule applied differently, or two different rules) yield the terms t₁ and t₂.

Definitions

The actual definition of a critical pair is slightly more involved as it excludes pairs that can be obtained from critical pairs by substitution and orients the pair based on the overlap. Specifically, for a pair of overlapping rules

\rho _{0} : l _{0} \to r _{0} and \rho _{1} : l _{1} \to r _{1} , with the overlap being that l _{0} = D[s] for some non-empty context D [ ] , and the term s (that is not a variable) matches l _{1} under some substitutions s \sigma = l _{1} \tau that are most general, the critical pair is (D \sigma[r _{1} \tau], r _{0} \sigma) .^[1]

When both sides of the critical pair can reduce to the same term, the critical pair is called convergent. Where one side of the critical pair is identical to the other, the critical pair is called trivial.

Examples

For example, in the term rewriting system with rules

f(g(x,y),z)	→ g(x,z)
g(x,y)	→ x,

the only critical pair is ⟨g(x,z), f(x,z)⟩. Both of these terms can be derived from the term f(g(x,y),z) by applying a single rewrite rule.

As another example, consider the term rewriting system with the single rule

By applying this rule in two different ways to the term f(f(x,x),x), we see that (f(x,x), f(x,x)) is a (trivial) critical pair.

Critical pair lemma

Confluence clearly implies convergent critical pairs: if any critical pair ⟨a, b⟩ arises, then a and b have a common reduct and thus the critical pair is convergent.If the term rewriting system is not confluent, the critical pair may not converge, so critical pairs are potential sources where confluence will fail.

The critical pair lemma states that a term rewriting system is weakly (a.k.a. locally) confluent if and only if all critical pairs are convergent. Thus, to find out if a term rewriting system is weakly confluent, it suffices to test all critical pairs and see if they are convergent. This makes it possible to find out algorithmically if a term rewriting system is weakly confluent or not, given that one can algorithmically check if two terms converge.

See also

• Knuth–Bendix completion, an algorithm based on critical pairs to compute a confluent and terminating term rewriting system equivalent to a given one

References

• Franz Baader and Tobias Nipkow, Term Rewriting and All That, Cambridge University Press, 1998 (book weblink)

Notes and References

1. Book: Terese . Term rewriting systems . 2003 . Cambridge University Press . Cambridge, UK . 0-521-39115-6 . 53.