Reasoning with global assumptions in arithmetic modal logics

DOI10.1007/978-3-319-22177-9_28MaRDI QIDQ2947894zbMATH OpenOpenAlexFDO

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/

Mathematics Subject Classification ID

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

Recommendations

• Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics
• Optimal tableau algorithms for coalgebraic logics
• Global caching for coalgebraic description logics
• On modal logics of linear inequalities
• Presburger Modal Logic Is PSPACE-Complete

Cites work

• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• scientific article; zbMATH DE number 1414365 (Why is no real title available?)
• A finite model construction for coalgebraic modal logic
• A logic for reasoning about probabilities
• An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description)
• Bisimulation through probabilistic testing
• Carathéodory bounds for integer cones
• Coalgebraic Hybrid Logic
• Complexity of modal logics with Presburger constraints
• Counting in trees
• ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
• Finality regained: A coalgebraic study of Scott-sets and multisets
• In so many possible worlds
• Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
• On modal logics of linear inequalities
• On the complexity of integer programming
• Optimal tableau algorithms for coalgebraic logics
• PSPACE bounds for rank-1 modal logics
• Presburger Modal Logic Is PSPACE-Complete
• Probability logic for type spaces
• Reasoning about knowledge and probability
• Using the Universal Modality: Gains and Questions

Cited in

(4)

• On regular paths with counting and data tests
• One-variable logic meets Presburger arithmetic
• Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics
• Optimal tableau algorithms for coalgebraic logics

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)