{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:53:39Z","timestamp":1743058419712,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428633"},{"type":"electronic","value":"9783540455783"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45578-7_36","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:34:25Z","timestamp":1180334065000},"page":"524-538","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Solving Constraints over Floating-Point Numbers"],"prefix":"10.1007","author":[{"given":"C.","family":"Michel","sequence":"first","affiliation":[]},{"given":"M.","family":"Rueher","sequence":"additional","affiliation":[]},{"given":"Y.","family":"Lebbah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"unstructured":"ANSI\/IEEE, New York. IEEE Standard for Binary Floating Point Arithmetic, Std 754\u20131985 edition, 1985.","key":"36_CR1"},{"unstructured":"F. Benhamou, D. McAllester, and P. Van-Hentenryck. Clp(intervals) revisited. In Proceedings of the International Symposium on Logic Programming, pages 124\u2013138, 1994.","key":"36_CR2"},{"doi-asserted-by":"crossref","unstructured":"H. Collavizza, F. Delobel, and M. Rueher. A note on partial consistencies over continuous domains solving techniques. In Proc. CP98 (Fourth International Conference on Principles and Practice of Constraint Programming), Pisa, Italy, October 26-30, 1998.","key":"36_CR3","DOI":"10.1007\/3-540-49481-2_12"},{"unstructured":"A. Colmerauer. Sp\u00e9cifications de prolog iv. Technical report, GIA, Facult\u00e9 des Sciences de Luminy,163, Avenue de Luminy 13288 Marseille cedex 9 (France), 1994.","key":"36_CR4"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","volume":"32","author":"E. Davis","year":"1987","unstructured":"E. Davis. Constraint propagation with interval labels. Journal of Artificial Intelligence, pages 32:281\u2013331, 1987.","journal-title":"Journal of Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"A. Gotlieb, B. Botella, and Rueher K. A clp framework for computing structural test data. In Proc. ISSTA 98 (Symposium on Software Testing and Analysis),. ACM SIGSOFT, vol. 2, pp. 53\u201362, 1998.","key":"36_CR6","DOI":"10.1145\/271775.271790"},{"issue":"1","key":"36_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D. Goldberg","year":"1991","unstructured":"David Goldberg. What every computer scientist should know about floatingpoint arithmetic. ACM Computing Surveys, 23(1):5\u201348, March 1991.","journal-title":"ACM Computing Surveys"},{"unstructured":"A. Gotlieb. Automatic Test Data Generation using Constraint Logic Programming. PhD thesis, Universit\u00e9 de Nice \u2014 Sophia Antipolis, France, 2000.","key":"36_CR8"},{"unstructured":"F. Gualard. Langages et environnements en programmation par contraintes d\u2019intervalles. PhD thesis, Universit\u00e9 de Nantes\u2014 2, rue de la Houssini\u00e9re, F-44322 NANTES CEDEX 3, France, 2000.","key":"36_CR9"},{"unstructured":"E. Hansen, editor. Global optimization using interval analysis. Marcel Dekker, 1992.","key":"36_CR10"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF02307383","volume":"53","author":"H. Hong","year":"1994","unstructured":"H. Hong and V. Stahl. Safe starting regions by fixed points and tightening. Computing, pages 53:323\u2013335, 1994.","journal-title":"Computing"},{"key":"36_CR12","volume-title":"Number 13 in Nonconvex optimization and its applications","author":"R. B. Kearfott","year":"1996","unstructured":"R. Baker Kearfott. Rigorous Global Search: Continuous Problems. Number 13 in Nonconvex optimization and its applications. Kluwer Academic Publishers Group, Norwell, MA, USA, and Dordrecht, The Netherlands, 1996."},{"issue":"8","key":"36_CR13","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1109\/32.57624","volume":"16","author":"B. Korel","year":"1990","unstructured":"Bogdan Korel. Automated Software Test Data Generation. IEEE Transactions on Software Engineering, 16(8):870\u2013879, august 1990.","journal-title":"IEEE Transactions on Software Engineering"},{"unstructured":"O. Lhomme. Consistency techniques for numeric csps. In Proceedings of IJCAI\u2019 93, pages 232\u2013238, 1993.","key":"36_CR14"},{"issue":"1","key":"36_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. Mackworth","year":"1977","unstructured":"A. Mackworth. Consistency in networks of relations. Journal of Artificial Intelligence, pages 8(1):99\u2013118, 1977.","journal-title":"Journal of Artificial Intelligence"},{"unstructured":"R. Moore. Interval Analysis. Prentice Hall, 1966.","key":"36_CR16"},{"issue":"1","key":"36_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1023\/A:1008236911603","volume":"13","author":"J.F. Puget","year":"1998","unstructured":"J.F. Puget and P. Van-Hentenryck. A constraints satisfaction approach to a circuit design problem. Journal of global optimization, pages 13(1):75\u201393, 1998.","journal-title":"Journal of global optimization"},{"doi-asserted-by":"crossref","unstructured":"P. Van-Hentenryck, L. Michel, and Y. Deville. Numerica: a Modeling Languge for Global Optimization. MIT press, 1997.","key":"36_CR18","DOI":"10.7551\/mitpress\/5073.001.0001"},{"doi-asserted-by":"crossref","unstructured":"P. Van Hentenryck, D. McAllester, and D. Kapur. Solving polynomial systems using a branch and prune aprroach. SIAM Journal, 34(2), 1997.","key":"36_CR19","DOI":"10.1137\/S0036142995281504"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45578-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T21:09:24Z","timestamp":1585602564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45578-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428633","9783540455783"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45578-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}