Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33353-8_31 | JELIA |
Keywords | Field | DocType |
immediate corollary,decidable fragment,explicit strategy,memory-less strategy,strategy context,resulting logic,satisfiability checking | Discrete mathematics,Computer science,Satisfiability,Decidability,Artificial intelligence,Corollary,Undecidable problem | Conference |
Citations | PageRank | References |
4 | 0.41 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Troquard | 1 | 266 | 29.54 |
| Dirk Walther | 2 | 441 | 23.51 |