I have started to work on implementing Moana key functional primitives in OCaml.
The code is available on github here.
.png)
My last commit included implementation of the join AM BM function which binds the tuples available in AM with the intermediate "solution" tuples in the BM. The concepts are taken from the RETE algorithm. However, unlike RETE this is still a "static system". By that I mean that join operations are performed on pre-populated AMs.
RETE's left/right activations allow for a more dynamic system. The idea is that each time a new tuple is added to an AM right activation is performed which triggers left activation from the BM, a sequence of these activation will lead to a new result in the newly created final BM.
This is my next step...along with writing more unit tests and fixing existing bugs. If you have any cool ideas on how to take MoanaML further feel free to contribute and Pull Request.
The code is available on github here.
RETE's left/right activations allow for a more dynamic system. The idea is that each time a new tuple is added to an AM right activation is performed which triggers left activation from the BM, a sequence of these activation will lead to a new result in the newly created final BM.
This is my next step...along with writing more unit tests and fixing existing bugs. If you have any cool ideas on how to take MoanaML further feel free to contribute and Pull Request.
No comments:
Post a Comment