| Forgy, C. L. (1982). Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19, 17--37. |
....of data. The interest in sequential data has now increased: see e.g. 1926] Our algorithm for the discovery of frequent episodes works in a generate and test manner. The testing phase is similar to matching correlation rules to the stream of incoming alarms (see e.g. the Rete algorithm [27] used by a number of expert systems) There are similarities also to string matching (e.g. 28] Matching episodes to a sequence can be seen as locating all occurrences of sub sequences, or matches of patterns with variable length don t care symbols, where the length of the occurrences is ....
C. L. Forgy, Rete: A fast algorithm for the many pattern / many object pattern match problem, Arti cial Intelligence , Vol. 19, pp. 1737, 1982.
....fuzzy rules one would expect rule2 to fire before rule3 since it has the e#ect of modifying a fuzzy set used in the antecedent of rule3. In FuzzyShell rule1 and rule2 will fire before rule3. This was accomplished by a modification to the underlying pattern matching structure or the Rete network [19]. The Rete network is a fast pattern matching facility which is commonly used to speed up rule firing in production systems [17, 19, 18] To be fair, it must be noted that when using FuzzyClips version 6.04a [1] after rule3 fires rule2 will fire. Since rule2 modifies a fact that is used by rule3, ....
....of rule3. In FuzzyShell rule1 and rule2 will fire before rule3. This was accomplished by a modification to the underlying pattern matching structure or the Rete network [19] The Rete network is a fast pattern matching facility which is commonly used to speed up rule firing in production systems [17, 19, 18]. To be fair, it must be noted that when using FuzzyClips version 6.04a [1] after rule3 fires rule2 will fire. Since rule2 modifies a fact that is used by rule3, rule3 will fire again. The end result is a set of facts in working memory that look slightly di#erent than if rule1 and rule2 had fired ....
C.L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19:17--37, 1982.
....conclusions are drawn and what procedural actions are performed not just to what is the conceptual intention of a rule or fact. From a KR viewpoint, the Jess engine is similar to the engines of several other OPS5 heritage production rule systems. It uses the Rete (Latin for net ) algorithm [7] for e#ciency in pattern matching, especially to handle updates to its working set of facts. In current work, we are developing more formal theory to characterize the production rule Rete engine algorithm in terms of the LP KR. 4 SweetJess Overall Architecture for Inferencing and Translation ....
Forgy, Charles L., "Rete: A Fast Algorithm for the Many Pattern / Many Object Pattern Match Problem", Artificial Intelligence 19(1), pp. 17-37, 1982.
....Figure 8: Grouping benefit threshold 5 Related Work Some recent research work on continual continuous queries includes [7, 3] But they are focusing on grouping of queries instead of triggers. Their continual query specifications are simpler than ours. A set of matching network structures [2, 4, 13]. have been proposed in AI production systems research. The unique data structures are used for e#cient matching and evaluating predicates in the rule conditions. In CQ systems, due to complicate data change monitoring requirements and specific architectural design, we cannot apply these ....
C.L. Forgy. RETE: A fast algorithm for the many pattern /many object pattern match problem. Artificial Intelligence 19(1): 17-37, September 1982.
....is found. Systems such as R1, which has over 4000 rules and typically deals at any given time with 500 objects each of which may have up to 125 attributes [BM84] have begun to push the limits of conventional architectures. To date, symbol level solutions have been investigated. The RETE algorithm [FORG82] is one technique for compiling the patterns (i.e. conditions) of rules into a network in order to reduce the time to test whether a rule s condition is true. But this technique has serious shortcomings when the number of objects that need to be attended to at any given time (ie, the number of ....
Forgy, C.L., (1982) "Rete: a fast algorithm for the many pattern/many object pattern match problem", Artificial Intelligence, Vol 19, No 1.
....family of languages already has a long standing history, yet many of today s production systems are still being built using an OPS language. The success of these languages can be attributed to a large extent to the matching algorithm incorporated, facilitating the development of efficient systems, [Forgy, 1982]. Although our discussion is focused on the OPS5 1anguage, the results reported apply to other members of the OPS family of programming languages as well. The paper is organized as follows. In Section 2 we briefly review the OPS5 1anguage and rule based bottom up inference systems in general, and ....
....however, efficiency is a major problem: especially the match phase of the recognize act cycle tends to become the major consumer of computing resources, even so to an unacceptable extent. To overcome this problem, efficient match algorithms have been developed, such as the Rete match algorithm, [Forgy, 1982], and the Treat algorithm, Miranker, 1987] The basic idea of these algorithms is to save and store match information for reuse, between successive iterations of the recognize act cycle of the inference engine. Reusing this information allows for the match phase of a new inference cycle to be ....
C.L. Forgy (1982). Rete: a fast algorithm for the many pattern / many object pattern match problem, Artificial Intelligence, vol. 19, pp. 17 - 37.
....with lower overheads all of which require detailed investigation. This paper reports on the results of investigating the first dimension specifically on a specialized match algorithm for unique attributes called Uni Rete. Uni Rete is a specialization of the widely used Rete match algorithm [Forgy 82] In tasks done in Soar, an integrated problem solving and learning system [Laird, Newell, and Rosenbloom 87] Uni Rete has shown up to a 10 fold speedup over Rete. This phenomenon of a simpler representation yielding a faster implementation has been observed elsewhere in computer science ....
....of Rete presented here is a novel one and aimed at readers unfamiliar with Rete. It only emphasizes those aspects of Rete necessary for our comparison between Rete and Uni Rete. Readers familiar with Rete and unique attributes may wish to skip this section. 2.1. The Rete Match Algorithm Rete [Forgy 82] is a widely used production match algorithm. There are two main optimizations in Rete: sharing and state saving. Sharing common parts of condition elements (also called conditions or CEs) in a single production or across different productions reduces the number of tests required to do match. In ....
[Article contains additional citation context not shown here]
Forgy, C. L. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19(1):17-37, 1982.
No context found.
Forgy, C. L. (1982). Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19, 17--37.
No context found.
C. L. Forgy. Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem. Artificial Intelligence, 19(1):17--37, 1982. 62
No context found.
C. Forgy, "RETE: A Fast Algorithm for the Many Pattern Many Object Pattern Match Problem", Artificial Intelligence, 19(1), Sept. 1982.
No context found.
C. Forgy. RETE: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19, 1982.
No context found.
C. L. Forgy, "Rete: A fast algorithm for the many pattern / many object pattern match problem," Artificial Intelligence, vol. 19, pp. 17--37, 1982.
No context found.
C. L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19:17--37, 1982.
No context found.
Charles Forgy. Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem. Artificial Intelegence, (19):17--37, 1982.
No context found.
Forgy, C.L. 1982. Rete: a fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19, 17-37.
No context found.
C.L. Forgy. RETE: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, pages 17-37, 19, 1982.
No context found.
Forgy, C.L.: Rete: a fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19, 17-37, 1982.
No context found.
C. L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19(1):17--37, 1982. L. Fiege et al.
No context found.
C.L. Forgy. RETE: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, pages 17--37, 19 1982.
No context found.
Forgy, C. (1982). Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19:17--37.
No context found.
Forgy, C. L. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19(1):17-37, 1982.
No context found.
C. L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19:17--37, 1982. (Ref: p. 30.)
No context found.
Forgy, C.L Rete: A Fast Algorithm for the Many Pattern/ Many Object Pattern Match Problem Artificial Intelligence 19, pp. 17-37, 1982.
No context found.
C. Forgy. RETE: a fast algorithm for the many pattern /many object pattern match problem. Artificial Intelligence, 19(1):17--37, 1982.
No context found.
C. L. Forgy. RETE: A fast algorithm for the many pattern /many object pattern matching problem. Artificial Intelligence, 19(1):17--37, 1982.
No context found.
C.L. Forgy. Rete: a fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19(1):17--37, 1982. 17
No context found.
Forgy, C.: Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19 (1982) 17--37
No context found.
C.L. Forgy. Rete: a fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19(1):17--37, 1982.
No context found.
Charles L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19(1):17--37, 1982.
No context found.
C.L. Forgy (1982), "Rete: a fast algorithm for the many pattern/many object pattern match problem", Artificial Intelligence, Vol. 19, pp 17-- 37.
No context found.
C. Forgy. Rete: A Fast Algorithm for the Many Pattern - Many Object Pattern Match Problem. Artificial Intelligence, 19(1), 1982.
No context found.
Forgy, C.L.: Rete: a fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19, 17-37, 1982.
No context found.
Charles L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19(1):17--37, 1982.
No context found.
Forgy, C.L Rete: A Fast Algorithm for the Many Pattern/ Many Object Pattern Match Problem Artificial Intelligence 19, 1982
No context found.
Charles L. Forgy. Rete: A fast algorithm for the many pattern many object pattern match problem. Artificial Intelligence 19 (1982), 17-37.
No context found.
C. L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern matching problem. Arti cial Intelligence, 19:17-37, 1982.
No context found.
C. L. Forgy, "RETE: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem," Artificial Intelligence 19, pp. 17--37, 1982.
No context found.
C. L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19(1):17--37, 1982. L. Fiege et al.
No context found.
C. L. Forgy. Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem. In Artificial Intelligence, volume 19, pages 17--37, 1982.
No context found.
Forgy, C.L Rete: A Fast Algorithm for the Many Pattern/ Many Object Pattern Match Problem Artificial Intelligence 19, pp. 17-37, 1982.
No context found.
Forgy, C., "Rete: A fast algorithm for the many pattern/many object pattern match problem," Artificial Intelligence, vol. 19, pp. 17--37, September 1982.
No context found.
C.L. Forgy. Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem. Arti cial Intelligence, 19:17-37, 1982.
No context found.
C. Forgy. Rete: A fast algorithm for the many pattern/many object pattern matching problem. Artificial Intelligence, 19:17--37, 1982.
No context found.
C.L. Forgy. RETE: A fast algorithm for the many pattern/many object pattern matching problem. Artificial Intelligence, 19:17--37, 1982.
No context found.
Forgy, C., L.: Rete: a fast Algorithm for the many pattern/many object pattern match problem. Arti cial Intelligence, 19, 17-37 (1982)
No context found.
C.L. Forgy. Rete: a fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19(1):17--37, September 1982.
No context found.
Forgy, C.L Rete: A Fast Algorithm for the Many Pattern/ Many Object Pattern Match Problem Arti cial Intelligence 19, 1982
No context found.
C. L. Forgy. Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem. Artificial Intelligence, 19(1):17--37, 1982. 62
No context found.
Charles L. Forgy. "Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem". Artificial Intelligence, 19(1):17--37, 1982. 16
No context found.
C. L. Forgy, `RETE: a fast algorithm for the many patterns/many object pattern match problem', Artificial Intelligence, 19, 17--37 (1982).
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC