Appropriate lemmae discovery
From MaRDI portal
Publication:1827320
Recommendations
- Lemma discovery for induction. A survey
- Lemma discovery in automating induction
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- On the generation of quantified lemmas
- Sound lemma generation for proving inductive validity of equations
Cites work
- scientific article; zbMATH DE number 3956408 (Why is no real title available?)
- scientific article; zbMATH DE number 4074541 (Why is no real title available?)
- scientific article; zbMATH DE number 3702108 (Why is no real title available?)
- scientific article; zbMATH DE number 1348478 (Why is no real title available?)
- scientific article; zbMATH DE number 1149426 (Why is no real title available?)
- Lemma discovery in automating induction
- Productive use of failure in inductive proof
- The automation of proof by mathematical induction
Cited in
(8)- On terminating lemma speculations.
- Predicting failures of and repairing inductive proof attempts
- Automatic generation of generalization lemmas for proving properties of tail-recursive definitions
- Lemma discovery in automating induction
- Patching faulty conjectures
- Lazy generation of induction hypotheses
- Lemma discovery for induction. A survey
- The resonance strategy
This page was built for publication: Appropriate lemmae discovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827320)