Skip to main content

Match algorithm for a real time expert system

  • Expert and Knowledge Based Systems 1
  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1134))

Included in the following conference series:

  • 147 Accesses

Abstract

Rule based systems or production rule languages are an established means of encoding expertise [2]. The evaluation of satisfaction of a set of production rules (match phase in the inference cycle) is computationally expensive [2]. RETE [1] and TREAT [3] are two exponential algorithms that perform this evaluation efficiently. This exponential bound leads to unpredictable response times. This unpredictability is unacceptable in real time applications. Alternate match algorithms with polynomial bounds and hence predictable response times are necessary for real time expert systems. We present a match algorithm with polynomial time bound. The polynomial time bound is obtained by exploiting the real time domain semantics. This algorithm is implemented in a real time expert system shell, REX [4, 5].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. L. Forgy. RETE: A fast match algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19(1):17–37, 1982.

    Article  Google Scholar 

  2. D. Miranker and B. Lofaso. The organisation and performance of a TREAT based production system compiler. IEEE Transactions on Knowledge and Data Engineering, 3(1):3–11, 1991.

    Article  Google Scholar 

  3. D. P. Miranker. TREAT: A New and Efficient Match Algorithm for AI Production Systems. Morgan Kaufmann, 1989.

    Google Scholar 

  4. T. S. Perraju, G. Uma, and B. E. Prasad. A scheme for knowledge representation, verification and reasoning in real time asynchronous production systems. In Proceedings of IEEE Int. Conf. on Tools with AI, pages 647–653. IEEE CS Press, 1994.

    Google Scholar 

  5. B. E. Prasad, T. S. Perraju, G. Uma, and P. Umarani. An Expert System Shell for Aerospace Applications. IEEE Expert, 9(4):56–64, Aug. 1994.

    Article  Google Scholar 

  6. B. E. Prasad, G. Uma, P. Umarani, and T. S. Perraju. Architecture of REX: An Object Oriented Asynchronous Real Time Expert System Shell. Technical Report REX/TR-4, University of Hyderabad, July 1993.

    Google Scholar 

  7. B. E. Prasad, G. Uma, P. Umarani, and T. S. Perraju. Control Strategy in REX. Technical Report REX/TR-6, University of Hyderabad, July 1993.

    Google Scholar 

  8. B. E. Prasad, G. Uma, P. Umarani, and T. S. Perraju. Object Oriented Data and Knowledge Representation in REX. Technical Report REX/TR-5, University of Hyderabad, July 1993.

    Google Scholar 

  9. K. Ramamritham. Real-time databases. Distributed and Parallel Databases, 1:199–226, 1993.

    Article  Google Scholar 

  10. M. Tambe, D. Kalp, and P. S. Rosenbloom. An efficient algorithm for production systems with linear-time match. In Proceedings of the 1992 IEEE Int. Conf. on Tools with AI, pages 36–43. IEEE CS Press, 1992.

    Google Scholar 

  11. M. Tambe and P. S. Rosenbloom. Investigating production system representations for non combinatorial match. Aritificial Intelligence, 68:155–199, 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Roland R. Wagner Helmut Thoma

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tolety, S.P., Garimella, U., Bandreddi E, P., Rana, S.P. (1996). Match algorithm for a real time expert system. In: Wagner, R.R., Thoma, H. (eds) Database and Expert Systems Applications. DEXA 1996. Lecture Notes in Computer Science, vol 1134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034727

Download citation

  • DOI: https://doi.org/10.1007/BFb0034727

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61656-6

  • Online ISBN: 978-3-540-70651-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics