TREAT: a better match algorithm for AI production systems

Authors:
Daniel P. Miranker
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, Texas
Venue:
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Year:
1987

Citing 5
Cited 0

Programming expert systems in OPS5: an introduction to rule-based programming

Programming expert systems in OPS5: an introduction to rule-based programming
TREAT: a new and efficient match algorithm for AI production systems

TREAT: a new and efficient match algorithm for AI production systems
Principles of Database Systems

Principles of Database Systems
TREAT: A Better Match Algorithm for AI Production Systems; Long Version

TREAT: A Better Match Algorithm for AI Production Systems; Long Version
Parallelism in production systems

Parallelism in production systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the TREAT match algorithm for AI production systems. The TREAT algorithm introduces a new method of state saving in production system interpreters called conflict-set support. Also presented are the results of an empirical study comparing the performance of the TREAT match with the commonly assumed best algorithm for this problem, the RETE match. On five different OPS5 production system programs TREAT outperformed RETE, often by more than fifty percent. This supports an unsubstantiated conjecture made by McDermott, Newell and Moore, that the state saving mechanism employed in the RETE match, condition-element support, may not be worthwhile.