Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+

  • Serenella Cerrito
  • Amélie David
  • Valentin Goranko
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8562)


We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL+ of the full Alternating time temporal logic ATL*. The method extends in an essential way a previously developed tableaux-based decision method for ATL and works in 2EXPTIME, which is the optimal worst case complexity of the satisfiability problem for ATL+. We also discuss how suitable parameterizations and syntactic restrictions on the class of input ATLP formulae can reduce the complexity of the satisfiability problem.


State Formula Elimination Rule Full Expansion Input Formula Negation Normal Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alur, R., Henzinger, T.A., Kuperman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 672–713 (2002)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Cerrito, S., David, A., Goranko, V.: Optimal tableaux-based decision procedure for testing satisfiability in the alternating-time temporal logic ATL + . Tech. rep., Laboratoire IBISC - Université Evry Val-d’Essonne (2014),
  3. 3.
    David, A.: TATL: Implementation of ATL tableau-based decision procedure. In: Galmiche, D., Larchey-Wendling, D. (eds.) TABLEAUX 2013. LNCS, vol. 8123, pp. 97–103. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  4. 4.
    van Drimmelen, G.: Satisfiability in alternating-time temporal logic. In: Proc. of LICS 2003, pp. 208–217 (2003)Google Scholar
  5. 5.
    Emerson, E.A.: Temporal and modal logics. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 995–1072. MIT Press (1990)Google Scholar
  6. 6.
    Goranko, V., van Drimmelen, G.: Complete axiomatization and decidablity of Alternating-time temporal logic. Theor. Comp. Sci. 353, 93–117 (2006)CrossRefzbMATHGoogle Scholar
  7. 7.
    Goranko, V., Shkatov, D.: Tableau-based decision procedures for logics of strategic ability in multiagent systems. ACM Trans. Comput. Log. 11(1) (2009)Google Scholar
  8. 8.
    Johannsen, J., Lange, M.: CTL+ is Complete for Double Exponential Time. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 767–775. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    Pratt, V.R.: A near optimal method for reasoning about action. Journal of Computer and System Sciences 20, 231–254 (1980)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Schewe, S.: ATL* satisfiability is 2EXPTIME-complete. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 373–385. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  11. 11.
    Walther, D., Lutz, C., Wolter, F., Wooldridge, M.: ATL satisfiability is indeed ExpTime-complete. Journal of Logic and Computation 16(6), 765–787 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Wolper, P.: The tableau method for temporal logic: an overview. Logique et Analyse 28(110-111), 119–136 (1985)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Serenella Cerrito
    • 1
  • Amélie David
    • 1
  • Valentin Goranko
    • 2
    • 3
  1. 1.Laboratoire IBISCUniversité Evry Val-d’EssonneFrance
  2. 2.Department of Applied Mathematics and Computer ScienceTechnical University of DenmarkDenmark
  3. 3.University of JohannesburgSouth Africa

Personalised recommendations