On satisfiability in ATL with strategy contexts

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 ATLsc with memory-less strategies with ATL with explicit strategies, providing a decidable fragment