Alternating-time logic with imperfect recall

Schobbens, Pierre‐Yves

doi:10.1016/s1571-0661(05)82604-0

Cited by 117 publications

(166 citation statements)

References 5 publications

Supporting

Mentioning

161

Contrasting

Order By: Relevance

“…The former has been focused on the way in which ATL and its extensions can be used for verification of multi-agent systems, in particular what is the complexity of model checking, and how one can overcome the inherent difficulties. An interested reader is referred to [13] for an overview, and to [9,17,20,24,42,48,57,59] for more specific results; some attempts at taming the complexity were proposed e.g. in [18,23,38,46,47].…”

Section: Related Workmentioning

confidence: 99%

“…ATL was combined with epistemic logic [1,2,39,[60][61][62], and several semantic variants were defined that match various possible interpretations of ability [35,39,43,45,57]. Moreover, many conceptual extensions have been considered, e.g., with explicit reasoning about strategies, rationality assumptions and solution concepts [19,20,58,63,65], agents with bounded resources [5,6,14,15], coalition formation and negotiation [12], opponent modeling and action in stochastic environments [16,37,55,56] and reasoning about irrevocable plans and interplay between strategies of different agents [3,11].…”

Section: Related Workmentioning

confidence: 99%

“…Surprisingly, relationships between the "classical" semantic variants of ATL (as defined e.g. in [57]) have not yet been studied, though analogous results exist that compare more sophisticated variations to a more standard variant (cf. [36] for undominated play, [3] for irrevocable strategies, [4] for agents with bounded memory, and [18] for recomputable strategies under uncertainty).…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Bulling

Jamroga

2013

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

Alternating-time temporal logic (ATL) is a modal logic that allows to reason about agents' abilities in game-like scenarios. Semantic variants of ATL are usually built upon different assumptions about the kind of game that is played, including capabilities of agents (perfect vs. imperfect information, perfect vs. imperfect memory, etc.). ATL has been studied extensively in previous years; however, most of the research focused on model checking. Studies of other decision problems (e.g., satisfiability) and formal meta-properties of the logic (like axiomatization or expressivity) have been relatively scarce, and mostly limited to the basic variant of ATL where agents possess perfect information and perfect memory. In particular, a comparison between different semantic variants of the logic is largely left untouched. In this paper, we show that different semantics of ability in ATL give rise to different validity sets. The issue is important for several reasons. First, many logicians identify a logic with its set of true sentences. As a consequence, we prove that different notions of ability induce different strategic logics. Secondly, we show that different concepts of ability induce different general properties of games. Thirdly, the study can be seen as the first systematic step towards satisfiability-checking algorithms for ATL with imperfect information. We introduce sophisticated unfoldings of models and prove invariance results that are an important technical contribution to formal analysis of strategic logics.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Bulling

Jamroga

2013

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

show abstract

“…First, we employ "memoryless" strategies in this paper, while in [3] strategies assign agents' choices to sequences of states (which suggests that agents can recall the whole history of the game). It should be pointed out that both types of strategies yield equivalent semantics for "vanilla" ATL, although the choice of one or another notion of strategy affects the semantics (and complexity) of the full ATL* and most ATL variants for games with incomplete information [20]. Thus, we use memoryless strategies to increase the simplicity and extendability of our approach.…”

Section: Atl With Intentionsmentioning

confidence: 99%

Intentions and Strategies in Game-Like Scenarios

Jamroga

Hoek

Wooldridge

2005

Progress in Artificial Intelligence

View full text Add to dashboard Cite

In this paper, we investigate the link between logics of games and "mentalistic" logics of rational agency, in which agents are characterized in terms of attitudes such as belief, desire and intention. In particular, we investigate the possibility of extending the logics of games with the notion of agents' intentions (in the sense of Cohen and Levesque's BDI theory). We propose a new operator (straσ) that can be used to formalize reasoning about outcomes of strategies in game-like scenarios. We briefly discuss the relationship between intentions and goals in this new framework, and show how capture dynamic logic-like constructs can be captured. Finally, we demonstrate how game-theoretical concepts like Nash equilibrium can be expressed to reason about rational intentions and their consequences.

show abstract

“…As discussed in the literature [21,20], even in the face of imperfect information all of these variants are potentially interesting, and it is important to be able to distinguish between them; for example, the first variant can be used to identify agents or groups who can make something come about if they get enough information, in contrast with those who cannot no matter how much information they get. While the two variants of "ability" just mentioned can be expressed with combinations of operators with standard semantics ([{i}]φ and K i [{i}]φ respectively, in the case of a single agent), in order to be able to express the latter (knowledge of ability "de re"), operators with alternative semantics are needed [21,26,18,20]. We do not consider such operators in the current paper.…”

Section: Introductionmentioning

confidence: 99%

Coalition logic with individual, distributed and common knowledge1

Ågotnes

Alechina

2018

Journal of Logic and Computation

View full text Add to dashboard Cite

Coalition logic is currently one of the most popular logics for multi-agent systems. While logics combining coalitional and epistemic operators have received considerable attention, completeness results for epistemic extensions of coalition logic have so far been missing. In this paper we provide several such results and proofs. We prove completeness for epistemic coalition logic with common knowledge, with distributed knowledge, and with both common and distributed knowledge, respectively. Furthermore, we completely characterise the complexity of the satisfiability problem for each of the three logics. We also study logics with interaction axioms connecting coalitional ability and knowledge.

show abstract

Alternating-time logic with imperfect recall

Cited by 117 publications

References 5 publications

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Intentions and Strategies in Game-Like Scenarios

Coalition logic with individual, distributed and common knowledge1

Contact Info

Product

Resources

About