Recurrence-Driven Summations in Automated Deduction

DOI10.1007/978-3-031-43369-6_2MaRDI QIDQ6496616zbMATH OpenFDO

Authors Visa Nummelin, Jasmin Christian Blanchette, Sander R. Dahmen

Publication date 3 May 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-43369-6_2

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Summations of linear recurrent sequences
• A new Sigma approach to multi-summation
• scientific article; zbMATH DE number 96353
• An extension of Zeilberger's fast algorithm to general holonomic functions
• scientific article; zbMATH DE number 434742

Cites work

• A combinator-based superposition calculus for higher-order logic
• A holonomic systems approach to special functions identities
• A non-holonomic systems approach to special function identities
• Advanced applications of the holonomic systems approach. (Abstract of thesis)
• An Extension of the Knuth-Bendix Ordering with LPO-Like Properties
• Decision procedure for indefinite hypergeometric summation
• Extending SMT solvers to higher-order logic
• Extensional higher-order paramodulation in Leo-III
• Gröbner bases of modules and Faugère's F₄ algorithm in Isabelle/HOL
• Hammering towards QED
• scientific article; zbMATH DE number 1988897 (Why is no real title available?)
• Ideals, Varieties, and Algorithms
• Making higher-order superposition work
• Non-commutative Gröbner bases in algebras of solvable type
• On rational and hypergeometric solutions of linear ordinary difference equations in \(\Pi\Sigma^\ast\)-field extensions
• Rational Functions Certify Combinatorial Identities
• Symbolic summation assists combinatorics

This page was built for publication: Recurrence-Driven Summations in Automated Deduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496616)