Complexity results of STIT fragments

DOI10.1007/S11225-012-9445-4zbMATH Open1283.03036OpenAlexW1988824527MaRDI QIDQ1928487FDOQ1928487

Authors: François Schwarzentruber 

Publication date: 3 January 2013

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-012-9445-4

Recommendations

• Properties of logics of individual and group agency
• Alternative axiomatics and complexity of deliberative STIT theories
• On the basic logic ofSTITwith a single agent
• From coalition logic to STIT
• Comparing semantics for temporal STIT logic

zbMATH Keywords

complexityaxiomatizationSTIT logicKripke structuresatisfiability problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logics of knowledge and belief (including belief change) (03B42)

Cites Work

• Modal logic
• Alternating-time temporal logic
• Time and modality in the logic of agency
• Axioms for deliberative stit
• Propositional \(\text Q\)-logic
• The deliberative stit: A study of action, omission, ability, and obligation
• Properties of logics of individual and group agency
• Embedding Alternating-time Temporal Logic in Strategic Logic of Agency
• Tableaux for multi-agent deliberative-stit logic
• A Logical Analysis of the Interaction between ‘Obligation-to-do’ and ‘Knowingly Doing’
• A Complete STIT Logic for Knowledge and Action, and Some of Its Applications
• A Modal Logic for Coalitional Power in Games
• Agency and deontic logic
• Deontic epistemic stit logic distinguishing modes of mens rea
• Alternative axiomatics and complexity of deliberative STIT theories
• On the complexity of single-rule datalog queries.
• An axiomatization of PCTL*
• A dynamic logic of agency. I: STIT, capabilities and powers
• A logic for reasoning about counterfactual emotions
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Constructive knowledge: what agents can achieve under imperfect information
• Title not available (Why is that?)
• ATL Satisfiability is Indeed EXPTIME-complete
• A logical analysis of commitment dynamics

Cited In (15)

• Combinations of \textit{stit} with \textit{ought} and \textit{know}
• Stit logics, games, knowledge, and freedom
• Decidability of stit theory with a single agent and Refref equivalence
• Restricted interpolation and lack thereof in stit logic
• A STIT logic for reasoning about social influence
• Properties of logics of individual and group agency
• A logic for reasoning about counterfactual emotions
• Decidability of an Xstit logic
• Decidability of logics based on an indeterministic metric tense logic
• Stit semantics for epistemic notions based on information disclosure in interactive settings
• Deontic STIT logic, from logical paradox to security policy
• Temporal STIT logic and its application to normative reasoning
• Comparing semantics for temporal STIT logic
• Uncompactness of stit logics containing generalized refref conditionals
• Probabilistic stit logic and its decomposition

This page was built for publication: Complexity results of STIT fragments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928487)