Lemma Discovery for Induction: A Survey
Paper in proceedings, 2019

Automating proofs by induction can be challenging, not least because proofs might need auxiliary lemmas, which themselves need to be proved by induction. In this paper we survey various techniques for automating the discovery of such lemmas, including both top-down techniques attempting to generate a lemma from an ongoing proof attempt, as well as bottom-up theory exploration techniques trying to construct interesting lemmas about available functions and datatypes, thus constructing a richer background theory.

Author

Moa Johansson

Chalmers, Computer Science and Engineering (Chalmers), Formal methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 11617 LNAI 125-139

12th International Conference on Intelligent Computer Mathematics, CICM 2019
Prague, Czech Republic,

Subject Categories

Algebra and Logic

Other Mathematics

Mathematical Analysis

DOI

10.1007/978-3-030-23250-4_9

More information

Latest update

11/11/2019