SMT-Solving Induction Proofs of Inequalities

Ali Uncu, James H. Davenport, Matthew England

Research output: Chapter in Book/Report/Conference proceedingConference proceedingpeer-review

1 Citation (Scopus)
131 Downloads (Pure)

Abstract

This paper accompanies a new dataset of non-linear real arithmetic problems for the SMT-LIB benchmark collection. The problems come from an automated proof procedure of Gerhold–Kauers, which is well suited for solution by SMT. The problems of this type have not been tackled by SMT-solvers before. We describe the proof technique and give one new such proof to illustrate it. We then describe the dataset and the results of benchmarking. The benchmarks on the new dataset are quite different to the existing ones. The benchmarking also brings forward some interesting debate on the use/inclusion of rational functions and algebraic numbers in the SMT-LIB.
Original languageEnglish
Title of host publicationProceedings of the 7th International Workshop on Satisfiability Checking and Symbolic Computation
EditorsAli Uncu, Haniel Barbosa
PublisherCEUR Workshop Proceedings
Pages10-24
Number of pages15
Volume3458
Publication statusPublished - 18 Aug 2023
EventSC2 Workshop 2022: Satisfiability Checking and Symbolic Computation - Haifa, Israel
Duration: 12 Aug 202212 Aug 2022
http://www.sc-square.org/CSA/workshop7.html

Publication series

NameCEUR Workshop Proceedings
PublisherCEUR Workshop Proceedings
ISSN (Print)1613-0073

Conference

ConferenceSC2 Workshop 2022
Country/TerritoryIsrael
CityHaifa
Period12/08/2212/08/22
Internet address

Bibliographical note

Copyright © 2023 for the individual papers by the papers' authors. Copyright © 2023 for the volume as a collection by its editors. This volume and its papers are published under the Creative Commons License Attribution 4.0 International (CC BY 4.0).

Funding

FundersFunder number
Engineering and Physical Sciences Research CouncilEP/T015713/1, EP/T015748/1
Austrian Science Fund

Keywords

  • Inequalities
  • Induction Proofs
  • Satisfiability Modulo Theories
  • Computer Algebra
  • Rational Functions

Fingerprint

Dive into the research topics of 'SMT-Solving Induction Proofs of Inequalities'. Together they form a unique fingerprint.

Cite this