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, we use a quantum adversary that runs the algorithm with a superposition of inputs. If the algorithm works correctly, its
Cost-bounded argumentation
✍ Scribed by Rolf Haenni
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 189 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0888-613X
No coin nor oath required. For personal study only.
✦ Synopsis
The purpose of this paper is to present new computational techniques for probabilistic argumentation systems. It shows that instead of computing intractable large sets of arguments, it is also possible to ®nd good approximations of the exact solutions in reasonable time. The technique presented is based on cost functions, which are used to measure the relevance of arguments.
📜 SIMILAR VOLUMES
Subordonnée à la rhétorique, à la logique et à la dialectique dans l’organisation classique des disciplines, l’autonomie de l’argumentation comme champ de recherche s’est affirmée après la Seconde Guerre mondiale, à partir des travaux de Perelman et Toulmin. Cet ouvrage dresse un état des lieux des
sufficient conditions of existence and uniqueness of a-bounded and bounded solutions to the difference equation with advanced arguments z 192, are given. It is proven that under certain conditions it is possible to find positive numbers R, CL, such that from every initial condition < satisfying I<1