27.01.2014 Views

Multiagent Systems

Multiagent Systems

Multiagent Systems

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Prof. Dr. Jürgen Dix · Department of Informatics, TUC <strong>Multiagent</strong> <strong>Systems</strong>, WS 06/07 648/731<br />

9. Agents based on FOL 4. (Con-)Golog<br />

We define a regression operator R which transforms a<br />

formula of the situation calculus and reduces the nesting<br />

of do(α, do(. . .)) terms by 1.<br />

Definition 9.18 (Regression operator R)<br />

1 If A is not a fluent (incl. . =) or A = Poss(a, s),<br />

then R[A] = A<br />

2 If F is a fluent and s a situation variable or<br />

s = S 0 , then R[F (⃗t, s)] = F (⃗t, s).<br />

3 If F is a fluent with successor state axiom<br />

Poss(a, s) ⊃ [F (x 1 , . . . , x n , do(a, s)) ≡ Φ F ],<br />

then R[F (t 1 , . . . , t n , do(α, σ))] = Φ F | x 1,...,x n ,a,s<br />

t 1 ,...,t n ,α,σ .

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!