2436 search results - page 94 / 488 » Comonadic Notions of Computation |
114
click to vote
CSR
2010
Springer
15 years 7 months ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
116
click to vote
APSCC
2008
IEEE
15 years 5 months ago
2008
IEEE
In this paper, we develop a framework for measuring the level of protection offered by relation hiding systems. The framework provides a uniform way to define a variety of privacy ...
150
click to vote
COORDINATION
2008
Springer
15 years 5 months ago
2008
Springer
Context-aware applications adapt their behavior depending on changes in their environment context. Programming such applications in a modular way requires to modularize the global ...
124
click to vote
AAAI
2006
15 years 5 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
120
click to vote
GG
2008
Springer
15 years 4 months ago
2008
Springer
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...