1990 TREATANewandEfficientMatchAlgor

Subject Headings: Production Computing System, DIDO Machine, TREAT Algorithm, RETE Match Algorithm.

Notes

Due to the dramatic increase in computing power and the concomitant decrease in computing cost that has occurred over the last decade, many researchers attempting to design computing systems to solve complicated problems or execute tasks that have in the past been performed by human experts. The focus of Knowledge Engineering is the construction of such complex “expert system programs. This book will describe the architecture and the 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 of expert systems implemented in production system form. The central contribution of this book is a new match algorithm for executing production systems. TREAT, that will be presented and comparatively analyzed with the RETE match algorithm. TREAT, originally designed specifically for the DIDO machine architecture can handle efficiently both temporally redundant and nontemporally redundant production system programs. Although the development of the algorithm was motivated by the inadequacies of the parallel versions of existing production system algorithms, it is shown that the TREAT algorithm performs better than the best known sequential algorithm, the RETE match, even on a sequential machine.

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
1990 TREATANewandEfficientMatchAlgor	Daniel P. Miranker			TREAT: A New and Efficient Match Algorithm for AI Production Systems						1990