Abstract
A major obstacle to the widespread use of expert systems in real-time domains is the non-predictability of rule execution times. While some researchers have addressed the issue of optimizing response times through better algorithms or parallel hardware, there has been little research towards run-time guarantee for specific match algorithms.
A widely used algorithm for real-time production systems is the RETE algorithm. We want to achieve match-time predictability for RETE, because it is required for real-time responses. Despite RETE's exponential worst-case run-time behavior, I present a pragmatic solution of how to guarantee reaction within a suer-defined time-frame, even if the problem cannot be solved during that period. The solution is based on a micro-level reasoner working at a fine granularity and using on-line cost measures of individual nodes in the RETE network.
This work was done when F.Barachini was visiting the CIS at Stanford University in 1989. He is supported by an FFF and ITF grant from the Austrian Government.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Barachini F., Theuretzbacher N.: “The Challenge of Real-Time Process Control for Production Systems”, Proceedings of AAAI-88, Vol 2, pp. 705–709, Minnesota, 1988.
Barachini F.: “PAMELA: A Rule-Based AI Language for Process Control Applications”, Proceedings on the first International Conference on Industrial and Engineering Applications of Artificial Intelligence, Vol 2, pp. 860–867, Tennessee, 1988.
Barachini F., Mistelberger H., Bahr E.: “The Art of Parallel Pattern Matching”, IJCAI-89 Workshop on Parallel Algorithms for Machine Intelligence and Pattern Recognition, IJCAI-89, Detroit, 1989.
Barachini F., Mistelberger H., Bahr E.: “A New Method for Parallel Pattern Matching”, Proceedings of the IFIP 11th World Computer Congress, pp. 337–342, San Francisco, 1989.
Forgy C. L.: “RETE: A Fast Algorithm for the Many Pattern/Many Object Pattern Matching Problem”, Artificial Intelligence, Vol.19, pp. 17–37, 1982.
Garey M. R., Johnson D.S.: Computers and Intractability, Freeman W. H. Company, New York, 1979.
Georgeff M. P.: “An Embedded Real-Time Reasoning System”, Proceedings of the Second Annual NASA Research Forum, pp. 286–329, Moffet Field, CA.
Gupta A., Forgy C. L., Kalp D., Newell A., Tambe M.: “Results of Parallel Implementation of OPS5 on the Encore Multiprocessor”, Department of Computer Science, Carnegie Melon University, 1986.
Gupta A., Forgy C. L., Newell A., Wedig R.: “Parallel Algorithms and Architectures for Rule-Based Systems”, in the 13th Annual International Symposium on Computer Architectures, IEEE and ACM, 1986.
Gupta A., Tambe M.: “Suitability of Message Passing Computers for Implementing Production Systems”, Proceedings of AAAI-88, Vol 2, pp. 687–692, Minnesota, 1988.
Horwitz E. J., Cooper G. F., Heckerman D.E.: “Reflection and Action Under Scarce Resources: Theoretical Principals and Empirical Study”, in Proceedings of IJCAI-89, pp. 1121–1127, Detroit, 1989.
Haley P.V.: “Real-Time for RETE”, Proceedings of ROBEX-87, Triangle Park, Instrument Society of America, 1987.
Kalp D., Tambe M., Gupta A., Forgy C., Newell A., Acharya A., Milnes B., Swedlow K.: “Parallel OPS5 User's Manual”, Draft, CMU, 1988.
Kelly M. A., Seviora R. E.: “An Evaluation of DRete on CUPID for OPS5 Matching”, Proceedings of IJCAI-89, Vol. 1, pp. 84–90, Detroit, 1989.
Korf R. E.: “Real-Time Heuristic Search: New Results”, in Proceedings of AAAI-88.
Laffey T. J., Cox P. A., Schmidt J. L., Kao S. M., Read J. Y.: “Real-Time Knowledge-Based Systems”, in AI Magazine, Vol 9, no 1, pp. 27–45, 1988.
Miranker D.: “TREAT: A New and Efficient Match Algorithm for AI Production Systems”, Ph.D. Thesis, Columbia University, 1987.
Oflazer K.: “Partitioning in Parallel Processing of Production Systems”, Ph.D. Thesis, Carnegie Melon University, 1986.
O'Reilly C. A., Cromarty A. S.: “Fast is not Real-Time in Designing effective Real-Time AI Systems”, Applications of Artificial Intelligence II, pp. 249–257, International Society of Optical Engineering.
Robinson J.A.: “A Machine-Oriented Logic Based on the Resolution Principle”, Journal of ACM 12, pp. 23–41, 1965.
Tambe M., Rosenbloom P.: “Eliminating Expensive Chunks”, Carnegie Melon Report, CMU-CS-88-189, 1988.
Tambe M., Newell A.: “Some Chunks are Expensive”, in Proceedings of the Fifth International Conference on Machine Learning, pp.451–458, 1988.
Treitl R., Genesereth M.R.: “Choosing Directions for Rules”, Journal of Automated Reasoning 3, pp. 153–157, 1986.
Wright M., Green M., Fiegl G., Cross P.: “An Expert System for Real-Time Control”, in IEEE Software, pp. 16–24, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barachini, F. (1990). Match-time predictability in real-time production systems. In: Gottlob, G., Nejdl, W. (eds) Expert Systems in Engineering Principles and Applications. ESE 1990. Lecture Notes in Computer Science, vol 462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53104-1_42
Download citation
DOI: https://doi.org/10.1007/3-540-53104-1_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53104-3
Online ISBN: 978-3-540-46711-3
eBook Packages: Springer Book Archive