Thank you Ernest.
I am experimenting with the Lehigh university benchmark, where i transfer
OWL TBox into their equivalent rules in Jess, with the logical construct.
Specifically, I am using the dataset and transformations, as used in the
OpenRuleBench
Although it may be obvious to some people, I thought I'd mention
this well known lesson.
Do not load huge knowledge base into memory. This lesson is well
documented in existing literature on knowledge base systems. it's also
been discussed on JESS mailing list numerous times over the years, so
I
Thank you very much Peter for the useful information. I will definitely look
into that.
but in the context of this message, i am not loading a huge (subjective
interpretation?) knowledge base. It's 100k assertions, with the operations
taking around 400 MB.
Secondly, in my experiments, I subtracted
I think I need to see the actual test program, or otherwise we need to
get on the same page somehow. As a counter example, here's a little
program with no rules that asserts about 10,000 facts one at a time
and then retracts them. It takes 1.9 seconds (including JVM startup)
on my Macbook.
By performance of RETE what are you referring to?
There are many aspects of RETE, which one must study carefully. It's
good that you're translating RDF to OWL, but the larger question is
why use OWL/RDF in the first place? Unless the knowledge easily fits
into axioms like sky is blue or typical
