Yes, that's what Drools and other forward chaining inference engines do.

People have found http://www.jessrules.com/jess/docs/PropPred.pdf helpful. Even though the syntax isn't Drools, you shouldn't have any problems following this monograph.

-W


On Mon, Oct 26, 2009 at 1:01 PM, dbrownell83 <dbrownell83@hotmail.com> wrote:

Hi,

I am new to Drools, so this might be an obvious 'yes' answer...

I see that DRL uses "first order predicate logic" for its syntax.
That is, it models things like "For all X, such that Y, do Z"

Am I correct that as long as some data in the knowledge session matches the
'when' conditions, it will run the 'then' consequence?

Is that how it works?  Is this basically what the Rete algorithm does?

Thanks



--
View this message in context: http://www.nabble.com/Predicate-Logic-rule-binding-clarification-tp26058455p26058455.html
Sent from the drools - user mailing list archive at Nabble.com.

_______________________________________________
rules-users mailing list
rules-users@lists.jboss.org
https://lists.jboss.org/mailman/listinfo/rules-users