Complexity Results of STIT Fragments

We provide a Kripke semantics for a STIT logic with the “next” operator. As the atemporal group STIT is undecidable and unaxiomatizable, we are interested in strict fragments of atemporal group STIT. First we prove that the satisfiability problem of a formula of the fragment made up of individual coalitions plus the grand coalition is also NEXPTIME-complete. We then generalize this result to a fragment where coalitions are in a given lattice. We also prove that if we restrict the language to nested coalitions the satisfiability problem is NP-complete if the number of agents is fixed and PSPACEcomplete if the number of agents is variable. Finally we embed individual STIT with the “next” operator into a fragment of atemporal group STIT.

[1]  Emiliano Lorini,et al.  A Dynamic Logic of Agency I: STIT, Capabilities and Powers , 2010, J. Log. Lang. Inf..

[2]  Andreas Herzig,et al.  Properties of logics of individual and group agency , 2008, Advances in Modal Logic.

[3]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[4]  J. Horty.  Agency and Deontic Logic , 2001 .

[5]  Jan M. Broersen,et al.  A Logical Analysis of the Interaction between 'Obligation-to-do' and 'Knowingly Doing' , 2008, DEON.

[6]  Emiliano Lorini,et al.  A Logical Analysis of Commitment Dynamics , 2010, DEON.

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

[8]  Brian F. Chellas.  Time and modality in the logic of agency , 1992, Stud Logica.

[9]  Ming Xu,et al.  Axioms for Deliberative Stit , 1998, J. Philos. Log..

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

[11]  Michael Wooldridge,et al.  ATL Satisfiability is Indeed EXPTIME-complete , 2006, J. Log. Comput..

[12]  N. Belnap,et al.  Facing the Future: Agents and Choices in Our Indeterminist World , 2001 .

[13]  Heinrich Wansing,et al.  Tableaux for multi-agent deliberative-stit logic , 2006, Advances in Modal Logic.

[14]  Pierre-Yves Schobbens,et al.  Alternating-time logic with imperfect recall , 2004, LCMAS.

[15]  Andreas Herzig,et al.  Embedding Alternating-time Temporal Logic in Strategic STIT Logic of Agency , 2006, J. Log. Comput..

[16]  Stefan Wölfl.  Propositional Q-Logic , 2002, J. Philos. Log..

[17]  Wojciech Jamroga,et al.  Constructive knowledge: what agents can achieve under imperfect information , 2007, J. Appl. Non Class. Logics.

[18]  Mark Reynolds,et al.  An axiomatization of PCTL* , 2005, Inf. Comput..

[19]  Jan M. Broersen,et al.  Deontic epistemic stit logic distinguishing modes of mens rea , 2011, J. Appl. Log..

[20]  Jan M. Broersen,et al.  A Complete STIT Logic for Knowledge and Action, and Some of Its Applications , 2008, DALT.

[21]  Emiliano Lorini,et al.  A New Look at the Semantics and Optimization Methods of CP-Networks , 2003, IJCAI.

[22]  Andreas Herzig,et al.  ALTERNATIVE AXIOMATICS AND COMPLEXITY OF DELIBERATIVE STIT THEORIES , 2007, J. Philos. Log..

[23]  Yde Venema,et al.  Advances in Modal Logic, Volume 6 , 2006 .

[24]  Nuel Belnap,et al.  The deliberative stit: A study of action, omission, ability, and obligation , 1995, J. Philos. Log..

[25]  Dimiter Vakarelov.  A Modal Theory of Arrows. Arrow Logics I , 1992, JELIA.