Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
TREAT: a new and efficient match algorithm for AI production systemsJanuary 1990
Publisher:
  • Morgan Kaufmann Publishers Inc.
  • 340 Pine Street, Sixth Floor
  • San Francisco
  • CA
  • United States
ISBN:978-0-934613-71-2
Published:03 January 1990
Pages:
143
Skip Bibliometrics Section
Reflects downloads up to 06 Jan 2025Bibliometrics
Abstract

No abstract available.

Cited By

  1. Reilly S, Niehaus J and Weyhrauch P Modeling ground soldier situational awareness for constructive simulation with rules Proceedings of the Winter Simulation Conference, (1431-1443)
  2. Schmedding F, Sawas N and Lausen G Adapting the rete-algorithm to evaluate F-logic rules Proceedings of the 2007 international conference on Advances in rule interchange and applications, (166-173)
  3. Schmedding F, Sawas N and Lausen G Adapting the Rete-Algorithm to Evaluate F-Logic Rules Advances in Rule Interchange and Applications, (166-173)
  4. Cong C and Hunger A A self-adaptable inference engine Proceedings of the 4th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering Data Bases, (1-6)
  5. Jin C, Carbonell J and Hayes P ARGUS Proceedings of the 15th international conference on Foundations of Intelligent Systems, (142-151)
  6. ACM
    Krishnamurthy E, Murthy V and Krishnamurthy V Biologically inspired rule-based multiset programming paradigm for soft-computing Proceedings of the 1st conference on Computing frontiers, (140-149)
  7. Lee Y and Cheng A (2004). Optimizing Real-Time Equational Rule-Based Systems, IEEE Transactions on Software Engineering, 30:2, (112-125), Online publication date: 1-Feb-2004.
  8. ACM
    Obermeyer L and Miranker D Evaluating triggers using decision trees Proceedings of the sixth international conference on Information and knowledge management, (144-150)
  9. Amaral J and Ghosh J (1996). A Concurrent Architecture for Serializable Production Systems, IEEE Transactions on Parallel and Distributed Systems, 7:12, (1265-1280), Online publication date: 1-Dec-1996.
  10. Doorenbos R Combining left and right unlinking for matching a large number of learned rules Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (451-458)
  11. Barachini F (1994). Frontiers in Run‐Time Prediction for the Production‐System Paradigm, AI Magazine, 15:3, (47-61), Online publication date: 1-Sep-1994.
  12. ACM
    Brant D and Miranker D Index support for rule activation Proceedings of the 1993 ACM SIGMOD international conference on Management of data, (42-48)
  13. ACM
    Brant D and Miranker D (1993). Index support for rule activation, ACM SIGMOD Record, 22:2, (42-48), Online publication date: 1-Jun-1993.
  14. Doorenbos R Matching 100,045 learned rules Proceedings of the eleventh national conference on Artificial intelligence, (290-296)
  15. Miranker D and Lofaso B (2018). The Organization and Performance of a TREAT-Based Production System Compiler, IEEE Transactions on Knowledge and Data Engineering, 3:1, (3-10), Online publication date: 1-Mar-1991.
  16. Brant D, Grose T, Lofaso B and Miranker D Effects of Database Size on Rule System Performance Proceedings of the 17th International Conference on Very Large Data Bases, (287-296)
Contributors
  • Capsenta Inc.

Reviews

Adina Magda Florea

Miranker investigates the applicability of parallel computation to rule-based systems. He describes the architecture and software systems of the DADO machine, a parallel tree-structured computer designed to improve the performance of large production systems, and TREAT, a new match algorithm for implementing the OPS5 rule-based programming language on such a machine. The first two chapters contain background information about production systems and the OPS5 language as well as a taxonomy of parallel computers. Chapter 3 details algorithmic aspects of production system interpreters, particularly as they relate to parallelism, from three perspectives: low-level matching, rule partitioning, and synchronization. The chapter focuses on low-level matching and describes the RETE match algorithm, considered to be the best algorithm for the sequential execution of production systems. Chapter 4 presents the TREAT match algorithm in detail; its development is motivated by the inadequacies of the parallel versions of existing algorithms, in particular the RETE match, to a DADO machine. The author shows how TREAT incorporates database query optimization techniques. He presents an implementation of OPS5 using a sequential version of TREAT and concludes with a comparison of the performances of the TREAT and RETE algorithms for five benchmarks. Chapter 5 presents the DADO system architecture, a distributed-memory, medium-grained, tree-connected, parallel processor that displays good properties from the perspective of production systems requirements. It discusses the DADO software layers with special emphasis on PPL/M, a parallel superset of the PL/M language. Chapter 6 is an overview of some parallel AI machines classified by the knowledge representation method they are intended to support. The author includes some criticism of each of them. Chapter 7 presents the implementation of the parallel version of TREAT on the DADO machine, with supporting design decisions. The author highlights the capacity of TREAT to effectively induce parallelism in the associative matching of individual rules. The chapter concludes with the performance evaluation of TREAT on the DADO machine. The book is an exposition of the research embedded in the author's doctoral dissertation. Its central contribution is the design and implementation of the TREAT algorithm. Miranker provides a clear and well-structured presentation of the design decisions and lucid quantitative and qualitative evaluations of the results. He gives insights into multiple constraints and requirements of hardware and software solutions for implementing parallel production systems and compares TREAT with several related approaches; this comparison is the best feature of the book. Another virtue of the presentation is its clear-cut organization and conciseness; the conciseness and density of ideas may sometimes turn into a drawback for readers lacking the necessary background. The approach of using the database area as a source of both the terminology for explaining production rules and the optimization techniques for improving the performance of TREAT highlights the growing connection between knowledge-based systems and DBMSs. The worst feature of the document is its title, which indicates only a part of the topics presented; this drawback is easily eliminated when reading the work. Another weakness of the book is the heterogeneous level of presentation. Topics related to the author's research are presented in depth and can be fully understood only by persons with a background in AI, while other topics, such as fifth-generation computers, are treated at a general level that is superfluous for such readers. Nonetheless, the book succeeds in offering the reader a good perspective on the author's seminal research results and represents a challenge to the AI research community. The book is of primary interest to parallel computer designers and knowledge-based systems implementors, but will also appeal to knowledge engineers and database system programmers. It is of special interest for the AI specialist who wants to fill the gap between now classical sequential AI systems and parallel computer architectures. A background in databases and knowledge representation methods is required. Consulting additional material about the OPS5 language and the RETE match algorithm will help in understanding the issues covered. The physical form is pleasant and easy to read. No index is included but, due to the brevity of the book, none is required. The references are good, covering a wide area of related material, but including the year of publication in the text would have been a better decision. The material could be a good starting point for a graduate course on AI system architectures, although this was not the author's intent.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Recommendations