The Organization and Performance of a TREAT-Based Production System Compiler

An ensemble of techniques that compile OPS5 production system programs to executable machine code is described and an increase in the execution speed of production system programs by two orders of magnitude over the commonly used list processing (LISP)-based OPS5 system is demonstrated. The computer is based on the TREAT incremental match algorithm. A version of the TREAT algorithm, formulated in relational algebra, is presented. The compiler employs optimization techniques derived from relational database system. The combination of the TREAT algorithm and the compiling techniques reduces the proportion of time spent in the match phase below the 'greater than 90%' figure often cited by developers of other production system environments. >

[1]  Daniel P. Miranker.  TREAT: A new and efficient match algorithm for AI production systems , 1988 .

[2]  Mark S. Fox,et al.  AI and expert system myths, legends, and facts , 1990, IEEE Expert.

[3]  Anoop Gupta.  Parallelism in production systems , 1987 .

[4]  Michael Van Biema.  The constraint-based paradigm: the integration of the object-oriented and the rule-based programming paradigms , 1990 .

[5]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

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

[7]  Nancy L. Martin,et al.  Join index, materialized view, and hybrid-hash join: a performance analysis , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[8]  Michael J. Quinn,et al.  Designing Efficient Algorithms for Parallel Computers , 1987 .

[9]  Nancy Martin,et al.  Programming Expert Systems in OPS5 - An Introduction to Rule-Based Programming(1) , 1985, Int. CMG Conference.

[10]  Salvatore J. Stolfo,et al.  The DADO Production System Machine , 1986, J. Parallel Distributed Comput..

[11]  Daniel P. Siewiorek,et al.  WEAVER: A Knowledge-Based Routing Expert , 1986 .

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

[13]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[14]  Allen Newell,et al.  The efficiency of certain production system implementations , 1977, SGAR.

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

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

[17]  Jeffrey D. Ullman,et al.  Principles of database and knowledge-base systems, Vol. I , 1988 .

[18]  Allen Newell,et al.  THE EFFICIENCY OF CERTAIN PRODUCTION SYSTEM IMPLEMENTATIONS1 , 1978 .

[19]  Ho Soo Lee,et al.  Advances in Rete Pattern Matching , 1986, AAAI.

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

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