research-article

An Epistemic Strategy Logic

Authors:

Ron Van Der MeydenAuthors Info & Claims

ACM Transactions on Computational Logic (TOCL), Volume 19, Issue 4

Article No.: 26, Pages 1 - 45

https://doi.org/10.1145/3233769

Published: 30 November 2018 Publication History

Abstract

This article presents an extension of temporal epistemic logic with operators that can express quantification over agent strategies. Unlike previous work on alternating temporal epistemic logic, the semantics works with systems whose states explicitly encode the strategy being used by each of the agents. This provides a natural way to express what agents would know were they to be aware of some of the strategies being used by other agents. A number of examples that rely on the ability to express an agent’s knowledge about the strategies being used by other agents are presented to motivate the framework, including reasoning about game-theoretic equilibria, knowledge-based programs, and information-theoretic computer security policies. Relationships to several variants of alternating temporal epistemic logic are discussed. The computational complexity of model checking the logic and several of its fragments are also characterized.

References

[1]

Thomas Ågotnes, Valentin Goranko, and Wojciech Jamroga. 2007. Alternating-time temporal logics with irrevocable strategies. In Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK’07). 15--24.

Digital Library

[2]

Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. 2002. Alternating-time temporal logic. J. ACM 49, 5 (2002), 672--713.

Digital Library

[3]

Francesco Belardinelli. 2014. Reasoning about knowledge and strategies: Epistemic strategy logic. In Proceedings of the 2nd International Workshop on Strategic Reasoning (SR’14). 27--33.

[4]

Patrick Blackburn and Jerry Seligman. 1998. What are hybrid languages? In Advances in Modal Logic, M. de Rijke, H. Wansing, and M. Zakharyaschev (Eds.), Vol. 1. CSLI Publications, 41--62.

[5]

Laura Bozzelli and Ruggero Lanotte. 2010. Complexity and succinctness issues for linear-time hybrid logics. Theor. Comput. Sci. 411, 2 (2010), 454--469.

Digital Library

[6]

Ronen I. Brafman, Jean-Claude Latombe, Yoram Moses, and Yoav Shoham. 1997. Applications of a logic of knowledge to motion planning under uncertainty. J. ACM 44, 5 (1997), 633--668.

Digital Library

[7]

Thomas Brihaye, Arnaud Da Costa, François Laroussinie, and Nicolas Markey. 2009. ATL with strategy contexts and bounded memory. In Proceedings of the International Symposium on Logical Foundations of Computer Science. 92--106.

Digital Library

[8]

Simon Busard, Charles Pecheur, Hongyang Qu, and Franco Raimondi. 2013. Reasoning about strategies under partial observability and fairness constraints. In Proceedings of the 1st International Workshop on Strategic Reasoning (SR’13). 71--79.

[9]

Jan Calta, Dmitry Shkatov, and Bernd-Holger Schlingloff. 2010. Finding uniform strategies for multi-agent systems. In Computational Logic in Multi-Agent Systems (CLIMA XI). 135--152.

Digital Library

[10]

Petr Čermák. 2014. A Model Checker for Strategy Logic. MEng Individual Project thesis, Department of Computing, Imperial College London.

[11]

Petr Čermák, Alessio Lomuscio, Fabio Mogavero, and Aniello Murano. 2014. MCMAS-SLK: A model checker for the verification of strategy logic specifications. In Proceedings of the 26th International Conference on Computer-Aided Verification (CAV’14). 525--532.

Digital Library

[12]

Ashok K. Chandra, Dexter Kozen, and Larry J. Stockmeyer. 1981. Alternation. J. ACM 28, 1 (1981), 114--133.

Digital Library

[13]

Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. 2010. Strategy logic. Inf. Comput. 208, 6 (2010), 677--693.

Digital Library

[14]

Stephen Chong and Andrew C. Myers. 2005. Language-based information erasure. In Proceedings of the IEEE Computer Security Foundations Workshop. 241--254.

Digital Library

[15]

Edmund M. Clarke, E. Allen Emerson, and A. Prasad Sistla. 1986. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8, 2 (1986), 244--263.

Digital Library

[16]

Catalin Dima and Ferucio Laurentiu Tiplea. 2011. Model-checking ATL under imperfect information and perfect recall semantics is undecidable. CoRR abs/1102.4225 (2011).

[17]

E. Allen Emerson and Joseph Y. Halpern. 1986. “Sometimes” and “not never” revisited: On branching versus linear time temporal logic. J. ACM 33, 1 (1986), 151--178.

Digital Library

[18]

Kai Engelhardt, Peter Gammie, and Ron van der Meyden. 2007. Model checking knowledge and linear time: PSPACE cases. In Proceedings of the Symposium on Logical Foundations of Computer Science. LNCS. Springer, 195--211.

Digital Library

[19]

Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. 1995. Reasoning about Knowledge. The MIT Press.

[20]

Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. 1997. Knowledge-based programs. Distrib. Comput. 10, 4 (1997), 199--225.

Digital Library

[21]

Massimo Franceschet and Maarten de Rijke. 2006. Model checking hybrid logics (with an application to semistructured data). J. Appl. Logic 4, 3 (2006), 279--304.

[22]

Massimo Franceschet, Maarten de Rijke, and Bernd-Holger Schlingloff. 2003. Hybrid logics on linear structures: Expressivity and complexity. In Proceedings of the 10th International Symposium on Temporal Representation and Reasoning and the 4th International Conference on Temporal Logic (TIME-ICTL’03). 166--173.

[23]

Joseph Y. Halpern and Yoram Moses. 1990. Knowledge and common knowledge in a distributed environment. J. ACM 37, 3 (1990), 549--587.

Digital Library

[24]

Joseph Y. Halpern and Yoram Moses. 2007. Characterizing solution concepts in games using knowledge-based programs. In Proceedings of the 20nd International Joint Conference on Artificial Intelligence (IJCAI’07). 1300--1307.

Digital Library

[25]

Joseph Y. Halpern and Kevin R. O’Neill. 2008. Secrecy in multiagent systems. ACM Trans. Inf. Syst. Secur. 12, 1 (Article No. 5 2008).

Digital Library

[26]

Joseph Y. Halpern and Nan Rong. 2010. Cooperative equilibrium (extended abstract). In Proceedings of the 9th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS’10). 1465--1466.

Digital Library

[27]

Jens Ulrik Hansen. 2011. A hybrid public announcement logic with distributed knowledge. Electr. Not. Theor. Comput. Sci. 273 (2011), 33--50.

Digital Library

[28]

Wiebe van der Hoek, Wojciech Jamroga, and Michael Wooldridge. 2005. A logic for strategic reasoning. In Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS’05). 157--164.

Digital Library

[29]

Wiebe van der Hoek and Michael Wooldridge. 2002. Tractable multiagent planning for epistemic goals. In Proceedings of the 1st International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS’02). 1167--1174.

Digital Library

[30]

John F. Horty. 2001. Agency and Deontic Logic. Oxford University Press.

[31]

Xiaowei Huang and Ron van der Meyden. 2014. An epistemic strategy logic (extended abstract). In Proceedings of the 2nd International Workshop on Strategic Reasoning (SR14). 35--41.

[32]

Xiaowei Huang and Ron van der Meyden. 2014. Symbolic model checking epistemic strategy logic. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI’14). 1426--1432.

Digital Library

[33]

Xiaowei Huang and Ron van der Meyden. 2014. A temporal logic of strategic knowledge. In Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning (KR’14).

Digital Library

[34]

Wojciech Jamroga. 2003. Some remarks on alternating temporal epistemic logic. In Proceedings of Formal Approaches to Multi-Agent Systems (FAMAS’03).

[35]

Wojciech Jamroga and Thomas Ågotnes. 2007. Constructive knowledge: What agents can achieve under imperfect information. J. Appl. Non-Class. Logics 17, 4 (2007), 423--475.

[36]

Wojciech Jamroga, Thomas Ågotnes, and Wiebe van der Hoek. 2008. A Simpler Semantics for Abilities under Uncertainty. Technical Report IfI-08-01. Department of Informatics, Clausthal University of Technology.

[37]

Wojciech Jamroga and Jürgen Dix. 2006. Model checking abilities under incomplete information is indeed delta2-complete. In Proceedings of the the 4th European Workshop on Multi-Agent Systems (EUMAS’06).

[38]

Wojciech Jamroga and Wiebe van der Hoek. 2004. Agents that know how to play. Fund. Inf. 62 (2004), 1--35.

Digital Library

[39]

Geert Jonker. 2003. Feasible Strategies in Alternating-time Temporal. Master’s thesis. University of Utrech, The Netherlands.

[40]

Alessio Lomuscio and Franco Raimondi. 2006. Model checking knowledge, strategies, and games in multi-agent systems. In Proceedings of the Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS’06). 161--168.

Digital Library

[41]

Ron van der Meyden. 1996. Knowledge based programs: On the complexity of perfect recall in finite environments. In Proceedings of the 6th Conference on Theoretical Aspects of Rationality and Knowledge (TARK’96). 31--49.

Digital Library

[42]

Fabio Mogavero, Aniello Murano, and Moshe Y. Vardi. 2010. Reasoning about strategies. In Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’10). 133--144.

[43]

Rohit Parikh. 1983. Propositional game logic. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 195--200.

Digital Library

[44]

Rohit Parikh and Ramaswamy Ramanujam. 1985. Distributed processes and the logic of knowledge. In Logics of Programs 1985. 256--268.

Digital Library

[45]

Marc Pauly. 2002. A modal logic for coalitional power in games. J. Logic Comput. 12, 1 (2002), 149--166.

[46]

Amir Pnueli. 1977. The temporal logic of programs. In Proceedings of the Symposium on Foundations of Computer Science. 46--57.

Digital Library

[47]

Ramaswamy Ramanujam and Sunil Easaw Simon. 2008. Dynamic logic on games with structured strategies. In Proceedings of the 1th International Conference on Principles of Knowledge Representation and Reasoning (KR’08). 49--58.

Digital Library

[48]

Olivier Roy. 2009. A dynamic-epistemic hybrid logic for intentions and information changes in strategic games. Synthese 171, 2 (2009), 291--320.

[49]

Henning Schnoor. 2010. Explicit Strategies and Quantification for ATL with Incomplete Information and Probabilistic Games. Technical Report 1008. Institut für Informatik, Christian-Albrechts Universität zu Kiel.

[50]

Pierre-Yves Schobbens. 2004. Alternating-time logic with imperfect recall. Electr. Not. Theor. Comput. Sci. 85, 2 (2004), 82--93.

[51]

Thomas Schwentick and Volker Weber. 2007. Bounded-variable fragments of hybrid logics. In Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS’07). Springer LNCS, Vol. 4393. 561--572.

Digital Library

[52]

A. Prasad Sistla and Edmund M. Clarke. 1985. The complexity of propositional linear temporal logics. J. ACM 32, 3 (1985), 733--749.

Digital Library

[53]

D. Sutherland. 1986. A model of information. In Proceedings of the 9th National Computer Security Conference. 175--183.

[54]

Jan van Eijck. 2013. PDL as a multi-agent strategy logic. In Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK’13).

[55]

Sieuwert van Otterloo and Geert Jonker. 2005. On epistemic temporal strategic logic. Electronic Notes in Theoretical Computer Science 126 (2005), 77--92.

Digital Library

[56]

Moshe Y. Vardi. 1996. Implementing knowledge-based programs. In Proceedings of the 6th Conference on Theoretical Aspects of Rationality and Knowledge. 15--30.

Digital Library

[57]

J. Todd Wittbold and Dale M. Johnson. 1990. Information flow in nondeterministic systems. In Proceedings of the IEEE Symposium on Security and Privacy. 144--161.

Cited By

Bozzelli LMaubert BMurano A(2023)On the Complexity of Model Checking Knowledge and TimeACM Transactions on Computational Logic10.1145/363721225:1(1-42)Online publication date: 13-Dec-2023
https://dl.acm.org/doi/10.1145/3637212
Fu CTurrini AHuang XSong LFeng YZhang L(2023)Model Checking for Probabilistic Multiagent SystemsJournal of Computer Science and Technology10.1007/s11390-022-1218-638:5(1162-1186)Online publication date: 1-Sep-2023
https://dl.acm.org/doi/10.1007/s11390-022-1218-6
Huang XPeng BZhao XAlbrecht SWoolridge M(2022)Dependable learning-enabled multiagent systemsAI Communications10.3233/AIC-22012835:4(407-420)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.3233/AIC-220128
Show More Cited By

Index Terms

An Epistemic Strategy Logic
1. Security and privacy
  1. Formal methods and theory of security
    1. Formal security models
    2. Logic and verification
2. Theory of computation
  1. Logic
    1. Logic and verification
    2. Verification by model checking

Recommendations

Epistemic coalition logic: completeness and complexity
AAMAS '12: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2

Coalition logic is currently one of the most popular logics for multi-agent systems. While logics combining coalitional and epistemic operators have received considerable attention, completeness results for epistemic extensions of coalition logic have ...
First-Order Intuitionistic Epistemic Logic
Logic, Rationality, and Interaction
Abstract
Intuitionistic epistemic logic (IEL), introduced by Artemov and Protopopescu (2016), accepts the co-reflection axiom: “” in terms of Brouwer-Heyting-Kolmogorov interpretation. There are two variants for IEL, one of which has the axiom “”, while ...
A First-Order Expansion of Artemov and Protopopescu’s Intuitionistic Epistemic Logic
Abstract
Intuitionistic epistemic logic by Artemov and Protopopescu (Rev Symb Log 9:266–298, 2016) accepts the axiom “if A, then A is known” (written $A \supset K A$ ) in terms of the Brouwer–Heyting–Kolmogorov interpretation. There are two variants of intuitionistic ... $^{}$

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computational Logic

ACM Transactions on Computational Logic Volume 19, Issue 4

October 2018

277 pages

ISSN:1529-3785

EISSN:1557-945X

DOI:10.1145/3293495

Editor:
Orna Kupferman
School of Computer Science and Engineering, Hebrew University, Israel

Issue’s Table of Contents

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 November 2018

Accepted: 01 June 2018

Revised: 01 March 2018

Received: 01 November 2017

Published in TOCL Volume 19, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
182
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)2

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bozzelli LMaubert BMurano A(2023)On the Complexity of Model Checking Knowledge and TimeACM Transactions on Computational Logic10.1145/363721225:1(1-42)Online publication date: 13-Dec-2023
https://dl.acm.org/doi/10.1145/3637212
Fu CTurrini AHuang XSong LFeng YZhang L(2023)Model Checking for Probabilistic Multiagent SystemsJournal of Computer Science and Technology10.1007/s11390-022-1218-638:5(1162-1186)Online publication date: 1-Sep-2023
https://dl.acm.org/doi/10.1007/s11390-022-1218-6
Huang XPeng BZhao XAlbrecht SWoolridge M(2022)Dependable learning-enabled multiagent systemsAI Communications10.3233/AIC-22012835:4(407-420)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.3233/AIC-220128
Fisher MCardoso RCollins EDadswell CDennis LDixon CFarrell MFerrando AHuang XJump MKourtis GLisitsa ALuckcuck MLuo SPage VPapacchini FWebster M(2021)An Overview of Verification and Validation Challenges for Inspection RobotsRobotics10.3390/robotics1002006710:2(67)Online publication date: 29-Apr-2021
https://doi.org/10.3390/robotics10020067
Berthon RMaubert BMurano ARubin SVardi M(2021)Strategy Logic with Imperfect InformationACM Transactions on Computational Logic10.1145/342795522:1(1-51)Online publication date: 5-Jan-2021
https://dl.acm.org/doi/10.1145/3427955
Jiang GZhang DPerrussel LZhang H(2021)Epistemic GDL: A logic for representing and reasoning about imperfect information gamesArtificial Intelligence10.1016/j.artint.2021.103453294(103453)Online publication date: May-2021
https://doi.org/10.1016/j.artint.2021.103453
Belardinelli FLomuscio AMurano ARubin S(2020)Verification of multi-agent systems with public actions against strategy logicArtificial Intelligence10.1016/j.artint.2020.103302285(103302)Online publication date: Aug-2020
https://doi.org/10.1016/j.artint.2020.103302
Gardy PBouyer PMarkey N(2020)Dependences in Strategy LogicTheory of Computing Systems10.1007/s00224-019-09926-yOnline publication date: 8-Jan-2020
https://doi.org/10.1007/s00224-019-09926-y
Meyden R(2019)On the specification and verification of atomic swap smart contracts (extended abstract)2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)10.1109/BLOC.2019.8751250(176-179)Online publication date: May-2019
https://doi.org/10.1109/BLOC.2019.8751250

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Figures

Tables

Media

View Issue’s Table of Contents