On Logics of Strategic Ability Based on Propositional Control

Recently logics for strategic ability have gained pre-eminence in the modelisation and analysis of game-theoretic scenarios. In this paper we provide a contribution to the comparison of two popular frameworks: Concurrent Game Structures (CGS) and Coalition Logic of Propositional Control (CL-PC). Specifically, we ground the abstract abilities of agents in CGS on Propositional Control, thus obtaining a class of CGS that has the same expressive power as CL-PC. We study the computational properties of this setting. Further, we relax some of the assumptions of CL-PC so as to introduce a wider class of computationally-grounded CGS.

[1]  Michael Wooldridge,et al.  Knowledge and control , 2011, AAMAS.

[2]  Michael Wooldridge,et al.  Reasoning About Social Choice Functions , 2011, J. Philos. Log..

[3]  Y. Shoham.  Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge , 1996 .

[4]  Chak-Kuen Wong,et al.  On the Number of Comparisons to Find the Intersection of Two Relations , 1979, SIAM J. Comput..

[5]  Aniello Murano,et al.  Reasoning About Strategies: On the Model-Checking Problem , 2011, ArXiv.

[6]  V. Goranko.  Coalition games and alternating temporal logics , 2001 .

[7]  Michael Wooldridge,et al.  Reasoning About the Transfer of Control , 2014, J. Artif. Intell. Res..

[8]  Michael Wooldridge,et al.  On the logic of cooperation and propositional control , 2005, Artif. Intell..

[9]  Emiliano Lorini,et al.  Epistemic Boolean Games Based on a Logic of Visibility and Control , 2016, IJCAI.

[10]  Emiliano Lorini,et al.  A Poor Man's Epistemic Logic Based on Propositional Assignment and Higher-Order Observation , 2015, LORI.

[11]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[12]  Michael Wooldridge,et al.  Computationally grounded theories of agency , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[13]  Ulrich Endriss,et al.  A Syntactic Proof of Arrow's Theorem in a Modal Logic of Social Choice Functions , 2015, AAMAS.

[14]  Zakaria Maamar,et al.  Proceedings of the Workshop on Service-Oriented Computing and Agent Based Engineering (SOCABE 2006) held in conjunction with the 5th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2006), Hakodate, Japan, 08-12 May 2006 , 2006 .

[15]  Marc Pauly,et al.  A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

[16]  Nicolas Markey,et al.  On the Expressiveness and Complexity of ATL , 2007, FoSSaCS.

[17]  Michael Wooldridge,et al.  On the complexity of practical ATL model checking , 2006, AAMAS '06.

[18]  Ulrich Endriss,et al.  Lifting integrity constraints in binary aggregation , 2013, Artif. Intell..

[19]  Jan van Eijck,et al.  Symbolic Model Checking for Dynamic Epistemic Logic , 2015, LORI.

[20]  J. Dix,et al.  Model Checking Logics of Strategic Ability: Complexity* , 2010 .

[21]  Andreas Herzig,et al.  DL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE , 2014, ArXiv.

[22]  Wojciech Jamroga,et al.  Comparing Semantics of Logics for Multi-Agent Systems , 2004, Synthese.

[23]  Emiliano Lorini,et al.  Building Epistemic Logic from Observations and Public Announcements , 2016, KR.

[24]  Andreas Herzig,et al.  Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[25]  Alessio Lomuscio,et al.  MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications , 2014, CAV.

[26]  Emiliano Lorini,et al.  A Dynamic Logic of Normative Systems , 2011, IJCAI.