Reasoning with global assumptions in arithmetic modal logics
Kupke, Clemens and Pattinson, Dirk and Schröder, Lutz (2015) Reasoning with global assumptions in arithmetic modal logics. In: 20th International Symposium on Fundamentals of Computation Theory, 2015-08-17 - 2015-08-19. (https://doi.org/10.1007/978-3-319-22177-9_28)
Preview |
Text.
Filename: Kupke_etal_CT2015_reasoning_global_assumptions_arithmetic_modal_logics.pdf
Accepted Author Manuscript Download (337kB)| Preview |
Abstract
We establish a generic upper bound ExpTime for reasoning with global assumptions in coalgebraic modal logics. Unlike earlier results of this kind, we do not require a tractable set of tableau rules for the in- stance logics, so that the result applies to wider classes of logics. Examples are Presburger modal logic, which extends graded modal logic with linear inequalities over numbers of successors, and probabilistic modal logic with polynomial inequalities over probabilities. We establish the theoretical upper bound using a type elimination algorithm. We also provide a global caching algorithm that offers potential for practical reasoning.
-
-
Item type: Conference or Workshop Item(Paper) ID code: 54523 Dates: DateEvent4 August 2015Published4 June 2015AcceptedSubjects: Science > Mathematics Department: Faculty of Science > Computer and Information Sciences Depositing user: Pure Administrator Date deposited: 09 Oct 2015 12:06 Last modified: 11 Aug 2024 19:38 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/54523