Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics

Abstract

We establish a generic upper bound ExpTime for reasoning with global assumptions (also known as TBoxes) in coalgebraic modal logics. Unlike earlier results of this kind, our bound does 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 potentially avoids building the entire exponential-sized space of candidate states, and thus offers a basis for practical reasoning. This algorithm still involves frequent fixpoint computations; we show how these can be handled efficiently in a concrete algorithm modelled on Liu and Smolka’s linear-time fixpoint algorithm. Finally, we show that the upper complexity bound is preserved under adding nominals to the logic, i.e., in coalgebraic hybrid logic.

How to Tell Easy from Hard: Complexities of Conjunctive Query Entailment in Extensions of ALC

“…The first part of the statement follows by a minor adaptation of a proof by Bonatti et al (2008, Theorem 3.3) (a self-contained proof can be obtained by employing sufficient conditions presented in Section 4). The second claim follows from a work of Kupke et al (2022), presented under a very general, co-algebraic setting.…”