I embedd CLIPS into my native application with multiple facts (sensor values) and rules.
For now I execute the rule engine via Run(rule_env, -1);
after every fact modification. Facts will be modified if sensor values of the native environment change.
The application works seemless. For the reason that I also write my thesis about this project I'm wondering if there are any metrics about the performance values and used algorithms.
Is it true that is makes use of the rete algorithm?
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
I embedd CLIPS into my native application with multiple facts (sensor values) and rules.
For now I execute the rule engine via
Run(rule_env, -1);after every fact modification. Facts will be modified if sensor values of the native environment change.
The application works seemless. For the reason that I also write my thesis about this project I'm wondering if there are any metrics about the performance values and used algorithms.
Is it true that is makes use of the rete algorithm?
CLIPS uses the rete algorithm. The waltz and manners benchmarks have been used in the past for benchmarks rule-based languages. You can find implementations of these for CLIPS here: https://sourceforge.net/p/clipsrules/code/HEAD/tree/branches/63x/examples/