184 search results - page 10 / 37 » Querying Proofs |
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
108
click to vote
STOC
2000
ACM
15 years 6 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
114
click to vote
DLOG
2008
15 years 4 months ago
2008
The paper addresses the problem of explaining some reasoning tasks associated with the DL-Lite Description Logic. Because of the simplicity of the language, standard concept level ...
125
click to vote
ICLP
2010
Springer
15 years 5 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
126
click to vote
ESORICS
2006
Springer
15 years 5 months ago
2006
Springer
Data confidentiality is a major concern in database systems. Encryption is a useful tool for protecting the confidentiality of sensitive data. However, when data is encrypted, perf...