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.

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

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

Syntax of FML.<br />

The formulae for FML are generated as usual, starting from<br />

a set L p of predicate symbols, a set L v of variable symbols,<br />

a set L c of constant symbols, the quantifiers ∀ and ∃, and<br />

the set L t of terms (constants and variables). The set F ml<br />

is defined by:<br />

If t 1 , ..., t n are in L t and p is a predicate symbol of arity<br />

n, then p(t 1 , ..., t n ) is in F ml.<br />

⊤ (true) and ⊥ (false) are in F ml.<br />

If A and B are in F ml, then so are ¬A, A ∧ B, AUB,<br />

ASB, and (A).<br />

If A is in F ml and v is in L v , then ∃v.A and ∀v.A are<br />

both in F ml.

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

Saved successfully!

Ooh no, something went wrong!