Skip to main content
SpringerLink
Log in

Complexity Results of STIT Fragments

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alur, R., T. A. Henzinger, and O. Kupferman, Alternating-time temporal logic. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, Florida, October 1997.

  2. Balbiani P., Herzig A., Troquard N.: Alternative axiomatics and complexity of deliberative STIT theories. Journal of Philosophical Logic 37(4), 387–406 (2008)

    Article  Google Scholar 

  3. Belnap N., Perloff M., Xu M.: Facing the Future: Agents and Choices in Our Indeterminist World. Oxford University Press, Oxford (2001)

    Google Scholar 

  4. Blackburn P., de Rijke M., Venema Y.: Modal Logic, volume 53 of Cambridge Tracts in Theoretical Computer Scie. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  5. Broersen, J., Deontic Epistemic stit Logic Distinguishing Modes of ‘Mens Rea’ (forthcoming), Journal of Applied Logic.

  6. Broersen, J., A logical analysis of the interaction between ‘obligation-to-do’ and ‘knowingly doing’, Deontic Logic in Computer Science, 2008, pp. 140–154.

  7. Broersen, J., A complete stit logic for knowledge and action, and some of its applications. Declarative Agent Languages and Technologies VI, 2009, pp. 47–59.

  8. Broersen J., Herzig A., Troquard N.: Embedding Alternating-time Temporal Logic in strategic STIT logic of agency.. Journal of Logic and Computation 16(5), 559–578 (2006)

    Article  Google Scholar 

  9. Chellas , Brian F.: Time and modality in the logic of agency. Studia Logica 51(3/4), 485–518 (1992)

    Article  Google Scholar 

  10. Herzig A., Lorini E.: A Dynamic Logic of Agency I: STIT, Capabilities and Powers. Journal of Logic, Language and Information 19(1), 89–121 (2010)

    Article  Google Scholar 

  11. Herzig, A., and F. Schwarzentruber, Properties of logics of individual and group agency. In Advances in Modal Logic, 2008, pp. 133–149.

  12. Horty J., Belnap N.: The deliberative stit: a study of action, omission, ability and obligation. Journal of Philosophical Logic 24(6), 583–644 (1995)

    Article  Google Scholar 

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

  14. Jamroga W., Ågotnes T.: Constructive knowledge: What agents can achieve under incomplete information.. Journal of Applied Non-Classical Logics 17(4), 423–475 (2007)

    Article  Google Scholar 

  15. Ladner R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM J. on Computing 6(3), 467–480 (1977)

    Article  Google Scholar 

  16. Lorini, E., A logical analysis of commitment dynamics. Deontic Logic in Computer Science, 2010, pp. 288–305.

  17. Lorini, E., and F. Schwarzentruber, A logic for reasoning about counterfactual emotions, In IJCAI, 2009, pp. 867–872.

  18. Lorini E., Schwarzentruber F.: A logic for reasoning about counterfactual emotions. Artif. Intell 175(3-4), 814–847 (2011)

    Article  Google Scholar 

  19. Papadimitriou, C. H., Computational complexity, John Wiley and Sons Ltd., 2003.

  20. Pauly M.: A modal logic for coalitional power in games. Journal of Logic and Computation 12(1), 149–166 (2002)

    Article  Google Scholar 

  21. Reynolds M.: An axiomatization of PCTL. Inf. Comput. 201(1), 72–119 (2005)

    Article  Google Scholar 

  22. Schobbens P.Y.: Alternating-time logic with imperfect recall. Electronic Notes in Theoretical Computer Science 85(2), 82–93 (2004)

    Article  Google Scholar 

  23. Vakarelov, D., A modal theory of arrows. Arrow logics I, Logics in AI, 1992, pp. 1–24.

  24. Walther D., Lutz C., Wolter F., Wookdridge M.: ATL satisfiability is indeed exptime-complete. Journal of Logic and Computation 16, 765–787 (2006)

    Article  Google Scholar 

  25. Wansing, H., Tableaux for multi-agent deliberative-STIT logic, In Guido Governatori, Ian Hodkinson, and Yde Venema, (eds.), Advances in Modal Logic, Volume 6. King’s College Publications, 2006, pp. 503–520.

  26. Wölfl S.: Propositional Q-logic. Journal of Philosophical Logic 31, 387–414 (2002)

    Article  Google Scholar 

  27. Xu M.: Axioms for deliberative STIT. Journal of Philosophical Logic 27, 505–552 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École Normale Supérieure de Cachan, Cachan, France

    François Schwarzentruber

Authors
  1. François Schwarzentruber
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to François Schwarzentruber.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schwarzentruber, F. Complexity Results of STIT Fragments. Stud Logica 100, 1001–1045 (2012). https://doi.org/10.1007/s11225-012-9445-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-012-9445-4

Keywords

Search

Navigation