Skip to search formSkip to main contentSkip to account menu

Soundness (interactive proof)

Soundness is a property of interactive proof systems that requires that no prover can make the verifier accept for a wrong statement except with some… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Most of the works on learning from networked data assume that the network is static. In this paper we consider a different… 
2011
2011
Directly coupled electromagnetic field-electric circuit modeling approach for coupling an electrical machine to its associated… 
2010
2010
With the availability of powerful computational and communication systems, scientists now readily access large, complicated… 
2007
2007
In the paper we propose a method of structuring a knowledge base into hierarchically related contexts and present how this… 
2004
2004
References are indispensable to computing practice. Unlike deep copying, reference copying permits constant-time data assignment… 
2002
2002
We give a detailed description of our calculation of the O(α 2 ) correction to the orthopositronium decay rate. The resulting… 
2000
2000
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with… 
1995
1995
We introduce the equality elimination method which is a new procedure for dealing with Horn clause logic programs with equality…