I think [EMAIL PROTECTED] wrote:
> Could you give an example of such a representation,
> and a clue as to how it deals with the quantifiers?
> >
As a very simple example: Let the typical assertions "p" and "q" look
like this:
(axiom p)
(axiom q)
Let implication look like
(implies p q)
Then, for instance
(defrule modus-ponens
(axiom p)
(implies p q)
=>
(assert (axiom q)))
There are a number of quantifiers built into Jess, and you can
construct others. "and" and "or" and "not" and "exists" are all built
in. In Jess 6, the universal quantifier "forall" is not built in but
it's easy to define (it actually -is- built in in Jess 7).
(defrule forall-example
(not (and (p ?x)
(not (q ?x))))
=>
"It is not true that there is a p without a corresponding q", which
means the same thing as "for all p, there is a corresponding q."
---------------------------------------------------------
Ernest Friedman-Hill
Science and Engineering PSEs Phone: (925) 294-2154
Sandia National Labs FAX: (925) 294-2234
PO Box 969, MS 9012 [EMAIL PROTECTED]
Livermore, CA 94550 http://herzberg.ca.sandia.gov
--------------------------------------------------------------------
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]
--------------------------------------------------------------------
