Editing Rete algorithm (section)

===Rete II===
In the 1980s, [[Charles Forgy]] developed a successor to the Rete algorithm named '''Rete II'''.<ref>[http://www.pst.com/reteII.html RETE2] from Production Systems Technologies</ref> Unlike the original Rete (which is public domain) this algorithm was not disclosed. Rete II claims better performance for more complex problems (even orders of magnitude<ref>[http://www.pst.com/clipsr2_benchmark.html Benchmarking CLIPS/R2] from Production Systems Technologies</ref>), and is officially implemented in CLIPS/R2, a C/++ implementation and in OPSJ, a Java implementation in 1998.  Rete II gives about a 100 to 1 order of magnitude performance improvement in more complex problems as shown by KnowledgeBased Systems Corporation<ref>[http://www.kbsc.com KBSC]</ref> benchmarks.

Rete II can be characterized by two areas of improvement; specific optimizations relating to the general performance of the Rete network (including the use of hashed memories in order to increase performance with larger sets of data), and the inclusion of a [[backward chaining]] algorithm tailored to run on top of the Rete network.  Backward chaining alone can account for the most extreme changes in benchmarks relating to Rete vs. Rete II. Rete II is implemented in the commercial product Advisor from FICO, formerly called Fair Isaac <ref>{{Cite web |url=http://dmblog.fico.com/2005/09/what_is_rete_ii.html |title=What is Rete III? - Decision Management Blog |access-date=2014-08-05 |archive-date=2014-08-08 |archive-url=https://web.archive.org/web/20140808061650/http://dmblog.fico.com/2005/09/what_is_rete_ii.html |url-status=dead }}</ref>

Jess (at least versions 5.0 and later) also adds a commercial backward chaining algorithm on top of the Rete network, but it cannot be said to fully implement Rete II, in part due to the fact that no full specification is publicly available.