Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time...
Transcript of Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time...
![Page 1: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/1.jpg)
Multi-Agent Logics
■ Coalition Logic■ Alternating-time Logic (ATL)■ Epistemic Variants (ATEL, ATEL-A)
259
![Page 2: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/2.jpg)
Coalition Logic
■ We repeat some slides from MAIR…
260
![Page 3: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/3.jpg)
MAIR2013 John-Jules Meyer 261
Non-normal modal logic
■ We have seen that in normal modal logic (based on Kripke semantics) it holds that:
■ ² (¤ϕ ∧ ¤(ϕ → ψ)) → ¤ψ
■ If one does not want this property one should use non-normal modal logic (based on neighborhood semantics)
![Page 4: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/4.jpg)
MAIR2013 John-Jules Meyer 262
Neighborhood semantics
■ Accessibility relation between a world and its accessible worlds is generalized to a relation between a world and a collection of sets of worlds
w
![Page 5: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/5.jpg)
MAIR2013 John-Jules Meyer 263
“Minimal” Models
■ M = h S, ¼, N i■ Where
– S is a set of worlds– ¼ is a truth assignment function– N is a function S ! P(P(S))
![Page 6: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/6.jpg)
MAIR2013 John-Jules Meyer 264
Interpretation
■ The sets in the collection are called neighborhoods and represent propositions that are necessary in world w
■ So semantics:■ M,w ² ¤Á $ kÁkM 2 N(w)where kÁkM is the truth set of Á in M:■ kÁkM = {w | M,w ² Á}
![Page 7: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/7.jpg)
MAIR2013 John-Jules Meyer 265
Logic
■ The following system is sound & complete w.r.t. the class of minimal models: PC (incl MP) +
Á $ à _________ ¤Á $ ¤Ã
![Page 8: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/8.jpg)
MAIR2013 John-Jules Meyer 266
Extensions
■ Of course, this is a very weak logic, but it is possible again to put constraints on the models in order to get again properties such as D, T, 4, 5! (Cf. Chellas, Ch. 7)
![Page 9: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/9.jpg)
MAIR2013 John-Jules Meyer 268
Coalition Logic
■ Operator [C]Á– “coalition C is able to ensure Á”– Semantics based on neighborhood models, with
extra properties– M = h S, ¼, E iwhere
• S is a nonempty set of worlds/states• ¼ is a truth assignment function• E : S ! (P(AGT) ! P(P(S))) effectivity function
![Page 10: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/10.jpg)
MAIR2013 John-Jules Meyer 269
(Playable) effectivity function
■ E satisfies– not ; 2 E(w)(C)– S 2 E(w)(C)– (not S\X 2 E(w)(;)) ) X 2 E(w)(AGT)– X 2 E(w)(C) & X µ Y ) Y 2 E(w)(C)– X 2 E(w)(C1) & Y 2 E(w)(C2) &
C1 Å C2 = ; ) X Å Y 2 E(w)(C1 [ C2)
![Page 11: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/11.jpg)
MAIR2013 John-Jules Meyer 270
Interpretation
■ M,s ² [C]Á $ kÁkM 2 E(w)(C)
■ Intuition: E(w)(C) is the collection of sets X µ S such that C can force the world to be in some state of X (where X represents a proposition)
![Page 12: Multi-Agent Logics - Utrecht University fileMulti-Agent Logics Coalition Logic Alternating-time Logic (ATL) Epistemic Variants (ATEL, ATEL-A) 259](https://reader031.fdocument.pub/reader031/viewer/2022021916/5cf162fa88c9933d468bf2c7/html5/thumbnails/12.jpg)
MAIR2013 John-Jules Meyer 271
Sound & complete axiomatization ■ PC (incl (MP))■ ¬[C]?■ [C]>■ ¬[;]¬Á ! [AGT]Á■ [C](Á Æ Ã) ! [C]Á Æ [C]Ã■ [C1]Á Æ [C2]à ! [C1 [ C2] (Á Æ Ã)
if C1 Å C2 = ;■ Á $ Ã / [C]Á $ [C]Ã