COLOSS: The Coalgebraic Logic Satisfiability Solver
COLOSS, the Coalgebraic Logic Satisfiability Solver, decides
satisfiability of modal formulas in a generic and compositional way.
implements a uniform polynomial space algorithm to decide
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
coalgebraic semantics in a specific format. Moreover, COLOSS is
compositional: it synthesises decision procedures for modular
combinations of logics that include the fusion of two modal logics
as a special case.
One thus automatically obtains reasoning support
for logics interpreted over probabilistic automata that combine
non-determinism and probabilities in different ways.