Reasoning with Global Assumptions in Arithmetic Modal Logics

DOI10.1007/978-3-319-22177-9_28zbMath1436.03136OpenAlexW2207337225MaRDI QIDQ2947894

Clemens Kupke, Lutz Schröder, Dirk Pattinson

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/

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45)

Related Items

On regular paths with counting and data tests, One-variable logic meets Presburger arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
• Bisimulation through probabilistic testing
• Finality regained: A coalgebraic study of Scott-sets and multisets
• A logic for reasoning about probabilities
• Carathéodory bounds for integer cones
• In so many possible worlds
• Complexity of modal logics with Presburger constraints
• A finite model construction for coalgebraic modal logic
• PSPACE bounds for rank-1 modal logics
• Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
• An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description)
• Optimal Tableau Algorithms for Coalgebraic Logics
• Presburger Modal Logic Is PSPACE-Complete
• Coalgebraic Hybrid Logic
• On the complexity of integer programming
• Using the Universal Modality: Gains and Questions
• Reasoning about knowledge and probability
• Probability logic for type spaces