Coalgebras can be seen as a natural abstraction of Kripke frames. In the same sense,
coalgebraic logics are generalised modal logics. In this paper, we give an overview of the …

Applications of modal logics are abundant in computer science, and a large number of
structurally different modal logics have been successfully employed in a diverse spectrum of …

For lack of general algorithmic methods that apply to wide classes of logics, establishing a
complexity bound for a given modal logic is often a laborious task. The present work is a …

We present an overview of linear-time temporal logics with Presburger constraints whose
models are sequences of tuples of integers. Such formal specification languages are well …

In recent years, a tight connection has emerged between modal logic on the one hand and
coalgebras, understood as generic transition systems, on the other hand. Here, we prove …

We introduce the Extended Modal Logic EML with regularity constraints and full Presburger
constraints on the number of children that generalize graded modalities, also known as …

Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has
previously been shown that the class of coalgebras for an endofunctor can always be …

Modal logics see a wide variety of applications in artificial intelligence, eg in reasoning
about knowledge, belief, uncertainty, agency, defaults, and relevance. From the perspective …

We introduce a generic framework for hybrid logics, ie modal logics additionally featuring
nominals and satisfaction operators, thus providing the necessary facilities for reasoning …

We consider probabilistic modal logic, graded modal logic and stochastic modal logic,
where linear inequalities may be used to express numerical constraints between quantities …