Login
Home > Research > EPrints

Modal Logics are Coalgebraic

Cirstea, Corina, Kurz, Alexander, Pattinson, Dirk, Schröder, Lutz and Venema, Yde, Sassone, Vladimiro (ed.) (2011) Modal Logics are Coalgebraic. The Computer Journal, 54, 31-41.

[file icon]PDF - Submitted Version
209Kb

Description/Abstract

Applications of modal logics are abundant in computer science, and a large number of structurally dierent modal logics have been successfully employed in a diverse spectrum of application contexts. Coalgebraic semantics, on the other hand, provides a uniform and encompassing view on the large variety of specic logics used in particular domains. The coalgebraic approach is generic and compositional: tools and techniques simultaneously apply to a large class of application areas and can moreover be combined in a modular way. In particular, this facilitates a pick-and-choose approach to domain specific formalisms, applicable across the entire scope of application areas, leading to generic software tools that are easier to design, to implement, and to maintain. This paper substantiates the authors' rm belief that the systematic exploitation of the coalgebraic nature of modal logic will not only have impact on the field of modal logic itself but also lead to signicant progress in a number of areas within computer science, such as knowledge representation and concurrency/mobility.

Item Type:Article
Uncontrolled Keywords:modal logic; coalgebra; knowledge representation; concurrency; compositionality; automata theory
Divisions:Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science
Faculty of Physical and Applied Science > Electronics and Computer Science > Electronic & Software Systems
ePrint ID:267144
Deposited On:27 Feb 2009 16:17
Last Modified:02 Mar 2012 12:21
Further Information:Google Scholar

Associated Staff Only: edit my ePrint