This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Organization and Performance of a TREAT-Based Production System Compiler
March 1991 (vol. 3 no. 1)
pp. 3-10

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] A. V. Aho, R. Sethi, and J. D. Ullman,Compilers: Principles, Techniques, and Tools. Reading, MA: Addison-Wesley, 1986.
[2] J.A. Blakeley and N. L. Martin, "Join index, materialized view, and hybrid-hash join: A performance analysis," inProc. Sixth Int. Conf. Data Eng., IEEE Computer Society Press, Feb. 1990, pp. 256-263.
[3] L. Brownston et al.,Programming Expert Systems in OPS5, An Introduction to Rule-Based Programming, Addison Wesley, Reading, Mass., 1985, Chapter 4, pp. 161- 164.
[4] B. Clayton,ART Reference Manual, Inference Corp., 1985.
[5] C.L. Forgy, "A fast algorithm for the many pattern/many object pattern matching problem,"Artif Intell., vol. 19, pp. 17-37, 1982.
[6] M.S. Fox, "AI and expert systems, Myths, legends and facts,"IEEE Expert, pp. 8-20, Feb. 1990.
[7] A. Gupta,Parallelism in Production Systems, Morgan Kaufmann, Palo Alto, Calif., 1987.
[8] A. Gupta, C. L. Forgy, D. Kalp, A. Newell, and M. Tambe, "Results of parallel implementation of OPS5 on the Encore multiprocessor," inProc. Int. Conf. Parallel Processing, IEEE, Computer Society Press, 1988, pp. I:271-280.
[9] T. Ishida, "Optimizing rules in production system programs," inProc. Nat. Conf. Artif. Intell., AAAI, Aug. 1988, pp. 699-704.
[10] B.J. Lofaso Jr, "On join optimization for an OPS5 compiler," Master's thesis, Dep. Comput. Sci., Univ. of Texas at Austin, 1988.
[11] J. McDermott, A. Newell, and J. Moore, "The efficiency of certain production system implementations," inPattern-directed Inference Systems, Waterman and Hayes-Roth, Eds. New York: Academic, 1978.
[12] M.I. Schor, T. P. Daly, H. S. Lee, and B. R. Tibbitts, "Advances in RETE pattern matching," inProc. Nat. Conf. Artif. Intell., AAAI, Aug. 1986, pp. 226-232.
[13] D.P. Miranker, "TREAT: A better match algorithm for AI production systems," inProc. Nat. Conf. Artif. Intell., AAAI, Aug. 1987, pp. 42-47.
[14] D.P. Miranker,TREAT: A New and Efficient Match Algorithm for AI Production Systems. Los Altos, CA: Pittman/Morgan-Kaufman, 1989.
[15] D.P. Miranker, D. Brant, B.J. Lofaso, and D. Gadbois, "On the performance of lazy matching in production systems," inProc. 1990 Nat. Conf. Artif. Intell., AAAI, July 1990, pp. 685-692.
[16] D.P. Miranker, B.J. Lofaso, G. Farmer, A. Chandra, and D. Brant, "On a TREAT based production system compiler," inProc. 10th Int. Conf. Expert Syst., Avignon, France, June 1990, pp. 617-630.
[17] P. Nayak, A. Gupta, and P. Rosenbloom, "Comparison of the Rete and Treat production matchers for soar (a summary)," inProc. Nat. Conf. Artif. Intell., AAAI, Aug. 1988, pp. 693-698.
[18] K. Oflazer, "Partitioning and parallel processing of production systems," Ph.D. dissertation, Dep. Comput. Sci., Carnegie-Mellon Univ., 1986.
[19] M. Quinn,Designing Efficient Algorithms for Parallel Computers. New York: McGraw-Hill, 1987.
[20] L. Raschid, T. Sellis, and C.C. Lin, "Exploiting concurrency in a DBMS implementation for production systems," inProc. Int. Symp. Databases Parallel Distributed Syst., 1988.
[21] R. Joobbani and D.P. Siewiorek, "WEAVER: A knowledge-based routing expert,"IEEE Design Test Comput., pp. 12-23, Feb, 1986.
[22] S.J. Stolfo and D.P. Miranker, "The DADO production system machine,"J. Parallel Distributed Comput., vol. 3, pp. 269-296, June 1986.
[23] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[24] J. D. Ullman,Database and Knowledge-base Systems. Rockville, MD: Computer Science Press, 1988.
[25] M. van Biema, "The constrain-based paradigm: The integration of the object-oriented and the rule-based programming paradigms," Ph.D. dissertation, Columbia Univ., 1990.
[26] P. M. Winston,Artificial Intelligence. Reading, MA: Addison-Wesley, 1984.

Index Terms:
organization; performance; TREAT-based production system compiler; OPS5 production system programs; list processing; LISP; relational algebra; expert systems; program compilers
Citation:
D.P. Miranker, B.J. Lofaso, "The Organization and Performance of a TREAT-Based Production System Compiler," IEEE Transactions on Knowledge and Data Engineering, vol. 3, no. 1, pp. 3-10, March 1991, doi:10.1109/69.75882
Usage of this product signifies your acceptance of the Terms of Use.