6978 search results - page 267 / 1396 » On Proofs in System P |
174
click to vote
TABLEAUX
2005
Springer
16 years 4 days ago
2005
Springer
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
176
click to vote
CC
2008
Springer
15 years 6 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
166
click to vote
JAIR
2006
15 years 6 months ago
2006
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
161
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Although web applications are gaining popularity on mobile wireless PDAs, web browsers on these systems can be quite slow and often lack adequate functionality to access many web ...
152
click to vote
SCN
2004
Springer
16 years 10 hour ago
2004
Springer
Abstract. We introduce and define the notion of identity-based zeroknowledge, concentrating on the non-interactive setting. In this setting, our notion allows any prover to widely...