Faster Smarter Induction in Isabelle/HOL
Not on the map. Why?
Abstract (arXiv)
Proof by induction plays a critical role in formal verification and mathematics at large. However, its automation remains as one of the long-standing challenges in Computer Science. To address this problem, we developed sem_ind. Given inductive problem, sem_ind recommends what arguments to pass to the induct method. To improve the accuracy of sem_ind, we introduced definitional quantifiers, a new kind of quantifiers that allow us to investigate not only the syntactic structures of inductive problems but also the definitions of relevant constants in a domain-agnostic style. Our evaluation shows that compared to its predecessor sem_ind improves the accuracy of recommendation from 20.1% to 38.2% for the most promising candidates within 5.0 seconds of timeout while decreasing the median value of execution time from 2.79 seconds to 1.06 seconds.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.
2 papers.
- 2025Learning Conjecturing from Scratchcited by 3
- 2022Genetic Algorithm for Program Synthesiscited by 0
- 2025Learning Conjecturing from Scratch3 Mar 2025
- 2022Genetic Algorithm for Program Synthesis22 Nov 2022