Skip to main content Skip to main navigation

Project | GenMod

Duration:

Generic Algorithms and Complexity Bounds in Coalgebraic Modal Logic

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

Publications about the project

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

Sponsors

DFG - German Research Foundation

SCHR 1118/65-1

DFG - German Research Foundation