Hi,
If all you need is some backtracking inference, why don't you do it with
Prolog? It would be much simpler...
Jess also supports backtracking, but it is much better as a forward
chaining engine.
Henrique
Patrick Herber wrote:
Hello,
I'm a newbie in JESS and rule engines in general (I'm finishing jet the book
'JESS in action').
I would like to use Jess for the following "PKI" problem.
Given the following statements:
Cert(A,X) : "A" certifies that the key "X" is authentic
Trust(A,X): "A" believes that "X" is trustworthy for issuing certificates
Inside a web of trust is for an entity "A" the public key "X" authentic when
the following condition is satisfied:
Cert(A,X)
or if it can be derived by the application of the following two interference
rules:
for each Y,Z: Cert(A,Y) and Trust(A,Y) and Cert(Y,Z) => Then: Cert(A,Z)
and
for each Y,Z: Cert(A,Y) and Trust(A,Y) and Trust(Y,Z) => Then: Trust(A,Z)
I thought I could simply specify my facts as
(cert "Alice" "Bob")
(cert "Alice" "Bill")
(cert "Bob" "Georg")
(trust "Alice" "Bob")
..
Now I would like to implements the two given rules in order to be able to
ask question like: "certifies Alice Georg?", hoping that JESS would perform
all the backtracking search, which otherwise I would have to implement with
very long (and inelegant) java code.
Could you kindly give me some hints for implementing them?
Thanks a lot for your help!
Regards,
Patrick
--------------------------------------------------------------------
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]
--------------------------------------------------------------------
