The complexity of one-agent refinement modal logic

DOI10.1016/J.TCS.2015.07.015MaRDI QIDQ744988zbMATH OpenOpenAlexFDO

Authors Laura Bozzelli, Sophie Pinchinat, Hans 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)

Recommendations

• The complexity of one-agent refinement modal logic
• Refinement modal logic
• Refinement quantified logics of knowledge
• scientific article; zbMATH DE number 1500520
• On Modal Refinement and Consistency

Cites work

• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• scientific article; zbMATH DE number 2038749 (Why is no real title available?)
• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• A Decision Procedure for the First Order Theory of Real Addition with Order
• A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
• Alternating-time temporal logic
• Alternation
• Future event logic -- axioms and complexity
• Modal logic
• Propositional quantifiers in modal logic1
• Simulation and Information: Quantifying over Epistemic Events
• The complexity of logical theories
• The complexity of one-agent refinement modal logic
• Undecidability for arbitrary public announcement logic
• `Knowable' as `known after an announcement'

Cited in

(7)

• scientific article; zbMATH DE number 7577569 (Why is no real title available?)
• On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions
• To be announced
• Model checking interval temporal logics with regular expressions
• Refinement modal logic
• The complexity of one-agent refinement modal logic
• On Composing Finite Forests with Modal Logics

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

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