Multiagent Systems

Prof. Dr. Jürgen Dix · Department of Informatics, TUC Multiagent Systems, WS 06/07 606/731
9. Agents based on FOL 1. First Order Logic (FOL)
Definition (continued)
Now we define inductively the logical value of a formula
ϕ in A:
1. if ϕ = def P k (t 1 , . . . , t k ) with the terms t 1 , . . . , t k and the
k-dimensional predicate symbol P k , then
{
true, if (A(t1 ), . . . , A(t
A(ϕ) = k )) ∈ P A ,
def
false, else.
2. if ϕ = def ¬ψ, then
{
true,
A(ϕ) = def
false,
3. if ϕ = def (ψ ∧ η), then
{
true,
A(ϕ) = def
false,
if A(ψ) = false,
else.
if A(ψ) = true and A(η) = true,
else.