Construct · 1 fields · 1 citations

Rete algorithm: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Knowledge representation

a pattern matching algorithm for production rule systems that stores partial matches in a network to avoid rechecking all rules against all facts.

In knowledge representation, Rete algorithm refers to a pattern matching algorithm for production rule systems that stores partial matches in a network to avoid rechecking all rules against all facts. This meaning comes from Forgy (1982) in Artificial Intelligence.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Rete algorithm sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

forward2 fields · 2 citationsjingle · one word, two constructs intelligence6 fields · 14 citationsjingle · one name, six constructs knowledge6 fields · 12 citationsjingle · one name, six constructs

References

Forgy, C. L. (1982). Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19(1), 17-37. https://doi.org/10.1016/0004-3702(82)90020-0

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct