Sciweavers

14084 search results - page 368 / 2817
» A Theory for Game Theories
Sort
View
200
Voted
TABLEAUX
2009
Springer
16 years 1 months ago
Terminating Tableaux for the Basic Fragment of Simple Type Theory
base types and disallows lambda abstractions and quantifiers. We show that this fragment has the finite model property and that satisfiability can be decided with a terminating ...
Chad E. Brown, Gert Smolka
200
Voted
TABLEAUX
2009
Springer
16 years 1 months ago
Goal-Directed Invariant Synthesis for Model Checking Modulo Theories
We are interested in automatically proving safety properties of infinite state systems. We present a technique for invariant synthesis which can be incorporated in backward reacha...
Silvio Ghilardi, Silvio Ranise
304
Voted
TARK
2009
Springer
16 years 1 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
161
Voted
UC
2009
Springer
16 years 1 months ago
On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the...
Karl Svozil