We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...
Systems of argumentation or ’computational dialectic’ are emerging as a powerful means of structuring inter-agent communication in multi-agent systems. Individual systems of co...
The BDI model provides what it is possibly one of the most promising architectures for the development of intelligent agents, and has become one of the most studied and well known...
1 The purpose of this paper is to show how probabilistic argumentation is applicable to modern public-key cryptography as an appropriate tool to evaluate webs of trust. This is an ...
We evaluate probabilistic models of verb argument structure trained on a corpus of verbs and their syntactic arguments. Models designed to represent patterns of verb alternation b...