A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
New Opportunities for the Formal Proof of Computational Real Geometry? (Extended Abstract)
2020
Conference on Automated Deduction
The purpose of this paper is to explore the question "to what extent could we produce formal, machineverifiable, 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 the thesis that a new algorithm for ascertaining satisfiability of formulae over the reals via Cylindrical Algebraic Coverings [Ábrahám, Davenport, England, Kremer, Deciding the Consistency of Non-Linear Real
dblp:conf/cade/AbrahamDEKT20
fatcat:rii5ajbog5cnph7eelahlx44ou