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

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

These result in successor state axioms D ss :<br />

Poss(a, s) ⊃ [Holding(x, do(a, s)) ≡<br />

a . = pickup(x) ∨ Holding(x, s) ∧ a ≠ drop(x)]<br />

Poss(a, s) ⊃ [Broken(x, do(a, s)) ≡<br />

a . = drop(x) ∨ Broken(x, s)]<br />

Poss(a, s) ⊃ [At(x, do(a, s)) ≡ a . = walk(x)∨<br />

At(x, s) ∧ ¬∃y (y ≠ x ∧ a . = walk(y))]<br />

Initial situation D S0 :<br />

∀x ¬Holding(x, S 0 ), ¬At(A, S 0 ), ¬Broken(A, S 0 )<br />

Goal: ∃s Broken(A, s)<br />

(Break A.)

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

Saved successfully!

Ooh no, something went wrong!