An efficient algorithm for production systems with linear-time match

A specialized match algorithm called Uni-Rete is reported. Uni-Rete is a specialization of the widely used Rete match algorithm to unique attributes. Performance results for Uni-Rete indicate over tenfold speedup with respect to Rete. The implications of Uni-Rete for non-unique-attribute systems are discussed.<<ETX>>

[1]  A. Newell.  Unified Theories of Cognition , 1990 .

[2]  Milind Tambe,et al.  Production Systems on Message Passing Computers: Simulation Results and Analysis , 1989, ICPP.

[3]  John P. McDermott,et al.  R1: A Rule-Based Configurer of Computer Systems , 1982, Artif. Intell..

[4]  Ho Soo Lee,et al.  Match Algorithms for Generalized Rete Networks , 1992, Artif. Intell..

[5]  Charles L. Forgy,et al.  Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..

[6]  Anoop Gupta,et al.  Comparison of the RETE and TREAT production matchers for soar (A summary) , 1988, AAAI 1988.

[7]  A. Newell,et al.  The Problem of Expensive Chunks and its Solution by Restricting Expressiveness , 1990 .

[8]  Allen Newell,et al.  SOAR: An Architecture for General Intelligence , 1987, Artif. Intell..

[9]  Daniel P. Miranker,et al.  The Organization and Performance of a TREAT-Based Production System Compiler , 1991, IEEE Trans. Knowl. Data Eng..

[10]  John L. Hennessy.  RISC architecture: a perspective on the past and future , 1989 .

[11]  Toru Ishida,et al.  Optimizing Rules in Production System Programs , 1988, AAAI.

[12]  Jacques Bouaud,et al.  A Reconstruction of Conceptual Graphs on Top of a Production System , 1992, Workshop on Conceptual Graphs.

[13]  Allen Newell,et al.  Soar/PSM-E: investigating match parallelism in a learning production sytsem , 1988, PPoPP 1988.

[14]  Daniel P. Miranker.  TREAT: a better match algorithm for AI production systems , 1987, AAAI 1987.

[15]  Tambe,et al.  Uni-Rete : specializing the Rete match algorithm for the unique-attribute representation , 1991 .

[16]  Donald A. Waterman,et al.  Pattern-Directed Inference Systems , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Thomas J. Laffey,et al.  Real-Time Knowledge-Based Systems , 1988, AI Mag..

[18]  Milind Tambe.  Eliminating combinatorics from production match , 1991 .

[19]  Kemal Oflazer,et al.  Partitioning in parallel processing of production systems , 1987 .

[20]  Daniel P. Miranker,et al.  On the Performance of Lazy Matching in Production Systems , 1990, AAAI.

[21]  Allen Newell,et al.  Natural Language Comprehension in Soar Spring 1991 , 1991 .

[22]  Milind Tambe,et al.  A Frameworkfor Investigating Production System Formulations with Polynomially Bounded Match , 1990, AAAI.

[23]  Steven Minton,et al.  Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..

[24]  Mark W. Perlin,et al.  The Match Box algorithm for parallel production system match , 1989 .

[25]  Franz Barachini.  The evolution of PAMELA , 1991 .

[26]  Allen Newell,et al.  The logic theory machine-A complex information processing system , 1956, IRE Trans. Inf. Theory.

[27]  Charles L. Forgy,et al.  Rete: a fast algorithm for the many pattern/many object pattern match problem , 1991 .

[28]  Allen Newell,et al.  Some Chunks Are Expensive , 1988, ML.

[29]  Elaine Kant,et al.  Programming expert systems in OPS5 , 1985 .

[30]  Tom M. Mitchell,et al.  Becoming Increasingly Reactive , 1990, AAAI.

[31]  Milind Tambe,et al.  Eliminating Expensive Chunks by Restricting Expressiveness , 1989, IJCAI.