From LP to LP: Programming with constraints

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

Volumn 526 LNCS, Issue , 1991, Pages 420-446

  Lassez, Jean Louis ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER SOFTWARE; MATHEMATICAL PROGRAMMING; PROBLEM ORIENTED LANGUAGES;

CONSTRAINT METHODS; MAIN TASKS; PROGRAM VERIFICATION; SYMBOLIC COMPUTATION;

PROBLEM SOLVING;

EID: 85030219630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54415-1_57     Document Type: Conference Paper

References (61)

1. A. Aiba and K.Sakai, CAL: A Theoretical Background of Constraint Logic Programming and its Applications, Journal of Symbolic Computation, Vol 8 No 6 1989.
2. D.S. Arnon, Geometric Reasoning with Logic and Algebra, in Geometric Reasoning, D. Kapur and J.L. Mundy eds., MIT Press 1989.
3. D.S. Arnon, Towards a Deductive Database for Elementary Algebra and Geometry, Proceedings of NACLP 90 Workshop on Deductive Databases.
4. M. Barnsley, Fractals Everywhere, Academic Press 1988.
5. H. Beringer, private communication.
6. W.W. Bledsoe, A New Method for Proving Certain Presburger Formulas, Advance Papers 4th Int. Joint Conf. on Artif. Intell., Tbilissi, Georgia, USSR, Sept. 1975.
7. A. Borning, The Programming Language Aspects of THINGLAB - A Constraint Oriented Simulation Laboratory, ACM Transactions on Programming Languages and Systems, 3 (1981) 252-387.
8. F.M. Brown, Boolean Reasoning: The Logic of Boolean Equations, Kluwer Academic Pub. 1990.
9. B. Buchberger, History and Basic Features of the Critical-Pair/Completion Procedure, in Rewriting Techniques and Applications J-P. Jouannaud Ed., Academic Press 1987.
10. J.F.Canny, The Complexity of Robot Motion Planning, MIT Press 1987.
11. V. Chandra and J. Hooker, Logical Inference: A Mathematical Programming Perspective AI in Manufacturing:Theory and Practise, Edited by S.T. Kumara, R.L Kashyap, and A.L. Soyster, Wiley 1988
12. V. Chandra and J. Hooker, Optimization Methods for Logical Inference, to appear.
13. C-L Chang and R.C-T. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press 1973.
14. M. Coste, Geometry and Robotics, J.-D. Boissonat and J.-P. Laumond Eds, Springer Verlag Lecture Notes in Computer Science.
15. J. Cox, K. McAloon and C. Tretkoff, Computational Complexity and Constraint Logic Programming Languages, Annals of Mathematics and Artificial Intelligence, to appear.
16. J. Darlington and Y-K. Guo, Constraints Functional Programming, Technical Report, Department of Computing, Imperial College, to appear.
17. J.H. Davenport, Robot Motion Planning, in Geometric Reasoning, J. Woowark ed., Oxford Science Publications.
18. J.H. Davenport and J. Heintz, Real Quantifier Elimination is Doubly Exponential, in Algorithms in Real Algebraic Geometry, D.S. Arnon and B. Buchberger ed., Academic Press 1988.
19. J-H. Davenport, Y. Siret and E. Tournier, Computer Algebra, Systems and Algorithms for Algebraic Computation, Academic Press 1988.
20. E. Davis, Constraint Propagation with Interval Labels, Journal of Artificial Intelligence, 1987.
21. R.J. Duffin, On Fourier’s Analysis of Linear Inequality Systems, Mathematical Programming Study 1, pp. 71-95, 1974.
22. 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.)
23. J. Gallier and S.Raatz, Hornlog: A Graph-based Interpreter for General Horn Clauses, Journal of Logic Programming, Vol 4, No 2 June 87.
24. P. Hammer and I. Rosenberg, Applications of Pseudo Boolean Programming to the Theory of Graphs, Z. Wahrscheinlichkeitsheorie und Verw. Gebiete 3, 1964.
25. P. Hammer and S. Rudeanu, Boolean Methods in Operations Research, Springer Verlag 1968.
26. N. Heintze, S. Mychaylov, P. Stuckey and R. Yap, On Meta programming in CLP(R), Proceedings NACLP 1989 MIT Press.
27. R. Helm, T. Huynh, C. Lassez and K. Marriott, A Linear Constraint Technology for User Interfaces, to appear.
28. R. Helm, K. Marriott and M. Odersky, Constraint Based Query Optimization for Spatial Databases, Proceedings of ACM Conference on Principles of Database Systems, Denver 1991.
29. C. Hoffman, Geometric and Solid Modelling, Morgan Kauffman Pub. 1989.
30. T. Huynh, L. Joskowicz, C. Lassez and J-L. Lassez, Reasoning About Linear Constraints Using Parametric Queries in Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Sciences, SpringerVerlag vol. 472 December 1990.
31. 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.
32. T. Huynh and J-L. Lassez, Practical Issues on the Projection of Polyhedral Sets, IBM Research Report, T.J. Watson Research Center, 1990.
33. J. Jaffar and J-L. Lassez, Constraint Logic Programming, Proceedings of POPL 1987, Munich.
34. J. Jaffar and J-L. Lassez, From Unification to Constraints, Logic Programming Conference, Tokyo, Springer Verlag Lecture Notes in Computer Science, June 1987.
35. J. Jaffar and S. Michaylov, Methodology and Implementation of a CLP System, Proceedings of the 1987 Logic Programming Conference, Melbourne, MIT Press.
36. R. G. Jeroslow, Logic Based Decision Support, Annals of Discrete Mathematics, North Holland 1989.
37. A. Kandri-Rody and D. Kapur, On relationships between Buchberger’s Grobner basis algorithm and the Knuth Bendix Completion Procedure, General Electric Tech report NO 83CRD286, Schenectady New York 1983.
38. A. Kandri-Rodi, D. Kapur and F. Winkler Knuth-bendix Procedure and Buchberger Algorithm a Synthesis, Proceedings International Symposium on Symbolic and Algebraic Computation 1989.
39. P. Kanellakis, G. Kuper and P. Revesz, Constraint Query Languages, Proceedings of the ACM Conference on Principles of Database Systems, Nashville 90.
40. D. Kapur and J.L. Mundy, Geometric Reasoning, MIT Press 1989.
41. D. Kapur and J.L. Mundy, Symposium on Symbolic and Numeric Computation, Saratoga Springs 1990, Proceedings forthcoming, Academic Press.
42. C. Lassez and J-L. Lassez, Quantifier Elimination for Conjunctions of Linear Constraints via a Convex Hull Algorithm, IBM research Report, T.J. Watson Research Center, 1991.
43. J-L. Lassez, Querying Constraints, Proceedings of the ACM conference on Principles of Database Systems, Nashville 1990.
44. J-L. Lassez, T. Huynh and K. McAloon, Simplification and Elimination of Redundant Arithmetic Constraints, Proceedings of NACLP 89, MIT Press.
45. J-L. Lassez and M.J. Maher, On Fourier’s Algorithm for Linear Arithmetic Constraints, IBM Research Report, T.J. Watson Research Center, 1988, Journal of Automated Reasoning, to appear.
46. J-L. Lassez, M.J. Maher and K. Marriott, Unification Revisited, Foundations of Logic Programming and Deductive Databases, J. Minker ed., Morgan-Kaufmann 1988.
47. J-L. Lassez and K. McAloon, A Canonical Form for Generalized Linear Constraints, IBM Research Report RC 15004, IBM T.J. Watson Research Center, Journal of Symbolic Computation, to appear.
48. J-L Lassez and K. McAloon, A Constraint Sequent Calculus, Proceedings of LICS 90, Philadelphia.
49. M. Maher, A Logic Semantics for a class of Committed Choice Languages, Proceedings of ICLP4 MIT Press 1987.
50. M. Maher and P. Stuckey, Expanding Query power in Constraint Logic Programming Languages, Proceedings of NACLP 1989, MIT Press.
51. K. Marriott and M. Odersky, Systems of Negative Boolean Constraints, forthcoming.
52. K. Mukai, Situations in Constraint, US-JAPAN AI Symposium, 1987, Tokyo.
53. J. Pearl, Constraints and Heuristics, AI Journal, 1988.
54. J. Renegar, On the Computational Complexity and Geometry of the First Order Theory of the Reals, Part I, II and III, Technical Reports, School of Operations Research and Industrial Engineering, Cornell 1989.
55. V. Saraswat, Concurrent Constraint Logic Programming, MIT Press, to appear.
56. V. Saraswat, F. Rossi and P. van Hentenryck, Towards a General Framework for Constraint Programming, forthcoming.
57. 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.
58. R.E. Shostak, On the SUP-INF method for proving Presburger formulas, JACM, 24 (1977) 529-543.
59. G. Steele and G. Sussman, CONSTRAINTS - a Constraint Based Programming Language, AI Journal, 1982.
60. L. Van Den Vries, Alfred Tarski’s Elimination Theory for Closed Fields, The Journal of Symbolic Logic, vol.53 n.1, March 1988.
61. P. van Hentenryck, Constraint Satisfaction in Logic Programming, The MIT Press 1989.