1274 search results - page 7 / 255 » New Proofs for |
TABLEAUX
2005
Springer
14 years 29 days ago
2005
Springer
For applications of first-order automated theorem provers in a wider verification context it is essential to provide a means of presenting and checking automatically found proofs...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
TYPES
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a new proof language for the Coq proof assistant. This language uses the declarative style. It aims at providing a simple, natural and robust alternative to the...
SIAMCOMP
2000
13 years 7 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...