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

9. Agents based on FOL 3. Successor State Axioms<br />

(1) : fragile(x, s) −→ broken(x, do(drop(r, x), s))<br />

(1 ′ ) : nextto(b, x, s) −→ broken(x, do(explode(b), s))<br />

(2) : −→ ¬broken(x, do(repair(r, x), s))<br />

We assume these are all possibilities for broken, ¬broken.<br />

Then (1), (1 ′ ) are equivalent to<br />

∃r (a . = drop(r, x) ∧ fragile(x, s))∨<br />

∃b (a . = explode(b) ∧ nextto(b, x, s))<br />

−→<br />

broken(x, do(a, s)).<br />

(2) is equivalent to<br />

∃r a . = repair(r, x) −→ ¬broken(x, do(a, s))

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

Saved successfully!

Ooh no, something went wrong!