CoLoSS: The Coalgebraic Logic Satisfiability Solver(System Description)
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]
|Collections||ANU Research Publications|
|Source:||Electronic Notes in Theoretical Computer Science|
|01_Calin_CoLoSS:_The_Coalgebraic_Logic_2009.pdf||234.76 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.