Recurrence-Driven Summations in Automated Deduction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Recurrence-Driven Summations in Automated Deduction


Many problems in mathematics and computer science involve summations. We present a procedure that automatically proves equations involving finite summations, inspired by the theory of holonomic sequences. The procedure is designed to be interleaved with the activities of a higher-order automatic theorem prover. It performs an induction and automatically solves the induction step, leaving the base cases to the theorem prover.
Fichier principal
Vignette du fichier
conf.pdf (368.1 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04298450 , version 1 (21-11-2023)




Visa Nummelin, Jasmin Blanchette, Sander Dahmen. Recurrence-Driven Summations in Automated Deduction. FroCoS 2023, 2023, Prague, Czech Republic. pp.23-40, ⟨10.1007/978-3-031-43369-6_2⟩. ⟨hal-04298450⟩
10 View
6 Download



Gmail Mastodon Facebook X LinkedIn More