1274 search results - page 66 / 255 » New Proofs for |
98
Voted
RTA
2005
Springer
15 years 6 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
134
Voted
CRYPTO
2011
Springer
14 years 13 days ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
109
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
117
click to vote
AAAI
2008
15 years 3 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
111
Voted
AIML
2008
15 years 2 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...