Sciweavers

793 search results - page 19 / 159
» Argumentation and standards of proof
Sort
View
AIR
2010
95views more  AIR 2010»
13 years 7 months ago
A taxonomy of argumentation models used for knowledge representation
Understanding argumentation and its role in human reasoning has been a continuous subject of investigation for scholars from the ancient Greek philosophers to current researchers ...
Jamal Bentahar, Bernard Moulin, Micheline Bé...
AI
2002
Springer
13 years 7 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
TCC
2004
Springer
835views Cryptology» more  TCC 2004»
14 years 23 days ago
On the Possibility of One-Message Weak Zero-Knowledge
Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under ...
Boaz Barak, Rafael Pass
JOC
2010
82views more  JOC 2010»
13 years 2 months ago
A Verifiable Secret Shuffle of Homomorphic Encryptions
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
Jens Groth
STOC
2000
ACM
97views Algorithms» more  STOC 2000»
13 years 11 months ago
Quantum lower bounds by quantum arguments
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
Andris Ambainis