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

Erika Ábrahám, James Davenport, Matthew England, Gereon Kremer, Zak Tonks
2020 CEUR Workshop Proceedings  
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
more » ... tic Constraints with a Conflict Driver Search Using Cylindrical Algebraic Coverings, 2020] might provide a trace and outputs that allow the results to be more susceptible to machine verification than those of competing algorithms.
doi:10.18154/rwth-2021-09565 fatcat:pn4r7ur7zzehjek6wfi5zes52y