Productive use of failure in inductive proof
Productive use of failure in inductive proof
复制标题
DOI:
10.1007/bf00244460
复制
发表时间:
1996-03-01
期刊:
影响因子:
--
通讯作者:
Bundy, A
中科院分区:
文献类型:
--
作者:
Ireland, A;Bundy, A
Proof by mathematical induction gives rise to various kinds of eureka steps, e.g., missing lemmata and generalization. Most inductive theorem provers rely upon user intervention in supplying the required eureka steps. In contrast, we present a novel theorem-proving architecture for supporting the automatic discovery of eureka steps. We build upon rippling, a search control heuristic designed for inductive reasoning. We show how the failure if rippling can be used in bridging gaps in the search for inductive proofs.