[rules-users] nqueens or puzzle16 problems

2008-07-02 Thread Paul Fodor
Dear Sir, I am new to Drools and I wonder if any of the classic declarative problems, such as, nqueens, puzzle16 were implemented in Drools by anyone. I realize that might be hard because of the bottom-up evaluation. Regards, Paul Fodor ___ rules

[rules-users] wordnet in drools

2008-07-02 Thread Paul Fodor
Dear Sir, I am new to Drools and I wonder if anyone used WordNet from Drools. Basically, I want to make some simple joins, such as, find words that are in the same synset, all hypernyms of a word, hyponyms, meronyms of verbs, adjectives, etc. Regards, Paul Fodor

[rules-users] transitive closure

2008-07-03 Thread Paul Fodor
with attributes source and target? rule reachDirect when exists( Edge(X,Y) ) then insertLogical( new Reach(X,Y) ); end rule reachIndirect when exists( Edge(X,Z) ) exists( Reach(Z,Y) ) then insertLogical( new Reach(X,Y) ); end Regards, Paul Fodor

[rules-users] Re: transitive closure

2008-07-03 Thread Paul Fodor
On Thu, Jul 3, 2008 at 3:56 PM, Paul Fodor [EMAIL PROTECTED] wrote: Dear Sir, I am new to Drools and I want to ask how can I implement the classical transitive closure in Drools. For instance we have a bunch of facts edge/2 and the transitive closure: reach(X,Y):- edge(X,Y). reach(X,Y

[rules-users] Re: transitive closure

2008-07-03 Thread Paul Fodor
Even if the package says org.drools.examples, these files are not in the Drools examples. I am just using that package to write these files into while testing in Eclipse. On Thu, Jul 3, 2008 at 4:31 PM, Paul Fodor [EMAIL PROTECTED] wrote: On Thu, Jul 3, 2008 at 3:56 PM, Paul Fodor [EMAIL

[rules-users] Re: transitive closure

2008-07-03 Thread Paul Fodor
() { return source; } public void setTarget(String target) { this.target = target; } public String getTarget() { return target; } } } Please tell me if you have any idea. Thanks, Paul Fodor

Re: [rules-users] wordnet in drools

2008-07-08 Thread Paul Fodor
for Drools). Regards, Paul Fodor WordNetInterface_rules.drl: package drools import drools.WordNetInterface.S; import drools.WordNetInterface.G; import drools.WordNetInterface.Hyp; import drools.WordNetInterface.Mm; import drools.WordNetInterface.Ent; import drools.WordNetInterface.Sim; import

[rules-users] Negation semantics in Drools

2009-04-16 Thread Paul Fodor
attached all the sources used in these tests in the email. This example is locally stratified. I am using the latest released version of Drools. Regards, Paul Fodor win.drl: package tests; import tests.Test.Win; import tests.Test.Move; rule direct when m : Move(x : first, y : second

Re: [rules-users] Negation semantics in Drools

2009-04-16 Thread Paul Fodor
by calling either of these methods on your RuleBaseConfiguration: setProperty(drools.conflictResolver, resolver class name) or setConflictResolver(an instance of ConflictResolver) --- On Thu, 4/16/09, Paul Fodor paul.i.fo...@gmail.com wrote: From: Paul Fodor paul.i.fo...@gmail.com Subject

Re: [rules-users] Negation semantics in Drools

2009-04-17 Thread Paul Fodor
(- ?endtime_cpu ?starttime_cpu)) (printout output computing cputime: ?cputime crlf) (printout output computing walltime: ?walltime crlf) (close output) Regards, Paul Fodor. 2009/4/16 Edson Tirelli tire...@post.com Ha, thanks a lot Greg. I need new glasses... he is actually comparing

Re: [rules-users] Negation semantics in Drools

2009-04-17 Thread Paul Fodor
in the reasoning algorithm, the answer is correct. Please explain further if I am missing anything. Edson 2009/4/17 Paul Fodor paul.i.fo...@gmail.com Hi Edson, Greg, I don't think the rule is written wrong. This is how the win-nowin program is written in logic programming: X wins

Re: [rules-users] Comparison info with other engines

2009-04-17 Thread Paul Fodor
want. Regards, Paul Fodor Must Be 1)Free or inexpensive product. 2)Rules change frequently, level of effort should be minimum. 3)Multiple join condition (A rule is determined ranging from 1 to 10 data fields.) 4)Should support approximately 75 rules. Better if we have. 1)Change Rules

Re: [rules-users] Negation semantics in Drools

2009-04-17 Thread Paul Fodor
algorithm, the answer is correct. Please explain further if I am missing anything. Edson 2009/4/17 Paul Fodor paul.i.fo...@gmail.com Hi Edson, Greg, I don't think the rule is written wrong. This is how the win-nowin program is written in logic programming: X wins if there is a move from X

Re: [rules-users] Negation semantics in Drools

2009-04-17 Thread Paul Fodor
I looked in the manual and I think this was your intended behaviour for insertLogical (your approach to the best it can be done). I think it's fine. Not many programs are non locally stratified, so this is definitely good enough. Paul. On Fri, Apr 17, 2009 at 5:13 PM, Paul Fodor paul.i.fo

Re: [rules-users] Negation semantics in Drools

2009-04-17 Thread Paul Fodor
particular task differs a lot on various rule systems. Regards, Paul. Cheers, Edson 2009/4/17 Paul Fodor paul.i.fo...@gmail.com Hi Edson, The insertLogical doesn't work for non-stratified programs. For instance, in the win-nowin example, if there is a move(1,2) and a move(2,1

Re: [rules-users] Negation semantics in Drools

2009-04-17 Thread Paul Fodor
. For each feature that we tested, we tried our best to represent it in the best way for every given system. We are always open to sugestions of other banchmarks to test. Regards, Paul Just my .02c Edson 2009/4/17 Paul Fodor paul.i.fo...@gmail.com Now, I am curious. What