The complexity of one-agent refinement modal logic
From MaRDI portal
Publication:744988
DOI10.1016/J.TCS.2015.07.015zbMATH Open1347.03041OpenAlexW2173381095MaRDI QIDQ744988FDOQ744988
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
Recommendations
Modal logic (including the logic of norms) (03B45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Modal logic
- Undecidability for arbitrary public announcement logic
- Alternating-time temporal logic
- Title not available (Why is that?)
- A Decision Procedure for the First Order Theory of Real Addition with Order
- Propositional quantifiers in modal logic1
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternation
- Future event logic -- axioms and complexity
- `Knowable' as `known after an announcement'
- Simulation and Information: Quantifying over Epistemic Events
- The complexity of logical theories
- Title not available (Why is that?)
- The complexity of one-agent refinement modal logic
- A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
Cited In (7)
- Title not available (Why is that?)
- 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)
