Sciweavers

2436 search results - page 54 / 488
» Comonadic Notions of Computation
Sort
View
PDC
2004
ACM
14 years 3 months ago
Artful infrastructuring in two cases of community PD
In this paper, we use the notions of artful integrations and infrastructure to analyze two cases of community Participatory Design ‘in the wild’. Though the communities are qu...
Helena Karasti, Anna-Liisa Syrjänen
FOSSACS
2003
Springer
14 years 2 months ago
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity
In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compu...
Franck van Breugel, Michael W. Mislove, Joël ...
BIRTHDAY
2006
Springer
14 years 1 months ago
Uniform Functors on Sets
This paper is a contribution to the study of uniformity conditions for endofunctors on sets initiated in Aczel [1] and pursued later in other works such as Turi [17]. The main res...
Lawrence S. Moss
FOCS
2004
IEEE
14 years 1 months ago
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem
In this work we look back into the proof of the PCP Theorem, with the goal of finding new proofs that are "more combinatorial" and arguably simpler. For that we introduc...
Irit Dinur, Omer Reingold
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 9 months ago
Justifications for Logic Programs under Answer Set Semantics
The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a ...
Enrico Pontelli, Tran Cao Son, Omar El-Khatib