{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:42:39Z","timestamp":1743021759889,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009863"},{"type":"electronic","value":"9783540366072"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36607-5_4","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T15:21:25Z","timestamp":1183476085000},"page":"47-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Automated Reasoning on the Properties of Numerical Constraints"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Bordeaux","sequence":"first","affiliation":[]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Benhamou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(96)00142-2","volume":"32","author":"F. Benhamou","year":"1997","unstructured":"F. Benhamou and W. J. Older. Applying interval arithmetic to real, integer, and boolean constraints. J. of Logic Programming, 32(1):1\u201324, 1997.","journal-title":"J. of Logic Programming"},{"key":"4_CR2","unstructured":"L. Bordeaux, E. Monfroy, and F. Benhamou. Raisonnement automatique sur les propri\u00e9t\u00e9s de contraintes num\u00e9riques. In Actes des 11\u00e8mes J. Franc. de Programmation en Logique et par Contraintes (JFPLC), Nice, France, 2002. Herm\u00e8s. in french."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/512950.512973","volume-title":"Conf. Record of the 4th Annual ACM Symp. on Principles of Programming Languages (POPL)","author":"P. Cousot","year":"1977","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conf. Record of the 4th Annual ACM Symp. on Principles of Programming Languages (POPL), pages 238\u2013252, Los Angeles, CA, 1977. ACM Press, New York, NY."},{"issue":"2\u20133","key":"4_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. J. of Logic Programming, 13(2\u20133):103\u2013179, 1992.","journal-title":"J. of Logic Programming"},{"issue":"1\u20132","key":"4_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(99)00012-0","volume":"109","author":"Y. Deville","year":"1999","unstructured":"Y. Deville, O. Barette, and P. Van Hentenryck. Constraint satisfaction over connected row convex constraints. Artificial Intelligence, 109(1\u20132):243\u2013271, 1999.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E. C. Freuder","year":"1982","unstructured":"E. C. Freuder. A sufficient condition for backtrack-free search. J. of the ACM, 29(1):24\u201332, 1982.","journal-title":"J. of the ACM"},{"issue":"2\u20133","key":"4_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0004-3702(92)90021-O","volume":"56","author":"F. Giunchiglia","year":"1992","unstructured":"F. Giunchiglia and T. Walsh. A theory of abstraction. Artificial Intelligence, 56(2\u20133): 323\u2013390, 1992.","journal-title":"Artificial Intelligence"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"L. Granvilliers, E. Monfroy, and F. Benhamou. Symbolic-interval cooperation in constraint programming. In Proc. of the Int. Symp. on Symbolic and Algebraic Computation (ISSAC), London, Ontario, 2001. ACM Press.","DOI":"10.1145\/384101.384123"},{"key":"4_CR9","unstructured":"E. R. Hansen. Global Optimization Using Interval Analysis. Pure and Applied Mathematics. Marcel Dekker Inc., 1992."},{"key":"4_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1007\/3-540-46135-3_33","volume-title":"Proc. of the 8th Int. Conf. on Principles and Practice of Constraint Programming (CP)","author":"D. Lesaint","year":"2002","unstructured":"D. Lesaint. Inferring constraint types in constraint programming. In Proc. of the 8th Int. Conf. on Principles and Practice of Constraint Programming (CP), LNCS, pages 492\u2013507, Ithaca, NY, 2002. Springer."},{"key":"4_CR11","unstructured":"K. Marriott and P.-J. Stuckey. Approximating interaction between linear arithmetic constraints. In Proc. of the International Symposium on Logic Programming (ISLP), pages 571\u2013585, Ithaca, NY, 1994. MIT Press."},{"key":"4_CR12","unstructured":"R. E. Moore. Interval Analysis. Prentice-Hall, 1966."},{"key":"4_CR13","unstructured":"S. Nash and A. Sofer. Linear and Nonlinear Programming. McGraw Hill, 1996."},{"key":"4_CR14","unstructured":"E. Petrov and E. Monfroy. Automatic analysis of composite solvers. In Proc. of the 14th IEEE Int. Conf. on Tools with Artificial Intelligence (ICTAI), Washington, 2002. IEEE Press. To appear."},{"issue":"1\u20132","key":"4_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF00143879","volume":"1","author":"D. Sam-Haroud","year":"1996","unstructured":"D. Sam-Haroud and B. Faltings. Consistency techniques for continuous constraints. Constraints, 1(1\u20132):85\u2013118, 1996.","journal-title":"Constraints"},{"key":"4_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/3-540-45349-0_34","volume-title":"Proc. of the 6th Int. Conf. on Principles and Practice of Constraint Programming (CP)","author":"Z. Yuanlin","year":"2000","unstructured":"Z. Yuanlin and R. H. C. Yap. Arc consistency on n-ary monotonic and linear constraints. In Proc. of the 6th Int. Conf. on Principles and Practice of Constraint Programming (CP), LNCS, pages 470\u2013483, Singapore, 2000. Springer."}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36607-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T20:05:40Z","timestamp":1674072340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-36607-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009863","9783540366072"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36607-5_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"15 April 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}