Sciweavers

2436 search results - page 248 / 488
» Comonadic Notions of Computation
Sort
View
JLP
2007
86views more  JLP 2007»
15 years 6 months ago
Typing noninterference for reactive programs
We propose a type system to enforce the security property of noninterference in a core reactive language, obtained by extending the imperative language of Volpano, Smith and Irvin...
Ana Almeida Matos, Gérard Boudol, Ilaria Ca...
AMAI
2004
Springer
15 years 6 months ago
Logical Preference Representation and Combinatorial Vote
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
Jérôme Lang
KAIS
2007
121views more  KAIS 2007»
15 years 6 months ago
Node similarity in the citation graph
Published scientific articles are linked together into a graph, the citation graph, through their citations. This paper explores the notion of similarity based on connectivity alo...
Wangzhong Lu, Jeannette C. M. Janssen, Evangelos E...
CORR
2002
Springer
87views Education» more  CORR 2002»
15 years 6 months ago
Ultimate approximations in nonmonotonic knowledge representation systems
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...
CORR
2002
Springer
131views Education» more  CORR 2002»
15 years 6 months ago
Logic Programming with Ordered Disjunction
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
Gerhard Brewka