148 search results - page 7 / 30 » On the Fusion of Coalgebraic Logics |
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the
IANDC
2010
13 years 6 months ago
2010
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
Coalgebras provide a uniform framework for the semantics of a large class of (mostly non-normal) modal logics, including e.g. monotone modal logic, probabilistic and graded modal l...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has previously been shown that the class of
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...