by Georgel Calin, Rob Myers, Dirk Pattinson and Lutz Schröder
Abstract:
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 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.
Reference:
Georgel Calin, Rob Myers, Dirk Pattinson and Lutz Schröder: CoLoSS: The Coalgebraic Logic Satisfiability Solver (System Description), In Carlos Areces, Stephane Demri, eds.: Methods for Modalities (M4M-5, 2007), Electronic Notes in Theoretical Computer Science, vol. 231, pp. 41–54, Elsevier Science; http://www.elsevier.nl/, 2009. [preprint]
Bibtex Entry:
@InProceedings{CalinEA07,
author = {Georgel Calin and Rob Myers and Dirk Pattinson and Lutz Schr{\"o}der},
title = {CoLoSS: The Coalgebraic Logic Satisfiability Solver (System Description)},
year = {2009},
editor = {Carlos Areces and Stephane Demri},
booktitle = {Methods for Modalities (M4M-5, 2007)},
publisher = {Elsevier Science; http://www.elsevier.nl/},
series = {Electronic Notes in Theoretical Computer Science},
volume = {231},
pages = {41-54},
keywords = {modal logic satisfiability automatic proving logic composition coalgebra},
comment = { <a href = "http://www8.informatik.uni-erlangen.de/~schroeder/papers/coloss.pdf"> [preprint] </a>},
abstract = {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 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.
},
}