Skip to main content
Conference ProceedingsOPEN ACCESS

Recurrence-Driven Summations in Automated Deduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2023) 14279 LNAI 23-40
DOI: 10.1007/978-3-031-43369-6_2
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Nummelin, V., Blanchette, J., & Dahmen, S. R. (2023). Recurrence-Driven Summations in Automated Deduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14279 LNAI, pp. 23–40). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-43369-6_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free