Model-Checking Alternating-Time Temporal Logic with Strategies Based on Common Knowledge is Undecidable

Abstract : We present a semantics for the Alternating-time Temporal Logic (ATL) with imperfect information, in which the participants in a coalition choose their strategies such that each agent's choice is the same in all states that form the common knowledge for the coaltion. We show that ATL with this semantics has an undecidable model-checking problem if the semantics is also synchronous and the agents have perfect recall.
Type de document :
Article dans une revue
Applied Artificial Intelligence, Taylor & Francis, 2012, 26 (4), pp.331--348. 〈10.1080/08839514.2012.652905〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01699945
Contributeur : Catalin Dima <>
Soumis le : vendredi 2 février 2018 - 22:52:06
Dernière modification le : lundi 17 décembre 2018 - 01:34:09

Identifiants

Citation

Raluca Diaconu, Catalin Dima. Model-Checking Alternating-Time Temporal Logic with Strategies Based on Common Knowledge is Undecidable. Applied Artificial Intelligence, Taylor & Francis, 2012, 26 (4), pp.331--348. 〈10.1080/08839514.2012.652905〉. 〈hal-01699945〉

Partager

Métriques

Consultations de la notice

110