TREAT: A New and Efficient Match Algorithm for Artificial Intelligence Production Systems (Research Notes in Artificial Intelligence) - Softcover
Synopsis
Describes the architecture and software systems embodying the DADO machine, a parallel tree-structured computer designed to improve over serial computers comparable complexity in the execution of large expert systems implemented i production system form. Contributes a new match algorithm for execut
"synopsis" may belong to another edition of this title.
Synopsis
This work describes a new match algorithm, Treat, that has the potential to double the speed of AI expert systems written in production system form, regardless of the target architecture. Treat is presented and comparatively analyzed with the Rete match algorithm. Originally designed specifically for the Dado machine architecture, Treat can handle efficiently temporally redundant production system programs and has been shown to perform better than the best known sequential algorithm, the Rete match, even on a squential machine. The author also describes the hardware 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.
"About this title" may belong to another edition of this title.
