Proving bounds for real linear programs in Isabelle/HOL

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 227-244

  Obua, Steven ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGRATION; MATHEMATICAL TECHNIQUES; MATRIX ALGEBRA; OPTIMIZATION; THEOREM PROVING;

DO-MAINS; LINEAR FUNCTIONS; LINEAR INEQUALITIES;

LINEAR PROGRAMMING;

EID: 26844510450     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11541868_15     Document Type: Conference Paper

References (13)

1. Thomas C. Hales. Some algorithms arising in the proof of the Kepler conjecture, sect. 3.1.1., arXiv:math.MG/0205209
2. Thomas C. Hales. A Proof of the Kepler Conjecture, Annals of Mathematics, to appear.
3. The Flyspeck Project Pact Sheet.http://www.math.pitt.edu/~thales/ flyspeck/index.html
4. Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, Springer 2002
5. Alexander Schrijver. Theory of Linear and Integer Programming, Wiley & Sons 1986
6. Lawrence C. Paulson. Organizing Numerical Theories Using Axiomatic Type Classes. Journal of Automated Reasoning, in press.
7. Lawrence C. Paulson. Defining Functions on Equivalence Classes. ACM Transactions on Computational Logic, in press.
8. Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition. ACM Transactions on Mathematical Software, Vol 4. No 3, pp. 250-269, 1978.
9. Bruno Barras. Programming and Computing in HOL. TPHOLs 2000, LNCS 1869, pp. 17-37, Springer 2000.
10. Bart Jacobs, Tom Melham. Translating Dependent Type Theory into Higher Order Logic. Typed Lambda Calculi and Applications: Proceedings of the International Conference, LNCS 664, pp. 209-229, Springer 1993.
11. Serge Lang. Algebra, Addison-Wesley 1974.
12. Garrett Birkhoff, Lattice Theory, AMS 1967.
13. László Fuchs. Partially ordered algebraic systems, Addison-Wesley 1963.