{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:07Z","timestamp":1725663607359},"publisher-location":"Berlin, Heidelberg","reference-count":61,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544159"},{"type":"electronic","value":"9783540476177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54415-1_57","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:46:40Z","timestamp":1330192000000},"page":"420-446","source":"Crossref","is-referenced-by-count":3,"title":["From LP to LP: Programming with constraints"],"prefix":"10.1007","author":[{"given":"Jean-Louis","family":"Lassez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1016\/S0747-7171(89)80063-X"},{"key":"20_CR2","unstructured":"D.S. Arnon, Geometric Reasoning with Logic and Algebra, in Geometric Reasoning, D. Kapur and J.L. Mundy eds., MIT Press 1989."},{"key":"20_CR3","unstructured":"D.S. Arnon, Towards a Deductive Database for Elementary Algebra and Geometry, Proceedings of NACLP 90 Workshop on Deductive Databases."},{"key":"20_CR4","unstructured":"M. Barnsley, Fractals Everywhere, Academic Press 1988."},{"key":"20_CR5","unstructured":"H. B\u00e9ringer, private communication."},{"key":"20_CR6","unstructured":"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."},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/357146.357147","volume":"3","author":"A. Borning","year":"1981","unstructured":"A. Borning, The Programming Language Aspects of THINGLAB \u2014 A Constraint Oriented Simulation Laboratory, ACM Transactions on Programming Languages and Systems, 3 (1981) 252\u2013387.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"F.M. Brown, Boolean Reasoning: The Logic of Boolean Equations, Kluwer Academic Pub. 1990.","DOI":"10.1007\/978-1-4757-2078-5"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"B. Buchberger, History and Basic Features of the Critical-Pair\/Completion Procedure, in Rewriting Techniques and Applications J-P. Jouannaud Ed., Academic Press 1987.","DOI":"10.1016\/S0747-7171(87)80020-2"},{"key":"20_CR10","unstructured":"J.F.Canny, The Complexity of Robot Motion Planning, MIT Press 1987."},{"key":"20_CR11","unstructured":"V. Chandru 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"},{"key":"20_CR12","unstructured":"V. Chandru and J. Hooker, Optimization Methods for Logical Inference, to appear."},{"key":"20_CR13","unstructured":"C-L Chang and R.C-T. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press 1973."},{"key":"20_CR14","unstructured":"M. Coste, Geometry and Robotics, J.-D. Boissonat and J.-P. Laumond Eds, Springer Verlag Lecture Notes in Computer Science."},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"J. Cox, K. McAloon and C. Tretkoff, Computational Complexity and Constraint Logic Programming Languages, Annals of Mathematics and Artificial Intelligence, to appear.","DOI":"10.1007\/BF01543475"},{"key":"20_CR16","unstructured":"J. Darlington and Y-K. Guo, Constraints Functional Programming, Technical Report, Department of Computing, Imperial College, to appear."},{"key":"20_CR17","unstructured":"J.H. Davenport, Robot Motion Planning, in Geometric Reasoning, J. Woowark ed., Oxford Science Publications."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1016\/S0747-7171(88)80004-X"},{"key":"20_CR19","unstructured":"J-H. Davenport, Y. Siret and E. Tournier, Computer Algebra, Systems and Algorithms for Algebraic Computation, Academic Press 1988."},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"E. Davis, Constraint Propagation with Interval Labels, Journal of Artificial Intelligence, 1987.","DOI":"10.1016\/0004-3702(87)90091-9"},{"key":"20_CR21","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BFb0121242","volume":"1","author":"R.J. Duffin","year":"1974","unstructured":"R.J. Duffin, On Fourier's Analysis of Linear Inequality Systems, Mathematical Programming Study 1, pp. 71\u201395, 1974.","journal-title":"Mathematical Programming Study"},{"key":"20_CR22","first-page":"38","volume":"10","author":"J.B.J. Fourier","year":"1973","unstructured":"J.B.J. Fourier, reported in: Analyse des travaux de l'Acad\u00e9mie Royale des Sciences, pendant l'ann\u00e9e 1824, Partie Math\u00e9matique, Histoire de l'Acad\u00e9mie 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\u201342.)","journal-title":"Opsearch"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"J. Gallier and S.Raatz, Hornlog: A Graph-based Interpreter for General Horn Clauses, Journal of Logic Programming, Vol 4, No 2 June 87.","DOI":"10.1016\/0743-1066(87)90015-X"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"P. Hammer and I. Rosenberg, Applications of Pseudo Boolean Programming to the Theory of Graphs, Z. Wahrscheinlichkeitsheorie und Verw. Gebiete 3, 1964.","DOI":"10.1007\/BF00535976"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"P. Hammer and S. Rudeanu, Boolean Methods in Operations Research, Springer Verlag 1968.","DOI":"10.1007\/978-3-642-85823-9"},{"key":"20_CR26","unstructured":"N. Heintze, S. Mychaylov, P. Stuckey and R. Yap, On Meta programming in CLP(R), Proceedings NACLP 1989 MIT Press."},{"key":"20_CR27","unstructured":"R. Helm, T. Huynh, C. Lassez and K. Marriott, A Linear Constraint Technology for User Interfaces, to appear."},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/113413.113429"},{"key":"20_CR29","unstructured":"C. Hoffman, Geometric and Solid Modelling, Morgan Kauffman Pub. 1989."},{"key":"20_CR30","first-page":"1","volume-title":"Lecture Notes in Computer Science","author":"Tien Huynh","year":"1990","unstructured":"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, Springer-Verlag vol. 472 December 1990."},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-53162-9_34"},{"key":"20_CR32","unstructured":"T. Huynh and J-L. Lassez, Practical Issues on the Projection of Polyhedral Sets, IBM Research Report, T.J. Watson Research Center, 1990."},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J-L. Lassez, Constraint Logic Programming, Proceedings of POPL 1987, Munich.","DOI":"10.1145\/41625.41635"},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J-L. Lassez, From Unification to Constraints, Logic Programming Conference, Tokyo, Springer Verlag Lecture Notes in Computer Science, June 1987.","DOI":"10.1007\/3-540-19426-6_1"},{"key":"20_CR35","unstructured":"J. Jaffar and S. Michaylov, Methodology and Implementation of a CLP System, Proceedings of the 1987 Logic Programming Conference, Melbourne, MIT Press."},{"key":"20_CR36","unstructured":"R. G. Jeroslow, Logic Based Decision Support, Annals of Discrete Mathematics, North Holland 1989."},{"key":"20_CR37","unstructured":"A. Kandri-Rody and D. Kapur, On relationships between Buchberger's Grobner basis algorithm and the Knuth Bendix Completion Procedure, General Electric Tech report N0 83CRD286, Schenectady New York 1983."},{"key":"20_CR38","unstructured":"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."},{"key":"20_CR39","unstructured":"P. Kanellakis, G. Kuper and P. Revesz, Constraint Query Languages, Proceedings of the ACM Conference on Principles of Database Systems, Nashville 90."},{"key":"20_CR40","unstructured":"D. Kapur and J.L. Mundy, Geometric Reasoning, MIT Press 1989."},{"key":"20_CR41","unstructured":"D.Kapur and J.L. Mundy, Symposium on Symbolic and Numeric Computation, Saratoga Springs 1990, Proceedings forthcoming, Academic Press."},{"key":"20_CR42","unstructured":"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."},{"key":"20_CR43","doi-asserted-by":"crossref","unstructured":"J-L. Lassez, Querying Constraints, Proceedings of the ACM conference on Principles of Database Systems, Nashville 1990.","DOI":"10.1145\/298514.298581"},{"key":"20_CR44","unstructured":"J-L. Lassez, T. Huynh and K. McAloon, Simplification and Elimination of Redundant Arithmetic Constraints, Proceedings of NACLP 89, MIT Press."},{"key":"20_CR45","unstructured":"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."},{"key":"20_CR46","doi-asserted-by":"crossref","unstructured":"J-L. Lassez, M.J. Maher and K. Marriott, Unification Revisited, Foundations of Logic Programming and Deductive Databases, J. Minker ed., Morgan-Kaufmann 1988.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"key":"20_CR47","unstructured":"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."},{"key":"20_CR48","unstructured":"J-L Lassez and K. McAloon, A Constraint Sequent Calculus, Proceedings of LICS 90, Philadelphia."},{"key":"20_CR49","unstructured":"M. Maher, A Logic Semantics for a class of Committed Choice Languages, Proceedings of ICLP4, MIT Press 1987."},{"key":"20_CR50","unstructured":"M. Maher and P. Stuckey, Expanding Query power in Constraint Logic Programming Languages, Proceedings of NACLP 1989, MIT Press."},{"key":"20_CR51","unstructured":"K. Marriott and M. Odersky, Systems of Negative Boolean Constraints, forth-coming."},{"key":"20_CR52","unstructured":"K. Mukai, Situations in Constraint, US-JAPAN AI Symposium, 1987, Tokyo."},{"key":"20_CR53","unstructured":"J. Pearl, Constraints and Heuristics, AI Journal, 1988."},{"key":"20_CR54","unstructured":"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."},{"key":"20_CR55","unstructured":"V. Saraswat, Concurrent Constraint Logic Programming, MIT Press, to appear."},{"key":"20_CR56","unstructured":"V. Saraswat, F. Rossi and P. van Hentenryck, Towards a General Framework for Constraint Programming, forthcoming."},{"key":"20_CR57","unstructured":"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."},{"key":"20_CR58","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/322033.322034","volume":"24","author":"R.E. Shostak","year":"1977","unstructured":"R.E. Shostak, On the SUP-INF method for proving Presburger formulas, JACM, 24 (1977) 529\u2013543.","journal-title":"JACM"},{"key":"20_CR59","unstructured":"G. Steele and G. Sussman, CONSTRAINTS \u2014 a Constraint Based Programming Language, AI Journal, 1982."},{"key":"20_CR60","doi-asserted-by":"crossref","unstructured":"L. Van Den Vries, Alfred Tarski's Elimination Theory for Closed Fields, The Journal of Symbolic Logic, vol.53 n.1, March 1988.","DOI":"10.2307\/2274424"},{"key":"20_CR61","unstructured":"P. van Hentenryck, Constraint Satisfaction in Logic Programming, The MIT Press 1989."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54415-1_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T14:10:09Z","timestamp":1687270209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54415-1_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544159","9783540476177"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/3-540-54415-1_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}