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 …

We propose a family of probabilistic description logics (DLs) that are derived in a principled
way from Halpern's probabilistic first-order logic. The resulting probabilistic DLs have a two …

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 …

There is a wide range of modal logics whose semantics goes beyond relational structures,
and instead involves, eg, probabilities, multi-player games, weights, or neighbourhood …

This article investigates expressivity of modal logics for transition systems, multitransition
systems, Markov chains and Markov processes, as coalgebras of the powerset, finitely …

Coalgebraic modal logic serves as a unifying framework to study a wide range of modal
logics beyond the relational realm, including probabilistic and graded logics as well as …

Coalgebras for a functor model different types of transition systems in a uniform way. This
paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular …

We set up a generic framework for proving completeness results for variants of the modal mu-
calculus, using tools from coalgebraic modal logic. We illustrate the method by proving two …

As part of a general research programme into the expressive power of different
generalisations of the sequent framework we investigate hypersequent calculi given by rules …