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 650/731<br />

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

Example 9.19<br />

G = ∀a∀s[P (A, do(a, do(a ′ , s))) ∧ s . = do(B, S 0 ) ⊃<br />

∃x[P (x, s) ∧ Poss(B, do(a, s)) ∧ R(x) ∧ Q(do(B, s))]].<br />

Let P and Q be fluents, R not a fluent. Let the successor<br />

state axioms for P and Q be<br />

Poss(a, s) ⊃ [P (x, do(a, s)) ≡ Φ P (x, a, s)],<br />

Poss(a, s) ⊃ [Q(do(a, s)) ≡ Φ Q (a, s)].<br />

Then (neither Φ P nor Φ Q contain do(_ , _) terms):<br />

R[G] = ∀a∀s[Φ P (A, a, do(a ′ , s)) ∧ s . = do(B, S 0 ) ⊃<br />

∃x[P (x, s) ∧ Poss(B, do(a, s)) ∧ R(x) ∧ Φ Q (B, s)]].

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

Saved successfully!

Ooh no, something went wrong!