On 14 September 2010 17:47, Mark Proctor <span dir="ltr"><<a href="mailto:mproctor@codehaus.org">mproctor@codehaus.org</a>></span> wrote:<br>
<div class="gmail_quote"><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<div bgcolor="#ffffff" text="#000000">
Here is another project proposal, this time simpler. I think this
one has Wolfgang's name on it ;)<br>
</div></blockquote><div><br>
I don't recall having proposed anything relating to this?<br>
<br>
My last proposal was making FOL quantifier result "false" non-blocking
for LHS evaluation and accessible through a binding variable. As this is
now public, I asked around for opinions on my <a href="http://members.inode.at/w.laun/drools/EnhancingFOL.pdf">short paper</a>, and here is one comment, which I interpret to be positive and encouraging:<br>
<br>
<quote><br>
It seems to me that the most powerful new concept here is the ability
to directly combine Boolean statements about WMEs with Boolean
statements about other quantities in the same expression, at the same
level -- i.e., to be able to directly express "(some WME exists) ||
f(x) == 3", <i>which is awkward at best in most rule languages</i>.<br>
</quote><br>
</div></div>(Emphasis added by me.)<br>
<br>
Cheers<br>
Wolfgang