Qualitative Theorem Proving in Linear Constraints

  • Vijay Chandru
  • Jean-Louis Lassez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2772)


We know, from the classical work of Tarski on real closed fields, that elimination is, in principle, a fundamental engine for mechanized deduction. But, in practice, the high complexity of elimination algorithms has limited their use in the realization of mechanical theorem proving. We advocate qualitative theorem proving, where elimination is attractive since most processes of reasoning take place through the elimination of middle terms, and because the computational complexity of the proof is not an issue. Indeed what we need is the existence of the proof and not its mechanization. In this paper, we treat the linear case and illustrate the power of this paradigm by giving extremely simple proofs of two central theorems in the complexity and geometry of linear programming.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


Tarski’s Metatheorem and Elimination Theory

  1. 1.
    S.S. Abhyankar, Algebraic Geometry for Scientists and Engineers, A.M.S. Monograph, 1990.Google Scholar
  2. 2.
    J.F. Canny, The Complexity of Robot Motion Planning, MIT Press 1987.Google Scholar
  3. 3.
    V. Chandru, Variable Elimination in Linear Constraints, The Computer Journal, 36, No. 5, August 1993, 463-472.Google Scholar
  4. 4.
    D. Kapur and Y.N. Lakshman, Elimination Methods: An Introduction, (1992) in B. Donald, D. Kapur and J.L. Mundy (editors), Symbolic and Numeric Computation for Artificial Intelligence (1992) Academic Press.Google Scholar
  5. 5.
    J-L. Lassez, From LP to LP, in Proceedings of “Theoretical Aspects of Computer Software”, Sendai. Ito and Meyer Editors, Springer Verlag Lecture Notes in Computer Science, 1991.Google Scholar
  6. 6.
    J.T. Schwartz and M. Sharir, A Survey of Motion Planning and Related Geometric Reasoning, in Geometric Reasoning, D. Kapur and J.L. Mundy ed., MIT Press 1989.Google Scholar
  7. 7.
    A. Tarski, A Decision Method for Elementary Algebra and Geometry, RAND Corporation, 1948.Google Scholar
  8. 8.
    L. Van Den Vries, Alfred Tarski’s Elimination Theory for Closed Fields, The Journal of Symbolic Logic, vol. 53 n. 1, March 1988.Google Scholar

Fourier’s Variable Elimination Method

  1. 9.
    G.B. Dantzig and B.C. Eaves, Fourier-Motzkin Elimination and Its Dual, Journal of Combinatorial Theory Ser. A, 14 (1973) 288–297.CrossRefMATHMathSciNetGoogle Scholar
  2. 10.
    J.B.J. Fourier, reported in: Analyse des travaux de l’Académie Royale des Sciences, pendant l’année 1824, Partie Mathématique, Histoire de l’Académie Royale des Sciences de l’Institut de France 7 (1827) xlvii-lv. (Partial English translation in: D.A. Kohler, Translation of a Report by Fourier on his work on Linear Inequalities, Opsearch 10(1973) 38-42.)Google Scholar
  3. 11.
    T. Huynh, C. Lassez and J-L. Lassez, Fourier Algorithm Revisited 2nd International Conference on Algebraic and Logic Programming, Springer-Verlag Lecture Notes in Computer Sciences, 1990.Google Scholar
  4. 12.
    C. Lassez, Programming with constraints: some aspects of the mathematical foundations, in Mathematical aspects of artificial intelligence (Orlando, FL, 1996), 97-138, Proc. Sympos. Appl. Math., 55, Amer. Math. Soc., Providence, RI, 1998.Google Scholar
  5. 13.
    J-L. Lassez and M.J. Maher, On Fourier’s Algorithm for Linear Arithmetic Constraints, in Journal of Automated Reasoning, 1988.Google Scholar
  6. 14.
    H.P. Williams, Fourier’s method of linear programming and its dual, American Mathematical Monthly 93 (1986) 681–695.CrossRefMATHMathSciNetGoogle Scholar

Linear Programming and Polyhedral Combinatorics

  1. 15.
    H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag 1987.Google Scholar
  2. 16.
    J.K. Lenstra, A.H.G. Rinooy Kan and A. Schrijver (editors), History of Mathematical Programming: A Collection of Personal Reminiscences, North Holland (1991).Google Scholar
  3. 17.
    A. Schrijver, Theory of Linear and Integer Programming (1986) Wiley.Google Scholar
  4. 18.
    G.M. Ziegler, Lectures on Polytopes, Springer-Verlag Graduate Texts in Mathematics, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay Chandru
    • 1
  • Jean-Louis Lassez
    • 2
  1. 1.Indian Institute of ScienceComputer Science & AutomationBangaloreIndia
  2. 2.Computer ScienceCoastal Carolina UniversityUSA

Personalised recommendations