The Coalgebraic Logic Satisability Solver (System Description)
Georgel Calin, Rob Myers, Dirk Pattinson, Lutz Schröder · 2007
CoLoSS, the Coalgebraic Logic Satisability Solver, decides satisability of modal formulas in a generic and compositional way. It implements a uniform polynomial space algorithm to decide satisability 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 specic 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 e.g. for logics interpreted over probabilistic automata that combine non-determinism and probabilities in dierent ways.