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
to a solution.
providing concrete examples of what your doing will likely get better
advice than making general statements.
On Thu, Jun 9, 2011 at 12:17 PM, Md Oliya md.ol...@gmail.com wrote:
Thank you very much Peter for the useful information. I will definitely
look
this particular case.
On Jun 5, 2011, at 3:18 PM, Md Oliya wrote:
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
recommend reading Gary Riley's book on expert
systems to avoid repeating a lot of mistakes that others have already
documented.
On Thu, Jun 9, 2011 at 11:41 AM, Md Oliya md.ol...@gmail.com wrote:
Thank you Ernest.
I am experimenting with the Lehigh university benchmark, where i transfer
OWL
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
Hi,
I am doing some experiments with regards to truth maintenance.
Assume that I have a rule like:
(defrule simpleRule (aaa) =(bbb))
Asserting an (aaa) fact and (run)ning the rule will result in a new fact
(bbb).
Nevertheless, retracting (aaa) will not retract (bbb) as well, and I found
it
has the
logical conditional element to specify dependencies among facts, and it
can be used to easily implement your example below:
(defrule simpleRule
(logical (aaa))
=
(bbb))
It's discussed on pages 114-116 of Jess in Action.
On Jun 3, 2011, at 7:33 AM, Md Oliya wrote
