Open Research will be unavailable from 10.15am - 11am on Saturday 14th March 2026 AEDT due to scheduled maintenance.
 

Modal logics are coalgebraic

dc.contributor.authorCirstea, Corina
dc.contributor.authorKurz, Alexander
dc.contributor.authorPattinson, Dirk
dc.contributor.authorSchroder, Lutz
dc.contributor.authorVenema, Yde
dc.date.accessioned2015-12-13T22:41:15Z
dc.date.issued2011
dc.date.updated2016-02-24T09:32:49Z
dc.description.abstractApplications 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 the coalgebraic nature of modal logic 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.
dc.identifier.issn0010-4620
dc.identifier.urihttp://hdl.handle.net/1885/78429
dc.publisherOxford University Press
dc.sourceThe Computer Journal
dc.subjectKeywords: Application area; Application contexts; Coalgebraic; Coalgebraic semantics; Coalgebras; Compositionality; concurrency; Domain specific; Generic softwares; Large class; Modal logic; Scope of application; Tools and techniques; Automata theory; Computer scie automata theory; coalgebra; compositionality; concurrency; knowledge representation; modal logic
dc.titleModal logics are coalgebraic
dc.typeJournal article
local.bibliographicCitation.issue1
local.bibliographicCitation.lastpage41
local.bibliographicCitation.startpage31
local.contributor.affiliationCirstea, Corina, University of Southampton
local.contributor.affiliationKurz, Alexander, University of Leicester
local.contributor.affiliationPattinson, Dirk, College of Engineering and Computer Science, ANU
local.contributor.affiliationSchroder, Lutz, Universitat Bremen
local.contributor.affiliationVenema, Yde, Universiteit van Amsterdam
local.contributor.authoruidPattinson, Dirk, u4762643
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.identifier.absfor080203 - Computational Logic and Formal Languages
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
local.identifier.ariespublicationf5625xPUB7078
local.identifier.citationvolume54
local.identifier.doi10.1093/comjnl/bxp004
local.identifier.scopusID2-s2.0-78649776531
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
01_Cirstea_Modal_logics_are_co_2011.pdf
Size:
160.76 KB
Format:
Adobe Portable Document Format