Artificial Intelligence
Programming expert systems in OPS5: an introduction to rule-based programming
Programming expert systems in OPS5: an introduction to rule-based programming
SOAR: an architecture for general intelligence
Artificial Intelligence
Parallel implementation of OPS5 on the encore multiprocessor: results and analysis
International Journal of Parallel Programming
TREAT: a new and efficient match algorithm for AI production systems
TREAT: a new and efficient match algorithm for AI production systems
Extracting implicit information from free text technical reports
Information Processing and Management: an International Journal
Parallelism in Production Systems
Parallelism in Production Systems
Data Structures and Algorithms
Data Structures and Algorithms
Modeling ground soldier situational awareness for constructive simulation with rules
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
TREE is an optimized RETE-like pattern-matching algorithm. It has been designed for a production system whose restricted data formalism leads to a highly combinatorial join step like in SOAR. TREE aims at reducing the join search spaces without using hashing techniques. Its join strategy uses constraint propagation to define the solution space of a join, then a constraint relaxation to determine the index to be used in the join computation. Constraint relaxation is heuristic driven and based on the relational paradigm. Unlike RETE, the indexing scheme TREE requires is not based on the membership of condition elements but on the sharing of references to symbols. On the basis of experimental evidence, TREE'S strategy showed better results than the standard RETE one. The number of comparisons during join steps has been reduced by a factor ranging from 1 to nearly two orders of magnitude.