I am testing several systems including Jess. I programmed it in Yap in a similar procedural way, since there is no easy way to implement it in prolog back-tracking systems, while this problem can be solved easily by constraint programming systems like DLV.
I know the above procedural program is 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 tried the brute force procedure search with a maximal depth limit, it is >> really slow. while in other systems (like yap)it much faster. >> >> > There's no earthly reason why you'd write a big procedural program like > this in Jess; that's just not what it's for. > > > --------------------------------------------------------- > Ernest Friedman-Hill > Informatics & Decision Sciences Phone: (925) 294-2154 > Sandia National Labs FAX: (925) 294-2234 > PO Box 969, MS 9012 [EMAIL PROTECTED] > Livermore, CA 94550 http://www.jessrules.com > > > > > > -------------------------------------------------------------------- > To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]' > in the BODY of a message to [EMAIL PROTECTED], NOT to the list > (use your own address!) List problems? Notify [EMAIL PROTECTED] > -------------------------------------------------------------------- > > -- Senlin Liang
