Confluence (abstract rewriting)

From Wikipedia, the free encyclopedia
  (Redirected from Confluence (term rewriting))
Jump to: navigation, search
Pic.1: The name confluence is inspired from geography, meaning there the meeting of two bodies of water.

In computer science, confluence is a property of rewriting systems, describing which terms in such a system can be rewritten in more than one way, to yield the same result. This article describes the properties in the most abstract setting of an abstract rewriting system.

Motivating examples[edit]

The usual rules of elementary arithmetic form an abstract rewriting system. For example, the expression (11 + 9) × (2 + 4) can be evaluated starting either at the left or at the right parentheses; however, in both cases the same result is obtained eventually. This suggests that the arithmetic rewriting system is a confluent one.


\begin{array}{|rcccl|}
\hline
\color{MidnightBlue}{\mbox{eval left}}&&(11+9)\times(2+4)&&\color{MidnightBlue}{\mbox{eval right}}\\
&\color{MidnightBlue}{\swarrow}&&\color{MidnightBlue}{\searrow}&\\
20\times(2+4)&&&&(11+9)\times 6\\
&\color{MidnightBlue}{\searrow}&&\color{MidnightBlue}{\swarrow}&\\
\color{MidnightBlue}{\mbox{eval right}}&&20 \times 6&&\color{MidnightBlue}{\mbox{eval left}}\\
&&\color{MidnightBlue}{\downarrow}&&\\
&&120&&\\
\hline
\end{array}

A second, more abstract example is obtained from the following proof of each group element equalling the inverse of its inverse: [1]

Group axioms
A1 1 ⋅ a = a
A2 a-1a = 1
A3     (ab) ⋅ c = a ⋅ (bc)
Proof of R4: a-1⋅(ab) = b
a-1 ⋅ (ab)
= (a-1a) ⋅ b by A3(r)    
= 1 ⋅ b by A2
= b by A1
Proof of R6: (a-1)-1 ⋅ 1 = a
(a-1)-1 ⋅ 1
= (a-1)-1 ⋅ (a-1a) by A2(r)
= a by R4
Proof of R10: (a-1)-1b = ab
(a-1)-1b
= (a-1)-1 ⋅ (a-1 ⋅ (ab)) by R4(r)
= ab by R4
Proof of R11: a ⋅ 1 = a
a ⋅ 1
= (a-1)-1 ⋅ 1 by R10(r)
= a by R6
Proof of R12: (a-1)-1 = a
(a-1)-1
= (a-1)-1 ⋅ 1 by R11(r)    
= a by R6

This proof starts from the given group axioms A1-A3, and establishes five propositions R4, R6, R10, R11, and R12, each of them using some earlier ones, and R12 being the main theorem. Some of the proofs require non-obvious, if not creative, steps, like applying axiom A2 in reverse, thereby rewriting "1" to "a-1 ⋅ a" in the first step of R6's proof. One of the historical motivations to develop the theory of term rewriting was to avoid the need for such steps, which are difficult to find by an unexperienced human, let alone by a computer program.

If a term rewriting system is confluent and terminating, a straight-forward method exists to prove equality between two expressions (a.k.a. terms) s and t: Starting with s, apply equalities[note 1] from left to right as long as possible, eventually obtaining a term s’. Obtain from t a term t’ in a similar way. If both terms s’ and t’ literally agree, then s and t are (not surprisingly) proven equal. More important, if they disagree, s and t cannot be equal. That is, any two terms s and t that can be proven equal at all, can be so by that method.

The success of that method doesn't depend on a certain sophisticated order in which to apply rewrite rules, as confluence ensures that any sequence of rule applications will eventually lead to the same result (while the termination property ensures that any sequence will eventually reach an end at all). Therefore, if a confluent and terminating term rewriting system can be provided for some equational theory,[note 2] not a tinge of creativity is required to perform proofs of term equality; that task hence becomes amenable to computer programs. Modern approaches handle more general abstract rewriting systems rather than term rewriting systems; the latter are a special case of the former.

General case and theory[edit]

In this diagram, a reduces to both b or c in zero or more rewrite steps (denoted by the asterisk). In order for the rewrite relation to be confluent, both reducts must in turn reduce to some common d.

A rewriting system can be expressed as a directed graph in which nodes represent expressions and edges represent rewrites. So, for example, if the expression a can be rewritten into b, then we say that b is a reduct of a (alternatively, a reduces to b, or b is an expansion of a). This is represented using arrow notation; ab indicates that a reduces to b. Intuitively, this means that the corresponding graph has a directed edge from a to b.

If there is a path between two graph nodes c and d, then the intermediate nodes form a reduction sequence. So, for instance, if cc’ → c’’ → ... → d’ → d, then we can write c* d, indicating the existence of a reduction sequence from c to d. Formally, →* is the reflexive-transitive closure of →. Using the example from the previous paragraph, we have (11+9)×(2+4) → 20×(2+4) and 20×(2+4) → 20×6, so (11+9)×(2+4) →* 20×6.

With this established, confluence can be defined as follows. Let a, b, cS, with a* b and a* c. a is deemed confluent if there exists a dS with b* d and c* d. If every aS is confluent, we say that → is confluent, or has the Church-Rosser property. This property is also sometimes called the diamond property, after the shape of the diagram shown on the right. Some authors reserve the term diamond property for a variant of the diagram with single reductions everywhere; that is, whenever ab and ac, there must exist a d such that bd and cd. The single-reduction variant is strictly stronger than the multi-reduction one.

Local confluence[edit]

Pic.3: Cyclic locally, but not globally confluent rewrite system
Pic.4: Non-cyclic locally, but not globally confluent rewrite system

An element aS is said to be locally (or weakly) confluent if for all b, cS with ab and ac there exists dS with b* d and c →* d. If every aS is locally confluent, then → is called locally (or weakly) confluent, or having the weak Church-Rosser property. This is different from confluence in that b and c must be reduced from a in one step. In analogy with this, confluence is sometimes referred to as global confluence.

The relation →*, introduced as a notation for reduction sequences, may be viewed as a rewriting system in its own right, whose relation is the reflexive-transitive closure of . Since a sequence of reduction sequences is again a reduction sequence (or, equivalently, since forming the reflexive-transitive closure is idempotent), →** = →*. It follows that → is confluent if and only if →* is locally confluent.

A rewriting system may be locally confluent without being (globally) confluent. Examples are shown in picture 3 and 4. However, Newman's lemma states that if a locally confluent rewriting system has no infinite reduction sequences (in which case it is said to be terminating or strongly normalizing), then it is globally confluent.

Semi-confluence[edit]

The definition of local confluence differs from that of global confluence in that only elements reached from a given element in a single rewriting step are considered. By considering one element reached in a single step and another element reached by an arbitrary sequence, we arrive at the intermediate concept of semi-confluence: aS is said to be semi-confluent if for all b, cS with ab and a* c there exists dS with b* d and c* d; if every aS is semi-confluent, we say that → is semi-confluent.

A semi-confluent element need not be confluent, but a semi-confluent rewriting system is necessarily confluent, and a confluent system is trivially semi-confluent.

Strong confluence[edit]

Strong confluence is another variation on local confluence that allows us to conclude that a rewriting system is globally confluent. An element aS is said to be strongly confluent if for all b, cS with ab and ac there exists dS with b* d and either cd or c = d; if every aS is strongly confluent, we say that → is strongly confluent.

A strongly confluent element need not be confluent, but a strongly confluent rewriting system is necessarily confluent.

Examples of confluent systems[edit]

  • Reduction of polynomials modulo an ideal is a confluent rewrite system provided one works with a Gröbner basis.
  • Matsumoto's theorem follows from confluence of the braid relations.

See also[edit]

Notes[edit]

  1. ^ then called rewrite rules to emphasize their left-to-right orientation
  2. ^ The Knuth–Bendix completion algorithm can be used to compute such a system from a given set of equations. Such a system e.g. for groups is shown here, with its propositions consistently numbered. Using it, a proof of e.g. R6 consists in applying R11 and R12 in any order to (a-1)-1⋅1 to obtain a.; no other rules are applicable.

References[edit]

  • Term Rewriting Systems, Terese, Cambridge Tracts in Theoretical Computer Science, 2003.
  • Term Rewriting and All That, Franz Baader and Tobias Nipkow, Cambridge University Press, 1998
  1. ^ K. H. Bläsius and H.-J. Bürckert, ed. (1992). Deduktionsssysteme. Oldenbourg. p. 291. ; here: p.134; axiom and proposition names follow the original text

External links[edit]