Sciweavers

34 search results - page 3 / 7
» Bases as Coalgebras
Sort
View
CADE
2010
Springer
13 years 6 months ago
Global Caching for Coalgebraic Description Logics
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
Rajeev Goré, Clemens Kupke, Dirk Pattinson,...
ENTCS
2002
76views more  ENTCS 2002»
13 years 4 months ago
A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras
In [19] Rutten introduced the notion of weak bisimulations and weak bisimilarity for coalgebras of the functor F(X) = X +O. In the present paper I will introduce a notion of weak ...
Jan Rothe
ENTCS
2008
84views more  ENTCS 2008»
13 years 5 months ago
Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
Bart Jacobs
CALCO
2011
Springer
205views Mathematics» more  CALCO 2011»
12 years 4 months ago
Bases as Coalgebras
Abstract. The free algebra adjunction, between the category of algebras of a monad and the underlying category, induces a comonad on the category of algebras. The coalgebras of thi...
Bart Jacobs