Abstract
AbstractProof by induction is commonplace in modern mathematics and computational logic. This paper overviews and discusses our recent results in turning saturation-based first-order theorem proving into a powerful framework for automating inductive reasoning. We formalize applications of induction as new inference rules of the saturation process, add instances of appropriate induction schemata to the search space, and use these rules and instances immediately upon their addition for the purpose of guiding induction. Our results show, for example, that many problems from formal verification and mathematical theories can now be solved completely automatically using a first-order theorem prover.
Publisher
Springer Nature Switzerland
Reference14 articles.
1. Boyer, R.S., Moore, J.S.: A Computational Logic Handbook. Academic Press, New York (1988)
2. Cook, B.: Formal reasoning about the security of Amazon web services. In: CAV, pp. 38–47 (2018)
3. Cruanes, S.: Superposition with structural induction. In: FroCoS (2017)
4. Hajdu, M., Hozzová, P., Kovács, L., Schoisswohl, J., Voronkov, A.: Induction with generalization in superposition reasoning. In: CICM (2020)
5. Hajdu, M., Kovács, L., Rawson, M.: Rewriting and inductive reasoning. In: LPAR (2024, to appear)