
- 160 pages
- English
- PDF
- Available on iOS & Android
About this book
TREAT: A New and Efficient Match Algorithm for AI Production Systems describes the architecture and software systems embodying the DADO machine, a parallel tree-structured computer designed to provide significant performance improvements over serial computers of comparable hardware complexity in the execution of large expert systems implemented in production system form. This book focuses on TREAT as a match algorithm for executing production systems that is presented and comparatively analyzed with the RETE match algorithm. TREAT, originally designed specifically for the DADO machine architecture, handles efficiently both temporally redundant and non-temporally redundant production system programs. This publication is suitable for developers and specialists interested in match algorithms for AI production systems.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- 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
- Chapter 2. Background
- Chapter 3. The Design of Production System Algorithms
- Chapter 4. TREAT: A New Match Algorithm
- Chapter 5. The DADO Machine
- Chapter 6. Other Parallel AI Machines
- Chapter 7. The Parallel Implementation of OPS5 on DADO
- Chapter 8. Conclusions and Future Research
- Appendix A: LISP Code for Seed Ordered TREAT
- Appendix B: Implementation Outline for PM-level TREAT in PPSL
- References