27.01.2014 Views

Multiagent Systems

Multiagent Systems

Multiagent Systems

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

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

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

We need exactly<br />

2 × #actions × #fluents<br />

Suppose we are given axioms of the form<br />

. . . −→ fluent(x, do(action, s))<br />

. . . −→ ¬fluent(x, do(action, s)),<br />

How can we compute the successor state axioms<br />

automatically?<br />

Note, that the above set assumes implicitly that all actions<br />

can be applied: this is an overly optimistic assumption<br />

according to the Qualification Problem.

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

Saved successfully!

Ooh no, something went wrong!