@inproceedings{f253a7386f0a418f9de6e68cab4b97f3,
title = "Reasoning with global assumptions in arithmetic modal logics",
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 instance 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.",
author = "Clemens Kupke and Dirk Pattinson and Lutz Schr{\"o}der",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 20th International Symposium on Fundamentals of Computation Theory, FCT 2015 ; Conference date: 17-08-2015 Through 19-08-2015",
year = "2015",
doi = "10.1007/978-3-319-22177-9_28",
language = "English",
isbn = "9783319221762",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "367--380",
editor = "Igor Walukiewicz and Adrian Kosowski",
booktitle = "Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Proceedings",
address = "Germany",
}