1094 search results - page 72 / 219 » On Computing Explanations in Argumentation |
106
click to vote
CSFW
2006
IEEE
15 years 6 months ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
81
Voted
STOC
2000
ACM
15 years 5 months ago
2000
ACM
We consider a new model for computing with uncertainty. It is desired to compute a function f X1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
153
click to vote
TCC
2012
Springer
13 years 8 months ago
2012
Springer
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
121
Voted
SAGT
2010
Springer
14 years 11 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
120
Voted
CLIMA
2004
15 years 2 months ago
2004
In this paper we propose a formal specification of a persuasion protocol between autonomous agents using an approach based on social commitments and arguments. In order to be flexi...