Advertisement
Published in:
2011 | OriginalPaper | Chapter
Reasoning about Joint Action and Coalitional Ability in K n with Intersection
Authors : Thomas Ågotnes, Natasha Alechina
Published in: Computational Logic in Multi-Agent Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper we point out that standard
pdl
-like logics with intersection are useful for reasoning about game structures. In particular, they can express coalitional ability operators known from coalition logic and
atl
. An advantage of standard, normal, modal logics is a well understood theoretical foundation and the availability of tools for automated verification and reasoning. We study a minimal variant, multi-modal
K
with intersection of modalities, interpreted over models corresponding to game structures. There is a restriction: we consider only game structures that are injective. We give a complete axiomatisation of the corresponding models, as well as a characterisation of key complexity problems. We also prove a representation theorem identifying the effectivity functions corresponding to injective games.