Skip to main content Skip to main navigation

Project

GenMod

Generic Algorithms and Complexity Bounds in Coalgebraic Modal Logic

  • Duration:
  • Research Topics
    Other
  • Application fields
    Other

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).

Sponsors

DFG - German Research Foundation

SCHR 1118/65-1

DFG - German Research Foundation

Share project:

Keyfacts

Publications about the project

Modular Algorithms for Heterogeneous Modal Logics via Multi-Sorted Coalgebra

Lutz Schröder; Dirk Pattinson

In: Mathematical Structures in Computer Science (MSCS), Vol. 21, No. 2, Pages 235-266, Cambridge University Press, Cambridge, 3/2011.

To the publication

Description Logics and Fuzzy Probability

Lutz Schröder; Dirk Pattinson

In: Toby Walsh (Hrsg.). 22nd International Joint Conference on Artificial Intelligence. International Joint Conference on Artificial Intelligence (IJCAI-2011), July 16-22, Barcelona, Spain, AAAI Press, Menlo Park, CA, 2011.

To the publication

Cut Elimination in Coalgebraic Logics

Dirk Pattinson; Lutz Schröder

In: Information and Computation (Inform. Comput.), Vol. 208, Pages 1447-1468, Elsevier, Amsterdam, 12/2010.

To the publication
All publications