Sciweavers

4573 search results - page 675 / 915
» Automated Reasoning
Sort
View
TARK
2009
Springer
15 years 10 months ago
An epistemic characterization of zero knowledge
Halpern, Moses and Tuttle presented a definition of interactive proofs using a notion they called practical knowledge, but left open the question of finding an epistemic formula...
Joseph Y. Halpern, Rafael Pass, Vasumathi Raman
TARK
2009
Springer
15 years 10 months ago
A logical characterization of iterated admissibility
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
Joseph Y. Halpern, Rafael Pass
150
Voted
TARK
2009
Springer
15 years 10 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
TARK
2009
Springer
15 years 10 months ago
A computational theory of awareness and decision making
We exhibit a new computational-based definition of awareness, informally that our level of unawareness of an object is the amount of time needed to generate that object within a ...
Nikhil R. Devanur, Lance Fortnow
KCAP
2009
ACM
15 years 10 months ago
Knowledge integration across multiple texts
One of the grand challenges of AI is to build systems that learn by reading. The ideal system would construct a rich knowledge base capable of automated reasoning. We have built a...
Doo Soon Kim, Ken Barker, Bruce W. Porter