info.html revision 0d33538fd320abea240aca0783641ac2333f4c0b
74b23191c8f49798f7513f324bbdbbe32f8a1db2Razvan Pascanu<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
74b23191c8f49798f7513f324bbdbbe32f8a1db2Razvan Pascanu<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
74b23191c8f49798f7513f324bbdbbe32f8a1db2Razvan Pascanu<link rel="stylesheet" href="main.css" type="text/css" />
74b23191c8f49798f7513f324bbdbbe32f8a1db2Razvan Pascanu 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 coalgebric semantics. This includes e.g. the logics K, KD, Pauly's coalition logic, graded modal logic, and probabilistic modal logic.
74b23191c8f49798f7513f324bbdbbe32f8a1db2Razvan Pascanu Logics are easily integrated into CoLoSS by providing a complete axiomatisation of their 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 e.g. for logics interpreted over probabilistic automata that combine non-determinism and probabilities in different ways.
74b23191c8f49798f7513f324bbdbbe32f8a1db2Razvan Pascanu G. Calin, R. Myers, D. Pattinson, L. Schröder - <a href="data/coloss.pdf">CoLoSS: The Coalgebraic Logic Satisfiability Solver</a>
0d33538fd320abea240aca0783641ac2333f4c0bGeorgel Calin The source files of the up-to-date prover can be downloaded <a href="data/GMP.tar.gz">here</a>.