Add to ORKGWe present formal verification methods and procedures for finding bounds of linear programs and proving nonlinear inequalities. An efficient implementation of formal arithmetic computations is also described. Our work is an integral part of the Flyspeck project (a formal proof of the Kepler conjecture) and we show how developed formal procedures solve formal computational problems in this project. We also introduce our implementation of SSReflect language (originally developed by G. Gonthier in Coq) in HOL Light
The matrix cuts of Lovász and Schrijver are methods for tightening linear relaxations of zero-one p...
We present a formally verified global optimization framework. Given a semialgebraic or transcendenta...
The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by s...
We present formal verification methods and procedures for finding bounds of linear programs and prov...
Linear programming is a basic mathematical technique for optimizing a linear function on a domain th...
NLCertify is a software package for handling formal certification of nonlinear inequalities involvin...
ABSTRACT V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe...
Die Modellprüfung ist ein vollautomatisches Verfahren zur formalen Verifikation, die entweder die Ko...
Linear arithmetic constraints in the form of equalities and inequalities constitute the vast majorit...
Recursive branch and bound algorithms are often used to refine and isolate solutions to several clas...
The complexity of linear programming is discussed in the "integer" and "real number" models of compu...
We consider feasibility of linear integer programs in the context of verification systems such as SM...
The use of linear programming in various areas has increased with the significant improvement of spe...
The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by s...
We present a formally verified global optimization framework. Given a semialgebraic or transcendenta...
The matrix cuts of Lovász and Schrijver are methods for tightening linear relaxations of zero-one p...
We present a formally verified global optimization framework. Given a semialgebraic or transcendenta...
The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by s...
We present formal verification methods and procedures for finding bounds of linear programs and prov...
Linear programming is a basic mathematical technique for optimizing a linear function on a domain th...
NLCertify is a software package for handling formal certification of nonlinear inequalities involvin...
ABSTRACT V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe...
Die Modellprüfung ist ein vollautomatisches Verfahren zur formalen Verifikation, die entweder die Ko...
Linear arithmetic constraints in the form of equalities and inequalities constitute the vast majorit...
Recursive branch and bound algorithms are often used to refine and isolate solutions to several clas...
The complexity of linear programming is discussed in the "integer" and "real number" models of compu...
We consider feasibility of linear integer programs in the context of verification systems such as SM...
The use of linear programming in various areas has increased with the significant improvement of spe...
The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by s...
We present a formally verified global optimization framework. Given a semialgebraic or transcendenta...
The matrix cuts of Lovász and Schrijver are methods for tightening linear relaxations of zero-one p...
We present a formally verified global optimization framework. Given a semialgebraic or transcendenta...
The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by s...