1302 search results - page 56 / 261 » Free-Style Theorem Proving |
114
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
122
Voted
TPHOL
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
104
Voted
ITP
2010
15 years 6 months ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
133
Voted
BIRTHDAY
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. In this survey on implicit induction I recollect some memories on the history of implicit induction as it is relevant for future research on computer-assisted theorem pro...
107
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
A famous theorem by Cauchy states that a convex polyhedron is determined by its incidence structure and face-polygons alone. In this paper, we prove the same for orthogonal polyhe...