1274 search results - page 76 / 255 » New Proofs for |
150
click to vote
FAABS
2000
Springer
15 years 8 months ago
2000
Springer
This paper discusses automated reasoning in the KARO framework. The KARO framework accommodates a range of expressive modal logics for describing the behaviour of intelligent agent...
132
click to vote
AIPS
2004
15 years 5 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
162
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
174
click to vote
TOPLAS
2002
15 years 4 months ago
2002
We present an efficient encoding of core Java constructs in a simple, implementable typed intermediate language. The encoding, after type erasure, has the same operational behavio...
123
click to vote
IJNSEC
2007
15 years 4 months ago
2007
We can view an existing Message Authentication Code (MAC) as a Carter-Wegman MAC in spite of the fact it may not have been designed as one. This will make the analysis easier than...