Category: CMUTR
Institution: Department of Computer Science, Carnegie
        Mellon University
Abstract: 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 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.
        
        
        
        
Number: CMU-CS-91-180
Bibtype: TechReport
Month: Sep
Author: Milind Tambe 
        Dirk kalp
        Paul Rosenbloom1		
Title: Uni-Rete: Specializing the Rete Match Algorithm for the
        Unique-attribute Representation
Year: 1991
Address: Pittsburgh, PA
Super: @CMUTR