Pierre Carbonnelle  committed 35b5d0c Draft

Edited online

  • Participants
  • Parent commits 86a97dd

Comments (0)

Files changed (1)

 * you can assert and retract facts: {{{+ p(a)}}} 
 * you can assert logic clauses of the form {{{head <= body}}}, where head is a single predicate with one or more variables, and body is a list of predicates separated by '&' : {{{p(X) <= q(X) & R(X,Y)}}} 
 * each variable in the head must also appear in the body.  The body may include equality and comparison predicates : {{{N1 == N-1}}}, or {{{N > 0}}}
-* you can negate a predicate : {{{not(p(X))}}}
+* you can negate a predicate in the body: {{{not(p(X))}}}
 * the argument of a predicate cannot be another predicate : {{{p(q(a))}}} is not allowed
 The depth of recursion is not limited by the stack size.