Incremental binding-space match: the linearized matchbox algorithm

Abstract

A new binding-space algorithm conjunctive match is introduced. Known as the linearized match box, it improves on the parallel match box algorithm by reducing broadcast cost, better adapting it to serial computers. Cost estimates are presented that help determine the applicability of linearized match box for particular rule problems. Linearized match box has been implemented, and its utility in overcoming PRODIGY's control knowledge bottleneck is discussed.<>