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.

[img]
Preview
 Text (Kupke-etal-CT2015-reasoning-global-assumptions-arithmetic-modal-logics)
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.

    Creators(s): Kupke, Clemens, Pattinson, Dirk and Schröder, Lutz;
    Item type:Conference or Workshop Item(Paper)
    ID code:54523
    Keywords:coalgebraic modal logic, elimination algorithm, a global caching algorithm, Mathematics, Computational Mathematics, Computer Science(all)
    Subjects:Science > Mathematics
    Department:Faculty of Science > Computer and Information Sciences
    Depositing user: Pure Administrator
    Date deposited:09 Oct 2015 12:06
    Last modified:29 Mar 2020 02:39
    Related URLs:
    URI:https://strathprints.strath.ac.uk/id/eprint/54523
    Export data:
    CORE (COnnecting REpositories)