Multiagent Systems

Prof. Dr. Jürgen Dix · Department of Informatics, TUC Multiagent Systems, WS 06/07 457/731
6. Propositional Logic 4. Calculi for SL
It is well-known, that any formula φ can be
written as a conjunction of disjunctions
n∧ ∨m i
i=1 j=1
φ i,j
The φ i,j are just constants or negated constants.
The n disjunctions ∨ m i
j=1 φ i,j are called clauses of
φ.
Normalform
Instead of working on arbitrary formulae, it is
sometimes easier to work on finite sets of
clauses.