The complexity of one-agent refinement modal logic

DOI10.1016/j.tcs.2015.07.015zbMath1347.03041OpenAlexW2173381095MaRDI QIDQ744988

Laura Bozzelli, Sophie Pinchinat, Hans P. van Ditmarsch

Publication date: 12 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.015

zbMATH Keywords

modal logiccomplexity of satisfiabilitybisimulation quantifiers

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

On Composing Finite Forests with Modal Logics ⋮ Model checking interval temporal logics with regular expressions ⋮ To be announced ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of logical theories
• The Complexity of One-Agent Refinement Modal Logic
• Alternating-time temporal logic
• A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
• ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
• Simulation and Information: Quantifying over Epistemic Events
• Alternation
• A Decision Procedure for the First Order Theory of Real Addition with Order
• Propositional quantifiers in modal logic1

This page was built for publication: The complexity of one-agent refinement modal logic