12774 search results - page 328 / 2555 » A Framework for Proof Systems |
162
click to vote
ENTCS
2010
15 years 6 months ago
2010
It is not clear what a system for evidence-based common knowledge should look like if common knowledge is treated as a greatest fixed point. This paper is a preliminary step towar...
160
click to vote
ENTCS
2006
15 years 6 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
201
click to vote
PODC
2003
ACM
16 years 18 hour ago
2003
ACM
Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allo...
199
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
176
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Semantic applications that utilise OWL ontologies can benefit from a broad range of OWL reasoning systems, which allow for the inference of implicit knowledge from expli...