Skip navigation
Skip navigation

CoLoSS: The Coalgebraic Logic Satisfiability Solver(System Description)

Calin, Georgel; Myers, Rob; Pattinson, Dirk; Schroder, Lutz


CoLoSS, the Coalgebraic Logic Satisfiability Solver, decides satisfiability of modal formulas in a generic and compositional way. It implements a uniform polynomial space algorithm to decide satisfiability for modal logics that are amenable to coalgebraic semantics. This includes e.g. the logics K, KD, Pauly's coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily integrated into CoLoSS by providing a complete axiomatisation of their coalgebraic semantics in a...[Show more]

CollectionsANU Research Publications
Date published: 2009
Type: Journal article
Source: Electronic Notes in Theoretical Computer Science
DOI: 10.1016/j.entcs.2009.02.028


File Description SizeFormat Image
01_Calin_CoLoSS:_The_Coalgebraic_Logic_2009.pdf234.76 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator