We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...
Abstract. The purpose of this note is to present and evaluate the options available to a researcher wishing to use logic for representation, reasoning and computation in his applic...
We build on existing work on finitary modular coalgebraic logics [3,4], which we extend with general fixed points, including CTL- and PDL-like fixed points, and modular evaluation...
We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notio...
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...