Caching argument values in pattern-matching networks

Details Caching argument values in pattern-matching networks Caching argument values in pattern-matching networks

1988-09-07

1989-11-21

MacDonald, Allen

Boots, shoes, and leggings

364200, 3642766, G06F 1518

Patent

active

048826910

ABSTRACT:
In a pattern-matching network, such as a RETE, elapsed time for successive pattern matching operations is reduced by selectively priming predetermined ones of pattern-matching nodes, such as beta nodes, by caching stabilized computed delta input or argument values derived from ones of the predecessor nodes that appear not to change during the conduct of one of the tests in the node. The computed argument value caching occurs in an argument storing portion of any test to be conducted using a cached argument value. At any node, different tests may or may not be able to used cached argument values.

REFERENCES:
patent: 4837735 (1989-06-01), Allen, Jr. et al.
Forgy "RETE: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem"; Artificial Intelligence, vol. 19 pp. 17-37, North Holland 1982.
rownstone, Efficiency in OPS5 pp. 228-239, Addison-Wesley 1985.
Schor et al "Advances in RETE Pattern Matching" Science, pp. 226-232 Proceedings of 1986 American Association for Artifial Intellegience 1986.

Affiliated with

Also associated with

Rating

Caching argument values in pattern-matching networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Caching argument values in pattern-matching networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Caching argument values in pattern-matching networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1429778