Reasoning with global assumptions in arithmetic modal logics
From MaRDI portal
Publication:2947894
DOI10.1007/978-3-319-22177-9_28zbMATH Open1436.03136OpenAlexW2207337225MaRDI QIDQ2947894FDOQ2947894
Authors: Clemens Kupke, Dirk Pattinson, Lutz Schröder 
Publication date: 29 September 2015
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/54523/
Recommendations
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45)
Cites Work
- Carathéodory bounds for integer cones
- Using the Universal Modality: Gains and Questions
- Bisimulation through probabilistic testing
- Title not available (Why is that?)
- Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
- Reasoning about knowledge and probability
- Probability logic for type spaces
- A logic for reasoning about probabilities
- Title not available (Why is that?)
- On the complexity of integer programming
- A finite model construction for coalgebraic modal logic
- ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
- An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description)
- Finality regained: A coalgebraic study of Scott-sets and multisets
- In so many possible worlds
- Counting in trees
- PSPACE bounds for rank-1 modal logics
- Coalgebraic Hybrid Logic
- Presburger Modal Logic Is PSPACE-Complete
- On modal logics of linear inequalities
- Optimal tableau algorithms for coalgebraic logics
- Complexity of modal logics with Presburger constraints
Cited In (4)
This page was built for publication: Reasoning with global assumptions in arithmetic modal logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947894)
