Sciweavers

793 search results - page 11 / 159
» Argumentation and standards of proof
Sort
View
COMBINATORICS
2000
75views more  COMBINATORICS 2000»
13 years 7 months ago
Franklin's Argument Proves an Identity of Zagier
Recently Zagier proved a remarkable q-series identity. We show that this identity can also be proved by modifying Franklin's classical proof of Euler's pentagonal number...
Robin J. Chapman
COCO
1999
Springer
79views Algorithms» more  COCO 1999»
13 years 11 months ago
Non-Automatizability of Bounded-Depth Frege Proofs
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring...
Maria Luisa Bonet, Carlos Domingo, Ricard Gavald&a...
CSFW
1999
IEEE
13 years 11 months ago
I/O Automaton Models and Proofs for Shared-Key Communication Systems
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
Nancy A. Lynch
ARGMAS
2009
Springer
14 years 2 months ago
Burden of Proof in Deliberation Dialogs
The literature in argumentation and artificial intelligence has distinguished five types of burden of proof in persuasion dialogs, but there appears to have been no serious invest...
Douglas Walton
IACR
2011
255views more  IACR 2011»
12 years 7 months ago
A Standard-Model Security Analysis of TLS-DHE
TLS is the most important cryptographic protocol in use today. However, up to now there is no complete cryptographic security proof in the standard model, nor in any other model. ...
Tibor Jager, Florian Kohlar, Sven Schäge, J&o...