enter search term and/or author name
Qualitative decision theory: from savage's axioms to nonmonotonic reasoning
Didier Dubois, Hélène Fargier, Henri Prade, Patrice Perny
This paper investigates to what extent a purely symbolic approach to decision making under uncertainty is possible, in the scope of artificial intelligence. Contrary to classical approaches to decision theory, we try to rank acts without resorting to...
Dense quantum coding and quantum finite automata
Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh Vazirani
We consider the possibility of encoding m classical bits into many fewer n quantum bits (qubits) so that an arbitrary bit from the original m bits can be recovered with good probability. We show that nontrivial quantum codes...
On the complexity analysis of static analyses
This paper argues that for many algorithms, and static analysis algorithms in particular, bottom-up logic program presentations are clearer and simpler to analyze, for both correctness and complexity, than classical pseudo-code presentations....
Formal verification of standards for distance vector routing protocols
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gunter
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: correctness of the RIP standard, a sharp real-time bound on RIP...