Dynamic augmentation of generalized Rete networks for demand-driven matching and rule updating

Abstract

Algorithms for dynamically augmenting an existing Rete network having nonempty partial match memories are described. Two uses of this operation are presented: (1) adding a new pattern to the Rete where it both shares match nodes with the existing Rete and matches existing data, and (2) implementing an efficient method of demand-driven (as oppose to data-driven) pattern matching which makes it possible to match a pattern against existing data when demanded while keeping that pattern out of the normal Rete pattern matching. The algorithms described are applicable to generalized Rete networks in which arbitrary pattern association is allowed. The tradeoffs involved in the design are discussed, including considerations for compilation.