Complexity results of STIT fragments
From MaRDI portal
Publication:1928487
DOI10.1007/s11225-012-9445-4zbMath1283.03036OpenAlexW1988824527MaRDI QIDQ1928487
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
Logics of knowledge and belief (including belief change) (03B42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Combinations of \textit{stit} with \textit{ought} and \textit{know} ⋮ A STIT logic for reasoning about social influence ⋮ Temporal logic and its application to normative reasoning ⋮ Decidability of logics based on an indeterministic metric tense logic ⋮ Decidability of an Xstit logic ⋮ Stit semantics for epistemic notions based on information disclosure in interactive settings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logic for reasoning about counterfactual emotions
- Deontic epistemic stit logic distinguishing modes of mens rea
- Alternative axiomatics and complexity of deliberative STIT theories
- Time and modality in the logic of agency
- Axioms for deliberative stit
- On the complexity of single-rule datalog queries.
- Propositional \(\text Q\)-logic
- The deliberative stit: A study of action, omission, ability, and obligation
- A dynamic logic of agency. I: STIT, capabilities and powers
- An axiomatization of PCTL*
- Embedding Alternating-time Temporal Logic in Strategic Logic of Agency
- ATL Satisfiability is Indeed EXPTIME-complete
- Alternating-time temporal 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
- Constructive knowledge: what agents can achieve under imperfect information
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- A Modal Logic for Coalitional Power in Games
- A Logical Analysis of Commitment Dynamics
This page was built for publication: Complexity results of STIT fragments