386 search results - page 6 / 78 » Coalgebraic Hybrid Logic |
ENTCS
2008
13 years 11 months ago
2008
Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Ad
MFCS
1997
Springer
14 years 3 months ago
1997
Springer
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
of proposed research. A short bibliography is optional. Domain theory has been developed around 40 years since 1970s by D. Scott, and S. Abramsky revealed the "junction betwee...
CONCUR
2010
Springer
13 years 12 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 9 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...