Yes, that's what Drools and other forward chaining inference engines do.<br><br>People have found <a href="http://www.jessrules.com/jess/docs/PropPred.pdf">http://www.jessrules.com/jess/docs/PropPred.pdf</a> helpful. Even though the syntax isn't Drools, you shouldn't have any problems following this monograph.<br>
<br>-W<br><br><br><div class="gmail_quote">On Mon, Oct 26, 2009 at 1:01 PM, dbrownell83 <span dir="ltr"><<a href="mailto:dbrownell83@hotmail.com">dbrownell83@hotmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<br>
Hi,<br>
<br>
I am new to Drools, so this might be an obvious 'yes' answer...<br>
<br>
I see that DRL uses "first order predicate logic" for its syntax.<br>
That is, it models things like "For all X, such that Y, do Z"<br>
<br>
Am I correct that as long as some data in the knowledge session matches the<br>
'when' conditions, it will run the 'then' consequence?<br>
<br>
Is that how it works? Is this basically what the Rete algorithm does?<br>
<br>
Thanks<br>
<font color="#888888"><br>
<br>
<br>
--<br>
View this message in context: <a href="http://www.nabble.com/Predicate-Logic-rule-binding-clarification-tp26058455p26058455.html" target="_blank">http://www.nabble.com/Predicate-Logic-rule-binding-clarification-tp26058455p26058455.html</a><br>
Sent from the drools - user mailing list archive at Nabble.com.<br>
<br>
_______________________________________________<br>
rules-users mailing list<br>
<a href="mailto:rules-users@lists.jboss.org">rules-users@lists.jboss.org</a><br>
<a href="https://lists.jboss.org/mailman/listinfo/rules-users" target="_blank">https://lists.jboss.org/mailman/listinfo/rules-users</a><br>
</font></blockquote></div><br>