Lemma discovery in automating induction-Reference-Cited by-同舟云学术

Lemma discovery in automating induction

Published:1996 Issue: Volume: Page:538-552
ISSN:0302-9743
Container-title:Automated Deduction — Cade-13
language:
Short-container-title:

Author:

Kapur Deepak,Subramaniam M.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61511-3_112.pdf

Reference11 articles.

1. R.S. Boyer and J S. Moore, A Computational Logic. ACM Monographs in Computer Science, 1979.

2. A. Bundy, A. Stevens, A. Ireland, and A. Smaill, “Rippling: A heuristic for guiding inductive proofs”, Artificial Intelligence, 62:185–253, 1993.

3. D.Basin and T.Walsh “Difference Matching”, In Proc. of CADE 11, D. Kapur (editor), LNAI 607, Springer Verlag 1992.

4. J.T.Hesketh “Using middle out reasoning to guide inductive theorem proving”, Ph.D thesis. University of Edinburgh 1991.

5. A. Ireland and A. Bundy, “Productive Use of Failure in Inductive Proof”, Edinburgh DAI Research Report No: 716. To appear on the Special Issue on Automation of Proof by Mathematical Induction, JAR.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Peano: learning formal mathematical reasoning;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2023-06-05

2. Lemma Discovery for Induction;Lecture Notes in Computer Science;2019

3. Automated Synthesis of Functional Programs with Auxiliary Functions;Programming Languages and Systems;2018

4. Superposition with Structural Induction;Frontiers of Combining Systems;2017

5. Towards the Formal Reliability Analysis of Oil and Gas Pipelines;Lecture Notes in Computer Science;2014