This is an old revision of the document!
Graph Processing with the Rete Algorithm
Introduction
The Rete Algorithm was introduced in the paper “A network match routine for production systems” by Chales L Forgy. 1) Forgy went on to develop the OPS5 system based on the algorithm. 2) It supports systems that are defined as an unordered collection of If-Then statements call productions that operate on data held in an in-memory database called working memory. Each production consists of two parts: The Left Hand Side (LHS) and the Right Hand Side. When the conditions described in the LHS are met then the actions in the RHS are executed. Forgy describes the algorithm as an indexing function represented as a network of simple feature recognizers.
