… The contrast between the high complexity of the model-checking problem for our logic and
the elementary one for ATL∗ has spurred us to investigate syntactic fragments of SL, strictly …

… strategic aspects of multi-agent systems. In this work, we introduce and study a more general
strategy logic, denoted Sl, for reasoning about strategies … model-checking problem. Indeed, …

… strategies and binds them to all agents. As main results about these fragments, we prove that
the model-checking problem … [BG], we have that the model-checking problem for the latter is …

… of the conventional model checking problem for our setting: … issue we have investigated
is the extent to which we can develop a language that supports reasoning about strategies …

… the connection between the two problems for a non-trivial fragment of Strategy Logic (SL,
for … tifications over strategies, thus allowing to explicitly reason about the strategic abilities of …

… , we will usually restrict to infinite traces and this is not a problem. On the other hand, the …
The argument N of the first turns strategy is the number of philosophers at the table, and K is …

… Abstract Alternating-time temporal logic (ATL) is a logic for reasoning … model checking
problem is intractable in such a setting of input parameters. Firstly, it turns out that the problem …

… Reasoning about strategies generally needs to be based on … of the paper is a symbolic model
checking algorithm for ETLK (… a different problem, in which we aim to find a strategy for the …

… model checking problem. Given the formal machinery developed so far we are now in a
position to give a more precise characterisation. The model checking problem … to reason about …

… the translation or the reduction of the problem of model checking to plain ATL, and it permits
the … interpreted systems, and to strategies when reasoning about ATL formulae in interpreted …