It is my understanding (correct me if I am wrong), it is not possible to
define a rule in which the LHS is a combination of facts ORed together.
It is quite easy to write functions for this problem, however, writing
functions on the LHS can produce performance problems. One of our
proposed solutions is to generate multiple rules, one for each
sub-expression that is ORed together. These sub-expression rules will
assert a "sub-expression" fact that will be checked for by a rule that
has the RHS for the complete expression. This is fine, and it performs
better, except I do believe that I am trying to re-invent the wheel.
Because multiple rules have similar sub-expressions, in order to perform
better, I would need to recognize these similarities, and combine them
with each other to form sub-expressions so that they do not get
evaluated multiple times. This is exactly what JESS is suppose to do,
right? My question is: is there a better way to do this in JESS?
Thanks in advance..
Blaine
---------------------------------------------------------------------
To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]'
in the BODY of a message to [EMAIL PROTECTED], NOT to the
list (use your own address!) List problems? Notify [EMAIL PROTECTED]
---------------------------------------------------------------------
