• Corpus ID: 215416119

# New Opportunities for the Formal Proof of Computational Real Geometry? (Extended Abstract)

@inproceedings{Abraham2020NewOF,
title={New Opportunities for the Formal Proof of Computational Real Geometry? (Extended Abstract)},
author={Erika 'Abrah'am and James H. Davenport and Matthew England and Gereon Kremer and Zak Tonks},
booktitle={PAAR+SC²@IJCAI},
year={2020}
}
• Published in PAAR+SC²@IJCAI 8 April 2020
• Computer Science
The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such questions have not been formalised. We present a thesis that a new algorithm for ascertaining satisfiability of formulae over the reals via Cylindrical Algebraic Coverings [Abraham, Davenport, England, Kremer, \emph{Deciding the Consistency of Non-Linear Real…
10 Citations

## Figures from this paper

• Computer Science
2021 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
• 2021
This work shows how this new implementation of cylindrical algebraic coverings simplifies proof generation for nonlinear real arithmetic problems in cvc5 and announces some very encouraging experimental results that position cVC5 at the very front of currently available SMT solvers for QF_NRA.
It is almost fifty years since cylindrical algebraic decomposition was introduced: it was far better than previous ideas, but the algorithm was doubly exponential in the number of variables. Various
• Computer Science, Mathematics
ACM Commun. Comput. Algebra
• 2022
It is reported on work-in-progress to create an SMT-solver inside Maple for non-linear real arithmetic (NRA) and some new work is presented on the identification of minimal conflicting cores from the coverings.
• Computer Science
• 2022
This work reformulate and extend the cylindrical algebraic coverings method to allow for checking the validity of arbitrary nonlinear arithmetic formulas, adding support for both quantifiers and arbitrary Boolean structure.
This extended abstract was written to accompany an invited talk at the 2021 SC-Square Workshop, where the author was asked to give an overview of SC-Square progress to date. The author first reminds
• Computer Science
IJCAR
• 2022
The cvc5 SMT solver solves quantifier-free nonlinear real arithmetic problems by combining the cylindrical algebraic coverings method with incremental linearization in an abstraction-refinement loop to create a complete algebraic decision procedure that leverages efficient heuristics for refining candidate models.
• Mathematics
ArXiv
• 2021
We discuss the topic of unsatisfiability proofs in SMT, particularly with reference to quantifier free non-linear real arithmetic. We outline how the methods here do not admit trivial proofs and how
• Mathematics
SN Comput. Sci.
• 2021
This paper presents a computational procedure and shows that this approach leads to a reevaluation and extension of previously known stability regions for PSO using a Lyapunov approach under stagnation assumptions.

## References

SHOWING 1-10 OF 39 REFERENCES

• Computer Science, Mathematics
Log. Methods Comput. Sci.
• 2012
A formalization of discrete real closed fields in the Coq proof assistant of an algebraic proof of quantifier elimination based on pseudo-remainder sequences following the standard computer algebra literature on the topic.
A. Tarski [4] has given a decision method for elementary algebra. In essence this comes to giving an algorithm for deciding whether a given finite set of polynomial inequalities has a solution. Below
The challenges and scope such an implementation of QuantifierElimination written in Maple gives in terms of the desires of the Satisfiability Modulo Theory (SMT) community, and other frequent uses of QE are explored, noting Maple’s status as a Mathematical toolbox.
• Mathematics
ISSAC '07
• 2007
A simple and constructive proof that quantifier elimination in real algebra is doubly exponential, even when there is only one free variable and all polynomials in the quantified input are linear is given.
• S. Basu
• Computer Science, Mathematics
JACM
• 1999
A new algorithm for quantifier elimination in the first order theory of real closed fields that improves the complexity of the best known algorithm for this problem till now and leads to simpler and constructive proofs for these inexpressibility results than the ones known before.