On Jul 26, 2007, at 5:16 AM, Ksawi wrote:
Hello!
I develop an application with backward chain reasoning. I have some
questions:
1. When engine is running, and if it finds a need-xxx fact, then it
stops. However, I know, there are more answers in a knowledge base.
Is there any way to get all answers? Why does it stop? For example:
in Prolog after finding a first fact it states a question: search
more or no?
need-X facts are intended to be matched by rules you provide. Those
rules should assert all relevant facts.
2. Why couldn't I use funcalls in backward chain reasoning? What is
a reason for that ? I know I could use a function test but I wanted
to do it in a traditional way (like in forward reasoning: ?x&:(neq ?
z ?x))
Because of the very simple mechanism that Jess uses for backward
chaining. There's no way for the function call to be represented in
the need-X fact, so there would be no way for your need-X rules to
act on it.
3. Is there any article or something about backward chaining in
Jess? I would like to learn more about it (I read manual). Which
algorithm is used and how it looks like?
The manual actually describes the whole technique that Jess uses to
emulate backward chaining. It's a very simple thing.
Thanks!
--
Regards!, Ksawi,
PUT, www.put.poznan.pl
---------------------------------------------------------
Ernest Friedman-Hill
Advanced Software Research 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]
--------------------------------------------------------------------
