| Art der Veröffentlichung: |
Artikel in Konferenzband |
| Autor: |
Georgel Calin, Rob Myers, Dirk Pattinson, Lutz Schröder |
| Herausgeber: |
Carlos Areces, Stephane Demri |
| Titel: |
CoLoSS: The Coalgebraic Logic Satisfiability Solver (System Description) |
| Buch / Sammlungs-Titel: |
Methods for Modalities (M4M-5, 2007) |
| Band: |
231 |
| Seite(n): |
41 – 54 |
| Serie / Reihe: |
Electronic Notes in Theoretical Computer Science |
| Erscheinungsjahr: |
2009 |
| Verleger: |
Elsevier Science |
| Abstract / Kurzbeschreibung: |
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.
|
| PDF Version: |
http://www.informatik.uni-bremen.de/~lschrode/papers/coloss.pdf |
| Schlagworte: |
modal logic satisfiability automatic proving logic composition coalgebra |
| Status: |
Reviewed |
| Letzte Aktualisierung: |
27. 03. 2009 |
