TREAT a new and efficient match algorithm for AI production systems
TREAT
Otros Autores: | |
---|---|
Formato: | Libro electrónico |
Idioma: | Inglés |
Publicado: |
London, England :
Pitman Publishing
1990.
|
Edición: | 1st edition |
Colección: | Research notes in artificial intelligence.
|
Materias: | |
Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009629761106719 |
Tabla de Contenidos:
- Front Cover; Treat: A New and Efficient Match Algorithm for AI Production Systems; Copyright Page; Table of Contents; List of Figures; Acknowledgements; Abstract; Chapter 1. Introduction; 1.1 The Problem; 1.2 Outline of the Book; 1.3 Digest of Conclusions; Chapter 2. Background; 2.1 Production Systems; 2.2 Characteristics of Computer Architectures; Chapter 3. The Design of Production System Algorithms; 3.1 The Correspondence Between Production Systems and Relational Databases; 3.2 Three Issues in Parallel Production System Algorithms; 3.3 The Development of Matching algorithms
- 3.4 The Details of the RETE MatchChapter 4. TREAT: A New Match Algorithm; 4.1 The Motivation for TREAT; 4.2 Conflict Set Support; 4.3 The TREAT Algorithm; 4.4 Dynamic Ordering of the Joins; 4.5 Why TREAT is Expected to Perform Well; 4.6 Comparative Performance of TREAT and RETE on a Sequential Machine; 4.7 Conclusion; Chapter 5. The DADO Machine; 5.1 The System Architecture; 5.2 The DADO Prototypes; 5.3 Evaluation of Alternative Designs; 5.4 Programming DADO; 5.5 The EPROM Resident Kernel; 5.6 PPL/M; Chapter 6. Other Parallel AI Machines; 6.1 Semantic Net-Based Machines
- 6.2 Logic Based Machines6.3 Parallel Lisps; 6.4 Discussion; Chapter 7. The Parallel Implementation of OPS5 on DADO; 7.1 Related Parallel Production System Efforts; 7.2 Limitations of OPS5 as a Production System Model; 7.3 The Parallel Implementation of TREAT; 7.4 Expected Performance; 7.5 Parallelism and the Three Phases of the Production System Cycle; 7.6 Conclusions; Chapter 8. Conclusions and Future Research; 8.1 Ongoing and Future Research; 8.2 Conclusions; Appendix A: LISP Code for Seed Ordered TREAT; Appendix B: Implementation Outline for PM-level TREAT in PPSL; References