68 search results - page 11 / 14 » Mathematical Induction in Otter-Lambda |
ECAI
1994
Springer
15 years 3 months ago
1994
Springer
1 We develop a learning component for a theorem prover designed for verifying statements by mathematical induction. If the prover has found a proof, it is analyzed yielding a so-ca...
103
click to vote
PADL
2012
Springer
13 years 7 months ago
2012
Springer
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...
ASIAN
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
IJCAI
1997
15 years 1 months ago
1997
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...
73
Voted
BIRTHDAY
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...