Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match
Problem
C. Forgy. Artificial Intelligences, 19 (1):
17-37(1982)
Аннотация
The Rete Match Algorithm is an efficient method for comparing a large
collection of patterns to a large collection of objects. It finds
all the objects that match each pattern. The algorithm was developed
for use in production system interpreters, and it has been used for
systems containing from a few hundred to more than a thousand patterns
and objects. This article presents the algorithm in detail. It explains
the basic concepts of the algorithm, it describes pattern and object
representations that are appropriate for the algorithm, and it describes
the operations performed by the pattern matcher.
%0 Journal Article
%1 Forgy82aij
%A Forgy, Charles
%D 1982
%J Artificial Intelligences
%K algorithm fast pattern rete
%N 1
%P 17-37
%T Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match
Problem
%U http://dx.doi.org/10.1016/0004-3702(82)90020-0
%V 19
%X The Rete Match Algorithm is an efficient method for comparing a large
collection of patterns to a large collection of objects. It finds
all the objects that match each pattern. The algorithm was developed
for use in production system interpreters, and it has been used for
systems containing from a few hundred to more than a thousand patterns
and objects. This article presents the algorithm in detail. It explains
the basic concepts of the algorithm, it describes pattern and object
representations that are appropriate for the algorithm, and it describes
the operations performed by the pattern matcher.
@article{Forgy82aij,
abstract = {The Rete Match Algorithm is an efficient method for comparing a large
collection of patterns to a large collection of objects. It finds
all the objects that match each pattern. The algorithm was developed
for use in production system interpreters, and it has been used for
systems containing from a few hundred to more than a thousand patterns
and objects. This article presents the algorithm in detail. It explains
the basic concepts of the algorithm, it describes pattern and object
representations that are appropriate for the algorithm, and it describes
the operations performed by the pattern matcher.},
added-at = {2009-06-30T14:21:54.000+0200},
author = {Forgy, Charles},
biburl = {https://www.bibsonomy.org/bibtex/2d9b0a01b6983b194319995f55282647b/fredcool},
description = {Updated base references},
interhash = {26f1c32ccf8607141edb21f64a584a66},
intrahash = {d9b0a01b6983b194319995f55282647b},
issn = {0004-3702},
journal = {Artificial Intelligences},
keywords = {algorithm fast pattern rete},
number = 1,
owner = {flint},
pages = {17-37},
timestamp = {2009-06-30T17:26:22.000+0200},
title = {Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match
Problem},
url = {http://dx.doi.org/10.1016/0004-3702(82)90020-0},
volume = 19,
year = 1982
}