Editing Rete algorithm (section)

{{Short description|Pattern matching algorithm}}
{{More citations needed|date=March 2018}}
The '''Rete algorithm''' ({{IPAc-en|ˈ|r|iː|t|iː}} {{respell|REE|tee}}, {{IPAc-en|ˈ|r|eɪ|t|iː}} {{respell|RAY|tee}}, rarely {{IPAc-en|ˈ|r|iː|t}} {{respell|REET}}, {{IPAc-en|r|ɛ|ˈ|t|eɪ}} {{respell|reh|TAY}}) is a [[pattern matching]] [[algorithm]] for implementing [[rule-based system]]s. The algorithm was developed to efficiently apply many [[Rule of inference|rules]] or patterns to many objects, or [[fact]]s, in a [[knowledge base]]. It is used to determine which of the system's rules should fire based on its data store, its facts. The Rete algorithm was designed by [[Charles Forgy|Charles L. Forgy]] of [[Carnegie Mellon University]], first published in a working paper in 1974, and later elaborated in his 1979 Ph.D. thesis and a 1982 paper.<ref>{{cite journal |last=Charles |first=Forgy |author-link=Charles Forgy |title=Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem |journal=[[Artificial Intelligence (journal)|Artificial Intelligence]] |date=1982 |volume=19 |pages=17–37 |doi=10.1016/0004-3702(82)90020-0}}</ref>