3228 search results - page 167 / 646 » Computationally Sound Proofs |
181
click to vote
FROCOS
2000
Springer
15 years 10 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
182
click to vote
TLCA
2005
Springer
15 years 12 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
157
click to vote
CASSIS
2004
Springer
15 years 12 months ago
2004
Springer
We present the Mobile Resource Guarantees framework: a system for ensuring that downloaded programs are free from run-time violations of resource bounds. Certificates are attached...
159
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
155
click to vote
DAGM
2004
Springer
15 years 10 months ago
2004
Springer
The well-known and very simple MinOver algorithm is reformulated for incremental support vector classification with and without kernels. A modified proof for its O(t-1/2 ) converge...