Rete algorithm
The Rete algorithm (/ˈriːtiː/ REE-tee, /ˈreɪtiː/ RAY-tee, rarely /ˈriːt/ REET, /rɛˈteɪ/ reh-TAY) is a pattern matching algorithm for implementing rule-based systems. The algorithm was developed to efficiently apply many rules or patterns to many objects, or facts, 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 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.
- Comment
- enThe Rete algorithm (/ˈriːtiː/ REE-tee, /ˈreɪtiː/ RAY-tee, rarely /ˈriːt/ REET, /rɛˈteɪ/ reh-TAY) is a pattern matching algorithm for implementing rule-based systems. The algorithm was developed to efficiently apply many rules or patterns to many objects, or facts, 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 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.
- Depiction
- Has abstract
- enThe Rete algorithm (/ˈriːtiː/ REE-tee, /ˈreɪtiː/ RAY-tee, rarely /ˈriːt/ REET, /rɛˈteɪ/ reh-TAY) is a pattern matching algorithm for implementing rule-based systems. The algorithm was developed to efficiently apply many rules or patterns to many objects, or facts, 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 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.
- Hypernym
- Pattern
- Is primary topic of
- Rete algorithm
- Label
- enRete algorithm
- Link from a Wikipage to an external page
- drdobbs.com/184405218
- github.com/cerner/clara-rules
- reports-archive.adm.cs.cmu.edu/anon/scan/CMU-CS-79-forgy.pdf
- reports-archive.adm.cs.cmu.edu/anon/1995/CMU-CS-95-113.pdf
- www.cut-the-knot.org/classes/Last.shtml
- Link from a Wikipage to another Wikipage
- Action selection mechanism
- Algorithm
- Attribute (computing)
- Backward chaining
- Bayesian network
- BizTalk
- Business analyst
- Business rules engine
- Carnegie Mellon University
- Category:Expert systems
- Category:Pattern matching
- Charles Forgy
- CLIPS programming language
- Computer memory
- Cut-the-knot
- Cycle detection
- Daniel P. Miranker
- Data types
- Decision trees
- Directed acyclic graph
- Double negation
- Drools
- Equality (mathematics)
- Existential quantification
- Expert system
- Fact
- File:Rete.svg
- First order logic
- Forward chaining
- Fuzzy logic
- Hash table
- IBM Operational Decision Management
- If-then-else
- Inference
- Inference engine
- Jess programming language
- Knowledge base
- Leaf node
- Linked list
- Logical conjunction
- Logical connective
- Logical truth
- Naïve algorithm
- Negation as failure
- Object (computer science)
- OPS5
- Pattern matching
- Priority queue
- Probabilistic logic
- Projection (relational algebra)
- Quantification (logic)
- Root node
- Rule-based system
- Rule engine
- Rule of inference
- Selection (relational algebra)
- Soar (cognitive architecture)
- Software developer
- Table (database)
- Tibco
- Trie
- Truth maintenance systems
- Tuple
- Universal quantification
- Variable (mathematics)
- Vertex (graph theory)
- Wikt:entity
- Wiktionary:Network
- XML
- SameAs
- Algorisme Rete
- Algorithme de Rete
- Algoritmo Rete
- Algoritmo Rete
- m.01779q
- Q2002217
- Rete algorithm
- Rete-Algorithmus
- Rete-algoritme
- Reteアルゴリズム
- ufE2
- Алгоритм Rete
- Рете алгоритам
- الگوریتم تورینه
- Subject
- Category:Expert systems
- Category:Pattern matching
- Thumbnail
- WasDerivedFrom
- Rete algorithm?oldid=1105678356&ns=0
- WikiPageLength
- 36444
- Wikipage page ID
- 172566
- Wikipage revision ID
- 1105678356
- WikiPageUsesTemplate
- Template:Cite journal
- Template:IPAc-en
- Template:More citations needed
- Template:More footnotes needed
- Template:Reflist
- Template:Respell
- Template:Short description
