1894 search results - page 78 / 379 » A TLA Proof System |
92
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and veriļ¬er. The ļ...
112
click to vote
TPHOL
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undeļ¬ned terms. ...
157
Voted
LPAR
2004
Springer
15 years 6 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
113
click to vote
CSFW
2010
IEEE
15 years 4 months ago
2010
IEEE
āAlthough policy compliance testing is generally treated as a binary decision problem, the evidence gathered during the trust management process can actually be used to examine t...
112
click to vote
NIPS
2004
15 years 2 months ago
2004
Machine learning is often used to automatically solve human tasks. In this paper, we look for tasks where machine learning algorithms are not as good as humans with the hope of ga...