Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns a strategy to achieve given goal. We point out that the algorithm generalizes minimaxing, and that ATL models generalize traditional game trees. The paper ends with suggestions about other game theory concepts that can be transfered to ATL-based planning.
CITATION STYLE
Jamroga, W. (2004). Strategic planning through model checking of ATL formulae. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3070, pp. 879–884). Springer Verlag. https://doi.org/10.1007/978-3-540-24844-6_136
Mendeley helps you to discover research relevant for your work.