Uni-Rete : specializing the Rete match algorithm for the unique-attribute representation


Milind Tambe, Dirk Kalp, and Paul Rosenbloom. 1991. “Uni-Rete : specializing the Rete match algorithm for the unique-attribute representation.” In Carnegie Mellon University Computer Science Dept Technical Report.


The combinatorial match in production systems (rule-based systems) is problematical in several areas of production system application: real-time performance, learning new productions for performance improvement, modeling human cognition, and parallelization. The unique-attribute representation is a promising approach to eliminate match combinatorics. Earlier investigations have focused on the ability of unique-attributes to alleviate the problems caused by combinatorial match [Tambe, Newell and Rosenbloom 90]. This paper reports on an additional benefit of unique-attributes: a specialized match algorithm called Uni-Rete. Uni-Rete is a specialization of the widely used Rete match algorithm for unique-attributes, and it has shown over 10-fold speedup over Rete in performing match.
See also: 1991
Last updated on 05/31/2020