{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:33Z","timestamp":1725455913103},"publisher-location":"Berlin\/Heidelberg","reference-count":25,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013827","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"201-212","source":"Crossref","is-referenced-by-count":9,"title":["Non-linear real constraints in constraint logic programming"],"prefix":"10.1007","author":[{"given":"Hoon","family":"Hong","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiba, K. Sakai, Y. Sato, D. J. Hawley, and R. Hasegawa. Constraint logic programming language CAL. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS-88), ICOT, Tokyo, pages 263\u2013276, December 1988.","DOI":"10.1007\/978-1-4471-3156-4_27"},{"issue":"12","key":"13_CR2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0747-7171(88)80016-6","volume":"5","author":"D. S. Arnon","year":"1988","unstructured":"D. S. Arnon. A bibliography of quantifier elimination for real closed fields. Journal of Symbolic Computation, 5(1,2):267\u2013274,1988.","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR3","volume-title":"PhD thesis","author":"B. Buchberger","year":"1965","unstructured":"B. Buchberger. An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal. PhD thesis, Universitat Innsbruck, Institut fur Mathematik, 1965. German."},{"key":"13_CR4","unstructured":"B. Buchberger. Groebner bases: An algorithmic method in polynomial ideal theory. In N. K. Bose, editor, Recent Trends in Multidimensional Systems Theory, chapter 6. D. Riedel Publ. Comp., 1983."},{"key":"13_CR5","volume-title":"Technical Report 91-06.0","author":"B. Buchberger","year":"1991","unstructured":"B. Buchberger and H. Hong. Speeding-up quantifier elimination by Groebner bases. Technical Report 91-06.0, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, 1991."},{"key":"13_CR6","first-page":"134","volume-title":"Lecture Notes In Computer Science","author":"G. E. Collins","year":"1975","unstructured":"G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Lecture Notes In Computer Science, pages 134\u2013183. Springer-Verlag, Berlin, 1975. Vol. 33."},{"issue":"3","key":"13_CR7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","volume":"12","author":"G. E. Collins","year":"1991","unstructured":"G. E. Collins and H. Hong. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation, 12(3):299\u2013328, September 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR8","unstructured":"G. E. Collins and R. Loos. The SAC-2 Computer Algebra System. Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria A-4040."},{"issue":"7","key":"13_CR9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/79204.79210","volume":"33","author":"A. Colmerauer","year":"1990","unstructured":"A. Colmerauer. An Introduction to Prolog III. Communications of the ACM, 33(7):69\u201390, July 1990.","journal-title":"Communications of the ACM"},{"key":"13_CR10","unstructured":"M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. In Proceedings on the International Conference on Fifth Generation Computer Systems FGCS-88, Tokyo, Japan, December 1988"},{"key":"13_CR11","unstructured":"Nevin Heintze, Spiro Michaylov, and Peter Stuckey. CLP(-210-01) and some electrical engineering problems. In Jean-Louis Lassez, editor, Logic Programming: Proceedings of the 4th International Conference, pages 675\u2013703. MIT Press, May 1987."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"H. Hong. An improvement of the projection operator in cylindrical algebraic decomposition. In International Symposium of Symbolic and Algebraic Computation, pages 261\u2013264, 1990.","DOI":"10.1145\/96877.96943"},{"key":"13_CR13","unstructured":"H. Hong. Improvements in CAD-based Quantifier Elimination. PhD thesis, The Ohio State University, 1990."},{"key":"13_CR14","volume-title":"Technical report","author":"H. Hong","year":"1991","unstructured":"H. Hong. Collision problems by partial CAD construction. Technical report, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, January 1991."},{"key":"13_CR15","volume-title":"Technical Report 91-41.0","author":"H. Hong","year":"1991","unstructured":"H. Hong. Comparison of several decision algorithms for the existential theory of the reals. Technical Report 91-41.0, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, 1991."},{"key":"13_CR16","volume-title":"Technical Report 92-02.0","author":"H. Hong","year":"1992","unstructured":"H. Hong. Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination. Technical Report 92-02.0, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, 1992. To appear in the proceedings of International Conference on Symbolic and Algebraic Computation ISSAC-92."},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/B978-0-12-115350-2.50017-8","volume-title":"Formal Language Theory. Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"G. Huet and D. Oppen. Equations and rewrite rules. In Formal Language Theory. Perspectives and Open Problems, pages 349\u2013405. Academic Press, New York, 1980."},{"key":"13_CR18","first-page":"196","volume-title":"Proceedings 4th ICLP","author":"J. Jaffar","year":"1987","unstructured":"J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In J.-L. Lassez, editor, Proceedings 4th ICLP, pages 196\u2013218, Cambridge, MA, May 1987. The MIT Press."},{"key":"13_CR19","first-page":"111","volume-title":"Constraint logic programming","author":"J. Jaffar","year":"1987","unstructured":"Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages, Munich, Germany, pages 111\u2013119. ACM, January 1987."},{"key":"13_CR20","unstructured":"M. Kalkbrenner and S. Stifter. Some examples for using quantifier elimination for the collision problem. Technical Report 87\u201322, Research Institute for Symbolic Computation, 1987."},{"key":"13_CR21","volume-title":"Technical Report MTP-3, Mathematics","author":"D. Lankford","year":"1979","unstructured":"Dallas Lankford. On proving term rewriting systems are noetherian. Technical Report MTP-3, Mathematics, Louisiana Tech. Univ., Ruston, LA 71272, May 1979."},{"issue":"l","key":"13_CR22","first-page":"15","volume":"10","author":"R. G. K. Loos","year":"1976","unstructured":"R. G. K. Loos. The algorithm description language ALDES (Report). ACM SIGSAM Bull, 10(l):15\u201339, 1976.","journal-title":"ACM SIGSAM Bull"},{"key":"13_CR23","volume-title":"Technical Report 87-25.0","author":"S. McCallum","year":"1987","unstructured":"S. McCallum. Solving polynomial strict inequalities using cylindrical algebraic decomposition. Technical Report 87-25.0, RISC-LINZ, Johannes Kepler University, A-4040 Linz, Austria (Europe), 1987."},{"key":"13_CR24","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A. Tarski","year":"1951","unstructured":"A. Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley, second edition, 1951.","edition":"second edition"},{"key":"13_CR25","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BF01386381","volume":"1","author":"J. H. Wilkinson","year":"1959","unstructured":"J. H. Wilkinson. The evaluation of the zeros of ill-conditioned polynomials. parts i and ii. Numerische Mathematik, 1:150\u2013166,167\u2013180, 1959.","journal-title":"Numerische Mathematik"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013827.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T07:27:21Z","timestamp":1626766041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0013827","relation":{},"subject":[]}}