Complexity Results of STIT Fragments

  • Authors:
  • François Schwarzentruber

  • Affiliations:
  • École Normale Supérieure de Cachan, Cachan, France

  • Venue:
  • Studia Logica
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.