Lemma Discovery for Induction: A Survey
Paper i proceeding, 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.

Författare

Moa Johansson

Chalmers, Data- och informationsteknik, Formella metoder

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,

Ämneskategorier

Algebra och logik

Annan matematik

Matematisk analys

DOI

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

Mer information

Senast uppdaterat

2019-11-11