Imperfect Information in Alternating-Time Temporal Logic on Finite Traces

Francesco Belardinelli (1, 2) , Alessio Lomuscio (2) , Aniello Murano (3) , Sasha Rubin (3)

1 IBISC - Informatique, BioInformatique, Systèmes Complexes
2 Department of Computing [Imperial College London]
3 DIETI - Dipartimento di Ingegneria Elettrica e delle Tecnologie dell'Informazione [Napoli]

We introduce a logic to reason about strategic abilities in finite games under imperfect information. We interpret Alternating-time Temporal Logic on interpreted systems with final states, where agents only have partial observability of the system’s global state. We consider the model checking problem in this setting. We prove that the complexity results available for the case of infinite traces carry over to the finite traces case. We show that when only public actions are allowed, the verification problem under perfect recall becomes decidable.

Domaines: Logique en informatique [cs.LO]; Base de données [cs.DB]

Francesco Belardinelli, Alessio Lomuscio, Aniello Murano, Sasha Rubin. Imperfect Information in Alternating-Time Temporal Logic on Finite Traces. 22nd International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2019), Oct 2019, Turin, Italy. pp.469--477, ⟨10.1007/978-3-030-33792-6_31⟩. ⟨hal-02424595⟩