11, 2011 8:20 AM
To: jess-users@sandia.gov
Subject: Re: JESS: On the Performance of Logical Retractions
On Jun 11, 2011, at 6:11 AM, Oliya wrote:
But still I have a question: what type of truth maintenance is
supported in Jess? Can you provide links to more information please
: Saturday, June 11, 2011 8:20 AM
To: jess-users@sandia.gov
Subject: Re: JESS: On the Performance of Logical Retractions
On Jun 11, 2011, at 6:11 AM, Oliya wrote:
But still I have a question: what type of truth maintenance is
supported in Jess? Can you provide links to more information please
On Jun 11, 2011, at 6:11 AM, Oliya wrote:
But still I have a question: what type of truth maintenance is
supported in Jess? Can you provide links to more information please.
The logical conditional element is the only form of truth
maintenance in Jess. I thought you said you were
I meant more information on details of implementation, or the algorithm
used.
On Sat, Jun 11, 2011 at 8:19 PM, Ernest Friedman-Hill ejfr...@sandia.govwrote:
On Jun 11, 2011, at 6:11 AM, Oliya wrote:
But still I have a question: what type of truth maintenance is supported
in Jess? Can you
@Peter: I werent interested to plug into Rete at first place, neither
had should I use RETE or how does RETE perform in mind. Rather, I was
trying to find a solution for my problem at hand, and the more and more i
developed my own solution, i found it to be more and more similar to the
Rete. So I
I've looked at OpenRuleBench in the past and I just looked at it again
real quick.
The way the test was done is the wrong way to use a production rule
engine. That's my bias opinion. I understand the intent was to measure
the performance with the same data, and similar rules. The point I'm
trying
Yeah, I just had a look too, and I think the report on their site says
it all. Jess and Drools are at the bottom of their performance results
for a reason -- because they're being misapplied. If your problem
looks like the kinds of problems they're benchmarking, then by all
means use one
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
Hi to all, i need help please. How can i import the jess class Rete in java
application?
thanks for help
From: Ernest Friedman-Hill ejfr...@sandia.gov
To: jess-users@sandia.gov
Sent: Mon, June 6, 2011 1:37:16 PM
Subject: Re: JESS: On the Performance
Friedman-Hill ejfr...@sandia.gov
*To:* jess-users@sandia.gov
*Sent:* Mon, June 6, 2011 1:37:16 PM
*Subject:* Re: JESS: On the Performance of Logical Retractions
I don't think there's a particular reason in general. Retracting a fact
takes only a little longer than asserting one, on average
I don't think there's a particular reason in general. Retracting a
fact takes only a little longer than asserting one, on average. But if
we assume liberal use of logical, retracting a single fact could
result in a sort of cascade effect whereby retracting a single fact
would result in
Hi,
I am doing some experiments with a set of rules which contain the logical
CE.
I intend to see the performance of Jess on a set of assertions as well as
retractions.
After some experiments, I found that the runtime for assertions is much less
than that of retractions.
In fact, the performance
16 matches
Mail list logo
