Editing Rete algorithm (section)

=== Diagram ===
The following diagram illustrates the basic Rete topology, and shows the associations between different node types and memories.

[[Image:Rete.svg|thumb|500px|Illustrates the basic Rete.]]

* Most implementations use type nodes to perform the first level of selection on tuple working memory elements.   Type nodes can be considered as specialized select nodes.   They discriminate between different tuple relation types.
* The diagram does not illustrate the use of specialized nodes types such as negated conjunction nodes.   Some engines implement several different node specialisations in order to extend functionality and maximise optimisation.
* The diagram provides a logical view of the Rete.   Implementations may differ in physical detail.   In particular, the diagram shows dummy inputs providing right activations at the head of beta node branches.  Engines may implement other approaches, such as adapters that allow alpha memories to perform right activations directly.
* The diagram does not illustrate all node-sharing possibilities.

For a more detailed and complete description of the Rete algorithm, see chapter 2 of Production Matching for Large Learning Systems by Robert Doorenbos (see link below).