| Publication type: |
Article in Proceedings |
| Author: |
Corina Cirstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema |
| Editor: |
Samson Abramsky, Erol Gelenbe, Vladimiro Sassone |
| Title: |
Modal logics are coalgebraic |
| Book / Collection title: |
Visions of Computer Science, BCS International Academic Research Conference (BCS 2008) |
| Page(s): |
129 – 140 |
| Year published: |
2008 |
| Publisher: |
British Computer Society |
| Abstract: |
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 application contexts. Coalgebraic semantics, on the other hand, provides a uniform and encompassing view on the large variety of specific 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' firm belief that the systematic exploitation of this coalgebraic nature will not only have impact on
the field of modal logic itself but also
lead to significant progress in a number
of areas within computer science, such as knowledge representation
and concurrency/mobility.
|
| PDF Version: |
http://www.informatik.uni-bremen.de/~lschrode/papers/ModalCoalg.pdf |
| Keywords: |
Modal logic coalgebra knowledge representation automata modularity pi-calculus |
| Status: |
Reviewed |
| Last updated: |
18. 03. 2009 |
|
 |
