1743 search results - page 177 / 349 » Generalized Modal Satisfiability |
144
Voted
CCS
2003
ACM
15 years 8 months ago
2003
ACM
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
108
Voted
WDAG
2001
Springer
15 years 8 months ago
2001
Springer
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that cont...
112
Voted
SIGIR
2010
ACM
15 years 7 months ago
2010
ACM
In this paper we analyze queries and sessions intended to satisfy children’s information needs using a large-scale query log. The aim of this analysis is twofold: i) To identify...
127
Voted
COCO
2006
Springer
15 years 7 months ago
2006
Springer
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
135
Voted
AML
2010
15 years 3 months ago
2010
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this proce...