Proving Bounds for Real Linear Programs in Isabelle/HOL


The Flyspeck project [3] has as its goal the complete formalization of Hales’ proof [2] of the Kepler conjecture. The formalization has to be carried out within a mechanical theorem prover. For our work described in this paper, we have chosen the generic proof assistant Isabelle, tailored to Higher-Order Logic (HOL) [4]. In the following, we will refer to… (More)
DOI: 10.1007/11541868_15


  • Presentations referencing similar topics