|
|
Literal
| Description: |
A literal is a special first order logic formula, whether a so called atom, or a
negated atom. Atoms are formulas consisting of exactly one predicate symbol,
followed by a tuple of logical terms. So atoms are the most simple formulas, all more
complex formulas are build of.
Examples of literals:
- P(X, Y, c)
- ¬P(X, Y, c)
- P(f(X,c), Y, d)
- ¬ P(f(X,c), Y, d)
with P being a predicate symbol of arity 3,
X and Y being variables,
c and d being constant symbols,
f being a function symbol of arity 2,
and ¬ denoting negation. |
|
|
