The Complexity of One-Agent Refinement Modal Logic

DOI10.1007/978-3-642-33353-8_10zbMath1361.68107OpenAlexW1557270390MaRDI QIDQ2915064

Laura Bozzelli, Sophie Pinchinat, Hans P. van Ditmarsch

Publication date: 21 September 2012

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33353-8_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Refinement modal logic ⋮ The complexity of one-agent refinement modal logic

Cites Work

• Characterizations of negative definability in 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
• μ-programs, uniform interpolation and bisimulation quantifiers for modal logics ★
• Alternation
• A Decision Procedure for the First Order Theory of Real Addition with Order
• Propositional quantifiers in modal logic1
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Complexity of One-Agent Refinement Modal Logic