Reasoning with global assumptions in arithmetic modal logics

Clemens Kupke, Dirk Pattinson, Lutz Schröder

Research output: Contribution to conferencePaper

1 Citation (Scopus)
57 Downloads (Pure)

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.
Original languageEnglish
Pages367-380
Number of pages14
DOIs
Publication statusPublished - 4 Aug 2015
Event20th International Symposium on Fundamentals of Computation Theory - Gdansk, Poland, Poland
Duration: 17 Aug 201519 Aug 2015

Conference

Conference20th International Symposium on Fundamentals of Computation Theory
CountryPoland
CityGdansk, Poland
Period17/08/1519/08/15

Keywords

  • coalgebraic modal logic
  • elimination algorithm
  • a global caching algorithm

Fingerprint Dive into the research topics of 'Reasoning with global assumptions in arithmetic modal logics'. Together they form a unique fingerprint.

  • Cite this

    Kupke, C., Pattinson, D., & Schröder, L. (2015). Reasoning with global assumptions in arithmetic modal logics. 367-380. Paper presented at 20th International Symposium on Fundamentals of Computation Theory, Gdansk, Poland, Poland. https://doi.org/10.1007/978-3-319-22177-9_28