Skip to main content
Springer Nature Link
Log in

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

  • Conference paper
Automated Reasoning (IJCAR 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8562))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alur, R., Henzinger, T.A., Kuperman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 672–713 (2002)

    Article  MathSciNet  Google Scholar 

  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), https://www.ibisc.univ-evry.fr/~adavid/fichiers/IJCAR_Extended_Draft_Tableau_ATLplus.pdf

  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)

    Chapter  Google Scholar 

  4. van Drimmelen, G.: Satisfiability in alternating-time temporal logic. In: Proc. of LICS 2003, pp. 208–217 (2003)

    Google Scholar 

  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. Goranko, V., van Drimmelen, G.: Complete axiomatization and decidablity of Alternating-time temporal logic. Theor. Comp. Sci. 353, 93–117 (2006)

    Article  MATH  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  9. Pratt, V.R.: A near optimal method for reasoning about action. Journal of Computer and System Sciences 20, 231–254 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  12. Wolper, P.: The tableau method for temporal logic: an overview. Logique et Analyse 28(110-111), 119–136 (1985)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire IBISC, Université Evry Val-d’Essonne, France

    Serenella Cerrito & Amélie David

  2. Department of Applied Mathematics and Computer Science, Technical University of Denmark, Denmark

    Valentin Goranko

  3. University of Johannesburg, South Africa

    Valentin Goranko

Authors
  1. Serenella Cerrito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amélie David
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Valentin Goranko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS,, New York University &amp, USA

    Stéphane Demri

  2. Department of Computer Science, University of New Mexico, 87131-0001, Albuquerque, NM, USA

    Deepak Kapur

  3. Max Planck Institute for Informatics, Campus E1 4, 66123, Saarbrücken, Germany

    Christoph Weidenbach

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Cerrito, S., David, A., Goranko, V. (2014). Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+. In: Demri, S., Kapur, D., Weidenbach, C. (eds) Automated Reasoning. IJCAR 2014. Lecture Notes in Computer Science(), vol 8562. Springer, Cham. https://doi.org/10.1007/978-3-319-08587-6_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08587-6_21

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08586-9

  • Online ISBN: 978-3-319-08587-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics