Advertisement

Epistemic ATL with Perfect Recall, Past and Strategy Contexts

  • Dimitar P. Guelev
  • Catalin Dima
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7486)

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.

Keywords

Temporal Logic Proof System Atomic Proposition Modus Ponens Perfect Recall 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Alur, R., Henzinger, T., Kupferman, O.: Alternating-time Temporal Logic. In: Proceedings of FCS 1997, pp. 100–109 (1997)Google Scholar
  3. 3.
    Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 1–42 (2002)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Asarin, E.: EQINOCS Research Project ANR 11 BS02 004 03, http://www.liafa.univ-paris-diderot.fr/~eqinocs/
  5. 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)CrossRefGoogle Scholar
  6. 6.
    Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. Information and Computation 208(6), 677–693 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press (1995)Google Scholar
  8. 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)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 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)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 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)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Jamroga, W., van der Hoek, W.: Agents That Know How to Play. Fundamenta Informaticae 63(2-3), 185–219 (2004)MathSciNetzbMATHGoogle Scholar
  12. 12.
    Lichtenstein, O., Pnueli, A.: Propositional temporal logics: decidability and completeness. Logic Journal of the IGPL 8(1), 55–85 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 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. 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)CrossRefGoogle Scholar
  15. 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. 16.
    Pauly, M.: A modal logic for coalitional power in games. Journal of Logic and Computation 12(1), 149–166 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Schobbens, P.Y.: Alternating-time logic with imperfect recall. ENTCS 85(2), 82–93 (2004); Proceedings of LCMAS 2003Google Scholar
  18. 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)MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    van der Meyden, R., Wong, K.-S.: Complete Axiomatizations for Reasoning about Knowledge and Branching Time. Studia Logica 75(1), 93–123 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  20. 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. 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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Dimitar P. Guelev
    • 1
  • Catalin Dima
    • 2
  1. 1.Institute of Mathematics and InformaticsBulgarian Academy of SciencesBelgium
  2. 2.Laboratory of Algorithms, Complexity and LogicUniversité Paris Est-CréteilFrance

Personalised recommendations