CoLoSS: The Coalgebraic Logic Satisfiability Solver

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.

[1]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[2]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[3]  Dirk Pattinson,et al.  Modular Algorithms for Heterogeneous Modal Logics , 2007, ICALP.

[4]  Eric Pacuit,et al.  Majority Logic , 2004, KR.

[5]  Ian Horrocks,et al.  Optimizing Description Logic Subsumption , 1999, J. Log. Comput..

[6]  Aviad Heifetz,et al.  Probability Logic for Type Spaces , 2001, Games Econ. Behav..

[7]  Nicola Olivetti,et al.  CondLean: A Theorem Prover for Conditional Logics , 2003, TABLEAUX.

[8]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[9]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[10]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[11]  Dirk Pattinson,et al.  PSPACE Bounds for Rank-1 Modal Logics , 2006, LICS.

[12]  Peyton Jones,et al.  Haskell 98 language and libraries : the revised report , 2003 .

[13]  Marc Pauly,et al.  A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

[14]  Ulf Norell,et al.  Polytypic Programming in Haskell , 2003, IFL.

[15]  Ian Horrocks,et al.  FaCT++ Description Logic Reasoner: System Description , 2006, IJCAR.

[16]  Johan Jeuring,et al.  Polytypic Programming , 1996, Advanced Functional Programming.

[17]  Mark P. Jones,et al.  Type Classes with Functional Dependencies , 2000, ESOP.

[18]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[19]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

[20]  Yarden Katz,et al.  Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..

[21]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

[22]  Stéphane Demri,et al.  Presburger Modal Logic Is PSPACE-Complete , 2006, IJCAR.

[23]  Corina Cîrstea,et al.  Modular Construction of Modal Logics , 2004, CONCUR.