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

9. Agents based on FOL 5. (Concurrent-) MetaTeM<br />

Temporal formulae can be classified as follows.<br />

state-formula: is either a literal or a boolean combination<br />

of other state-formulae.<br />

Strict future-time:<br />

If A and B are either state or strict<br />

future-time formulae, then A UB is a strict<br />

future-time formula.<br />

If A and B are strict future-time formulae,<br />

then ¬A, A ∧ B, and (A) are strict<br />

future-time formulae.<br />

Strict past-time: past-time duals of strict future-time<br />

formulae.<br />

Non-strict: include state-formulae in their definition.

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

Saved successfully!

Ooh no, something went wrong!