154 search results - page 7 / 31 » Using Proofs by Coinduction to Find |
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Sometimes it is pragmatically useful to prove a theorem by contradiction rather than finding a direct proof. Some reductio ad absurdum arguments have made mathematical history and ...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
WSC
2004
13 years 9 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
The most efficient collision attacks on members of the SHA family presented so far all use complex characteristics which were manually constructed by Wang et al. In this report, we...