Reasoning about Strategies: on the Satisfiability Problem

Strategy Logic (SL, for short) has been introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games. This logic turns out to be very powerful, subsuming all major previously studied modal logics for strategic reasoning, including ATL, ATL*, and the like. Unfortunately, due to its high expressiveness, SL has a non-elementarily decidable model-checking problem and the satisfiability question is undecidable, specifically Sigma_1^1. In order to obtain a decidable sublogic, we introduce and study here One-Goal Strategy Logic (SL[1G], for short). This is a syntactic fragment of SL, strictly subsuming ATL*, which encompasses formulas in prenex normal form having a single temporal goal at a time, for every strategy quantification of agents. We prove that, unlike SL, SL[1G] has the bounded tree-model property and its satisfiability problem is decidable in 2ExpTime, thus not harder than the one for ATL*.

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

[2]  Dana Fisman,et al.  Rational Synthesis , 2009, TACAS.

[3]  Alessio Lomuscio,et al.  Verifying and Synthesising Multi-Agent Systems against One-Goal Strategy Logic Specifications , 2015, AAAI.

[4]  Giuseppe Perelli,et al.  Synthesis with rational environments , 2016, Annals of Mathematics and Artificial Intelligence.

[5]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6]  Nicolas Markey,et al.  Quantified CTL: Expressiveness and Model Checking - (Extended Abstract) , 2012, CONCUR.

[7]  Krishnendu Chatterjee,et al.  Doomsday Equilibria for Omega-Regular Games , 2013, VMCAI.

[8]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[9]  Moshe Y. Vardi.  Sometimes and Not Never Re-revisited: On Branching Versus Linear Time , 1998, CONCUR.

[10]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[11]  Nicolas Markey,et al.  ATL with Strategy Contexts: Expressiveness and Model Checking , 2010, FSTTCS.

[12]  Dirk Walther,et al.  On Satisfiability in ATL with Strategy Contexts , 2012, JELIA.

[13]  Michael Wooldridge,et al.  Reasoning about equilibria in game-like concurrent systems , 2014, Ann. Pure Appl. Log..

[14]  Giuseppe Perelli,et al.  Binding Forms in First-Order Logic , 2015, CSL.

[15]  Mikolaj Bojanczyk.  The finite graph problem for two-way alternating automata , 2003, Theor. Comput. Sci..

[16]  Aniello Murano,et al.  A Behavioral Hierarchy of Strategy Logic , 2014, CLIMA.

[17]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[18]  David E. Muller,et al.  Alternating Automata on Infinite Trees , 1987, Theor. Comput. Sci..

[19]  Wojciech Jamroga,et al.  Agents that Know How to Play , 2004, Fundam. Informaticae.

[20]  Aniello Murano,et al.  On the Boundary of Behavioral Strategies , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[21]  Michael Wooldridge,et al.  Alternating-time temporal logic with explicit strategies , 2007, TARK '07.

[22]  David Chemouil,et al.  A logic with revocable and refinable strategies , 2015, Inf. Comput..

[23]  Wojciech Jamroga,et al.  Alternating-time temporal logics with irrevocable strategies , 2007, TARK '07.

[24]  Larry J. Stockmeyer,et al.  Improved upper and lower bounds for modal logics of programs , 1985, STOC '85.

[25]  Sven Schewe.  ATL* Satisfiability Is 2EXPTIME-Complete , 2008, ICALP.

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

[27]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[28]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[29]  E. Allen Emerson,et al.  The Complexity of Tree Automata and Logics of Programs , 1999, SIAM J. Comput..

[30]  David E. Muller,et al.  Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra , 1995, Theor. Comput. Sci..

[31]  Johan van Benthem,et al.  Reasoning about Strategies , 2013, Computation, Logic, Games, and Quantum Foundations.

[32]  Stephan Merz,et al.  Model Checking , 2000 .

[33]  Aniello Murano,et al.  Relentful strategic reasoning in alternating-time temporal logic , 2016, J. Log. Comput..

[34]  Wojciech Jamroga,et al.  On module checking and strategies , 2014, AAMAS.

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

[36]  Saul A. Kripke,et al.  Semantical Considerations on Modal Logic , 2012 .

[37]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[38]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[39]  Farn Wang,et al.  Model-checking iterated games , 2013, Acta Informatica.

[40]  Nicolas Markey,et al.  ATL with Strategy Contexts and Bounded Memory , 2009, LFCS.

[41]  Wojciech Jamroga,et al.  Comparing variants of strategic ability: how uncertainty and memory influence general properties of games , 2014, Autonomous Agents and Multi-Agent Systems.

[42]  Y. Gurevich.  On Finite Model Theory , 1990 .

[43]  Sophie Pinchinat.  A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies , 2007, ATVA.

[44]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[45]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[46]  Farn Wang,et al.  A Temporal Logic for the Interaction of Strategies , 2011, CONCUR.

[47]  Jürgen Dix,et al.  Reasoning about temporal properties of rational play , 2008, Annals of Mathematics and Artificial Intelligence.

[48]  Krishnendu Chatterjee,et al.  Strategy logic , 2007, Inf. Comput..

[49]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[50]  Hao Wang.  Proving theorems by pattern recognition — II , 1961 .

[51]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[52]  Aniello Murano,et al.  What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic , 2012, CONCUR.

[53]  Emiliano Lorini,et al.  Reasoning about Actions Meets Strategic Logics , 2013, LORI.

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

[55]  Francesco Belardinelli,et al.  Reasoning about Knowledge and Strategies: Epistemic Strategy Logic , 2014, SR.

[56]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[57]  David Chemouil,et al.  Towards an Updatable Strategy Logic , 2013, SR.

[58]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[59]  Bernd Finkbeiner,et al.  Coordination Logic , 2010, CSL.