> Rete algorithm (/ˈriːtiː/ REE-tee or /ˈreɪtiː/ RAY-tee, rarely /ˈriːt/ REET or /rɛˈteɪ/ re-TAY)

I guess we all can at least agree that there is a way to pronounce it :)

The first two forms are more correct, but the last two sound better. I say 'REET networks', so that's almost certainly wrong.

The name seems to come from Latin and courtesy to my native Romanian aka "Slavicized Latin", it should be pronounced: reh-teh, short sounds for both syllables.

Of course, since now it's a loanword in English, you could also just use English rules for pronouncing it (whichever those are :) ).

Thanks - I'll try it out. You're correct that the term comes directly from Latin.

Is there something more general?

What do you mean by more general? Data in nodes in the RETE algorithm can be anything.

I highly recommend reading "Production Matching for Large Learning Systems"[0] as it was accessible enough for me to try to make a basic RETE implementation while learning C++ and playing around with several other technologies I was unfamiliar with[1].

[0]http://reports-archive.adm.cs.cmu.edu/anon/1995/CMU-CS-95-11...

[1]https://github.com/cjslep/cpp-rete-prototype (awful, abandoned prototype)

I've wondered about this as well. I'd want to cover ZDDs in addition to Rete (forward and back chaining).

https://en.wikipedia.org/wiki/Zero-suppressed_decision_diagr...