Generic Algorithms and Complexity Bounds in Coalgebraic Modal Logic

This project is concerned with the extension of existing generic algorithmic methods in coalgebraic modal logic, conceived as a generic semantic framework for modal logics in a broad sense. Moreover, the algorithms obtained will be implemented in an experimental tool extending the existing Coalgebraic Logic Satisfiability Solver (CoLoSS).

Duration: Oct 1, 2007 - Sep 30, 2009
Research area: Software Systems  

Publications within the Project

last updated 08/02/2017
to top