Re:Simplify Service Dependencies with Nodes
by adamnemecek on Saturday December 10, 2016 @04:05PM
(#13147916)
Is there something more general?
[ Parent
| on HN ]
Re:Simplify Service Dependencies with Nodes
by cjslep on Saturday December 10, 2016 @04:35PM
(#13148064)
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)
Re:Simplify Service Dependencies with Nodes
by rch on Saturday December 10, 2016 @04:34PM
(#13148054)
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...