Rete Algorithm
Rete Algorithm is a pattern-matching algorithm used in rule-based systems that efficiently identifies rule firings by incrementally updating working memory through a directed acyclic graph structure representing partial matches.
49
Publications
4.6K
Citations
108
Authors
47
Institutions
Publications per year
2017–2026
3
Parents
49
Production Matching for Large Learning Systems
Robert B. Doorenbos · 1995 · 140 citations
Rule condition testing and action execution in Ariel
Eric N. Hanson · ACM SIGMOD Record · 1992 · 134 citations · Full text
Rule condition testing and action execution in Ariel
1992 · 116 citations
1–5 of 49
108
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 108
47
Carnegie Mellon University
Pittsburgh, United States
5 h-index
6 publications
2.8K citations
University of Florida
Gainesville, United States
3 h-index
3 publications
263 citations

University of Waterloo
Waterloo, Canada
2 h-index
4 publications
90 citations

Kobe University
Kobe, Japan
2 h-index
6 publications
105 citations
University of Southern California
Los Angeles, United States
2 h-index
3 publications
49 citations
The University of Osaka
Osaka, Japan
2 h-index
2 publications
35 citations
The University of Texas at Austin
Austin, United States
2 h-index
5 publications
534 citations

Beijing University of Posts and Telecommunications
Beijing, China
2 h-index
3 publications
34 citations
1–8 of 47
TKDE · 4 publications · 177 citations
4
h-index
Conference · 3 publications · 294 citations
3
h-index
TSE · 2 publications · 44 citations
2
h-index
2 publications · 225 citations
2
h-index
2 publications · 2.7K citations
2
h-index
1–5