Alternating-time temporal logic with explicit strategies

  • Authors:
  • Dirk Walther;Wiebe van der Hoek;Michael Wooldridge

  • Affiliations:
  • University of Liverpool, Liverpool;University of Liverpool, Liverpool;University of Liverpool, Liverpool

  • Venue:
  • TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce ATLES - a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences of path quantifiers, and, as a consequence, it possible to express in ATLES some properties that cannot be expressed even in ATL*. We present a complete axiomatic system for ATLES. Moreover, we show that satisfiability problem for ATLES is no more complex than for ATL: it is ExpTime-complete. We identify two variants of the model-checking problem for ATLES and investigate their computational complexity. Finally, we show how ATLES can be used to reason about extensive games.