Qualitative theorem proving in linear constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2772, Issue , 2004, Pages 395-406

  Chandru, Vijay ^a   Lassez, Jean Louis ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b Department of Public Health   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; MACHINERY;

HIGH COMPLEXITY; LINEAR CONSTRAINTS; MECHANICAL THEOREM PROVING; REAL CLOSED FIELDS;

THEOREM PROVING;

EID: 35248836594     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (19)

1. S.S. Abhyankar, Algebraic Geometry for Scientists and Engineers, A.M.S. Monograph, 1990.
2. J.F. Canny, The Complexity of Robot Motion Planning, MIT Press 1987.
3. V. Chandru, Variable Elimination in Linear Constraints, The Computer Journal, 36, No. 5, August 1993, 463-472.
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.
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.
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.
7. A. Tarski, A Decision Method for Elementary Algebra and Geometry, RAND Corporation, 1948.
8. L. Van Den Vries, Alfred Tarski's Elimination Theory for Closed Fields, The Journal of Symbolic Logic, vol.53 n.1, March 1988.
9. G.B. Dantzig and B.C. Eaves, Fourier-Motzkin Elimination and Its Dual, Journal of Combinatorial Theory Ser. A, 14 (1973) 288-297.
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.
11. (Partial English translation in: D.A. Kohler, Translation of a Report by Fourier on his work on Linear Inequalities, Opsearch 10(1973) 38-42.)
12. 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.
13. 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.
14. J-L. Lassez and M.J. Maher, On Fourier's Algorithm for Linear Arithmetic Constraints, in Journal of Automated Reasoning, 1988.
15. H.P. Williams, Fourier's method of linear programming and its dual, American Mathematical Monthly 93 (1986) 681-695.
16. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag 1987.
17. J.K. Lenstra, A.H.G. Rinooy Kan and A. Schrijver (editors), History of Mathematical Programming: A Collection of Personal Reminiscences, North Holland (1991).
18. A. Schrijver, Theory of Linear and Integer Programming (1986) Wiley .
19. G.M. Ziegler, Lectures on Polytopes, Springer-Verlag Graduate Texts in Mathematics, 1995.