Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Epistemic ATL with Perfect Recall, Past and Strategy Contexts

  • Conference paper
Computational Logic in Multi-Agent Systems (CLIMA 2012)

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

Included in the following conference series:

Abstract

We propose an extension to epistemic ATL with perfect recall, past, and distributed knowledge by strategy contexts and demonstrate the strong completeness of a Hilbert-style proof system for its (.\({\mathsf U}\).)-free subset.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Ågotnes, T., Goranko, V., Jamroga, W.: Strategic Commitment and Release in Logics for Multi-Agent Systems (Extended Abstract). Technical report IfI-08-01, TU Clausthal (May 2008); Ågotnes, T., Goranko, V., Jamroga, W.: Strategic Commitment and Release in Logics for Multi-Agent Systems (Extended Abstract). In: Bonanno, G., Löwe, B., van der Hoek, W. (eds.) Logic and the Foundations of Game and Decision Theory. LNCS, vol. 6006, Springer, Heidelberg (2010)

    Google Scholar 

  2. Alur, R., Henzinger, T., Kupferman, O.: Alternating-time Temporal Logic. In: Proceedings of FCS 1997, pp. 100–109 (1997)

    Google Scholar 

  3. Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 1–42 (2002)

    Article  MathSciNet  Google Scholar 

  4. Asarin, E.: EQINOCS Research Project ANR 11 BS02 004 03, http://www.liafa.univ-paris-diderot.fr/~eqinocs/

  5. Brihaye, T., Da Costa, A., Laroussinie, F., Markey, N.: ATL with Strategy Contexts and Bounded Memory. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 92–106. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. Information and Computation 208(6), 677–693 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press (1995)

    Google Scholar 

  8. Goranko, V., van Drimmelen, G.: Decidability and Complete Axiomatization of the Alternating-time Temporal Logic. Theoretical Computer Science 353(1-3), 93–117 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Guelev, D.P., Dima, C., Enea, C.: An Alternating-time Temporal Logic with Knowledge, Perfect Recall and Past: Axiomatisation and Model-checking. Journal of Applied Non-Classical Logics 21(1), 93–131 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Halpern, J., van der Meyden, R., Vardi, M.: Complete Axiomatizations for Reasoning about Knowledge and Time. SIAM Journal on Computing 33(3), 674–703 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Jamroga, W., van der Hoek, W.: Agents That Know How to Play. Fundamenta Informaticae 63(2-3), 185–219 (2004)

    MathSciNet  MATH  Google Scholar 

  12. Lichtenstein, O., Pnueli, A.: Propositional temporal logics: decidability and completeness. Logic Journal of the IGPL 8(1), 55–85 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lomuscio, A., Raimondi, F.: Model checking knowledge, strategies, and games in multi-agent systems. In: Proceedings of AAMAS 2006, pp. 161–168. ACM Press (2006)

    Google Scholar 

  14. Lomuscio, A., Raimondi, F.: The Complexity of Model Checking Concurrent Programs Against CTLK Specifications. In: Baldoni, M., Endriss, U. (eds.) DALT 2006. LNCS (LNAI), vol. 4327, pp. 29–42. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Lopes, A.D.C., Laroussinie, F., Markey, N.: ATL with strategy contexts: Expressiveness and model checking. In: FSTTCS. LIPIcs, vol. 8, pp. 120–132 (2010)

    Google Scholar 

  16. Pauly, M.: A modal logic for coalitional power in games. Journal of Logic and Computation 12(1), 149–166 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  17. Schobbens, P.Y.: Alternating-time logic with imperfect recall. ENTCS 85(2), 82–93 (2004); Proceedings of LCMAS 2003

    Google Scholar 

  18. van der Hoek, W., Wooldridge, M.: Cooperation, Knowledge and Time: Alternating-time Temporal Epistemic Logic and Its Applications. Studia Logica 75, 125–157 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  19. van der Meyden, R., Wong, K.-S.: Complete Axiomatizations for Reasoning about Knowledge and Branching Time. Studia Logica 75(1), 93–123 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  20. Walther, D., van der Hoek, W., Wooldridge, M.: Alternating-time Temporal Logic with Explicit Strategies. In: Samet, D. (ed.) TARK, pp. 269–278. ACM Press (2007)

    Google Scholar 

  21. Wang, F., Huang, C.-H., Yu, F.: A Temporal Logic for the Interaction of Strategies. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011 – Concurrency Theory. LNCS, vol. 6901, pp. 466–481. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Belgium

    Dimitar P. Guelev

  2. Laboratory of Algorithms, Complexity and Logic, Université Paris Est-Créteil, France

    Catalin Dima

Authors
  1. Dimitar P. Guelev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Catalin Dima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Liverpool, L69 3BX, Liverpool, UK

    Michael Fisher

  2. University of Luxembourg, 6 Rue Richard Coudenhove-Kalergi, 1359, Luxembourg, Luxembourg

    Leon van der Torre

  3. Department of Information and Computing Sciences, Utrecht University, Princetonplein 5, 3584 CC, Utrecht, The Netherlands

    Mehdi Dastani

  4. Queensland Research Laboratory, NICTA, 4067, St. Lucia, QLD, Australia

    Guido Governatori

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guelev, D.P., Dima, C. (2012). Epistemic ATL with Perfect Recall, Past and Strategy Contexts. In: Fisher, M., van der Torre, L., Dastani, M., Governatori, G. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2012. Lecture Notes in Computer Science(), vol 7486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32897-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32897-8_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32896-1

  • Online ISBN: 978-3-642-32897-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation