On satisfiability in ATL with strategy contexts

Authors:
Nicolas Troquard;Dirk Walther
Affiliations:
Laboratory for Applied Ontology (ISTC-CNR), Trento, Italy;Universidad Politécnica de Madrid, Spain
Venue:
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Year:
2012

Citing 5
Cited 0

Alternating-time temporal logic

Journal of the ACM (JACM)
Alternating-time temporal logics with irrevocable strategies

TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Alternating-time temporal logic with explicit strategies

TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
ATL with Strategy Contexts and Bounded Memory

LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
A STIT-Extension of ATL

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is a study of Brihaye et al.'s ATL with strategy contexts. We focus on memory-less strategies and establish that the resulting logic is undecidable. An immediate corollary follows that the problem of satisfiability checking of every variant of ATL with strategy context introduced by Brihaye et al. is undecidable. We also relate ATL$_{\textit{sc}}$ with memory-less strategies with ATL with explicit strategies, providing a decidable fragment.