Dear all,
I am loading a lot of facts using "(load-facts data-filename)". Is
this the most efficient way to load a huge number of facts in Jess?
Thanks a lot,
--
Senlin Liang
To unsubscribe, send the words 'u
Hey all,
I got another question: how does JESS build indexes? Does jess always
index on some slot (say first one)? or it indexes on the whole
pattern? or it uses adaptive indexing strategies?
Does JESS also index intermediate results? what kind of indexing
strategies is used in this case?
Thank
t; wrote:
>
> I think your code is already close to ideal. It essentially does a
> breadth-first expansion over path length, using forward chaining.
>
>
> Senlin Liang wrote:
>>
>> (defrule pathRule
>> (or (edge (first ?first) (second ?seco
I want to compute the "paths through edges" using the following code:
(deftemplate edge (slot first) (slot second))
(deftemplate path(slot first) (slot second))
(defrule pathRule
(or (edge (first ?first) (second ?second))
(and (edge (first ?first) (second ?mid))
bad, but I really have no idea about
how to solve this problem in Jess more efficiently. Any help will be
appreciated.
Thanks a lot,
Senlin
On Mon, May 12, 2008 at 9:47 AM, Ernest Friedman-Hill <[EMAIL PROTECTED]>
wrote:
> On May 9, 2008, at 10:13 AM, Senlin Liang wrote:
>
> I
Dear all,
I am trying to solve the N-Queens problem using Jess. Is there a way to use
rules to make a efficient program, or I have to use functions to do the
brute force search?
I am trying to compare several systems to see which one is good at this
N-Queens problem.
Thanks,
Senlin
:30 PM, <[EMAIL PROTECTED]> wrote:
>
>> It's probably one of those things that
>> would be easier to do procedurally, since brute forcing seems to be
>> relatively straight forward.
>>
>
> Yes, although it might be slow without heuristics, i.e., s
Dear all,
I am trying to solve the puzzle 15 problem using jess, but failed to find a
good solution. Is anyone has a ready program for it?
Thanks,
Senlin
