{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:20:30Z","timestamp":1758824430258},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T00:00:00Z","timestamp":1179360000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T00:00:00Z","timestamp":1179360000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1007\/s10601-007-9017-9","type":"journal-article","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T20:40:36Z","timestamp":1179348036000},"page":"429-468","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Analysis of Arithmetic Constraints on Integer Intervals"],"prefix":"10.1007","volume":"12","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Zoeteweij","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,5,17]]},"reference":[{"issue":"3","key":"9017_CR1","first-page":"263","volume":"33","author":"K. R. Apt","year":"1998","unstructured":"Apt, K. R. (1998). A proof theoretic view of constraint programming. Fundamenta Informaticae, 33(3), 263\u2013293. Available via http:\/\/arXiv.org\/archive\/cs\/.","journal-title":"Fundamenta Informaticae"},{"key":"9017_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of constraint programming","author":"K. R. Apt","year":"2003","unstructured":"Apt, K. R. (2003). Principles of constraint programming. Cambridge: Cambridge University Press."},{"key":"9017_CR3","doi-asserted-by":"crossref","unstructured":"Apt, K. R., & Zoeteweij, P. (2004). A comparative study of arithmetic constraints on integer intervals. In K. R. Apt, F. Fages, F. Rossi, P. Szeredi, & J. V\u00e1ncza (Eds.), Recent advances in constraints. Lecture notes in artificial intelligence, vol. 3010, pp. 1\u201324. Available via http:\/\/xxx.lanl.gov\/abs\/cs.DS\/0403016.","DOI":"10.1007\/b96986"},{"key":"9017_CR4","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., & Puget, J.-F. (1999). Revising hull and box consistency. In Proceedings of the 16th International Conference on Logic Programming (ICLP\u201999), pp.\u00a0230\u2013244. MIT Press."},{"key":"9017_CR5","unstructured":"Benhamou, F., McAllester, D., & Van\u00a0Hentenryck, P. (1994). CLP(intervals) revisited. In Proceedings of the 1994 International Symposium on Logic programming, pp.\u00a0124\u2013138. MIT Press."},{"issue":"1","key":"9017_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(96)00142-2","volume":"32","author":"F. Benhamou","year":"1997","unstructured":"Benhamou, F., & Older, W. J. (1997). Applying interval arithmetic to real, integer, and Boolean constraints. Journal of Logic Programming, 32(1), 1\u201324.","journal-title":"Journal of Logic Programming"},{"key":"9017_CR7","unstructured":"Cheadle, A. M., Harvey, W., Sadler, A. J., Schimpf, J., Shen, K., & Wallace, M. G. (2003). ECL\n                    i\n                  PS\n                    e\n                  : a tutorial introduction. Available from http:\/\/www.eclipse-clp.org\/."},{"issue":"3","key":"9017_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0743-1066(95)00121-2","volume":"27","author":"P. Codognet","year":"1996","unstructured":"Codognet, P., & Diaz, D. (1996). Compiling constraints in clp(fd). Journal of Logic Programming, 27(3), 185\u2013226.","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"9017_CR9","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1009922003700","volume":"5","author":"H. Collaviza","year":"1999","unstructured":"Collaviza, H., Delobel, F., & Rueher, M. (1999). Comparing partial consistencies. Reliable Computing, 5(3), 213\u2013228.","journal-title":"Reliable Computing"},{"key":"9017_CR10","unstructured":"Dubrovsky, V., & Shvetsov, A. (1995). Quantum Cyberteaser. Available from http:\/\/www.nsta.org\/quantum\/kyotoarc.asp, (May\/June)."},{"key":"9017_CR11","unstructured":"GNU MP: The GNU Multiple Precision Library (2006). Edition 4.2.1. Available from http:\/\/www.gmplib.org, (September)."},{"key":"9017_CR12","doi-asserted-by":"crossref","unstructured":"Goualard, F., & Granvilliers, L. (2005). Controlled propagation in continuous numerical constraint networks. In Proceedings of the 2005 ACM Symposium on Applied Computing, pp. 377\u2013382. ACM Press.","DOI":"10.1145\/1066677.1066765"},{"key":"9017_CR13","unstructured":"Granvilliers, L. (2004). RealPaver user\u2019s manual: Solving nonlinear constraints by interval computations. Edition 0.4, for RealPaver Version 0.4. Available from http:\/\/sourceforge.net\/projects\/realpaver, (August)."},{"issue":"2","key":"9017_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1022323717928","volume":"8","author":"W. Harvey","year":"2003","unstructured":"Harvey, W., & Stuckey, P. J. (2003). Improving linear constraint propagation by changing constraint representation. Constraints, 8(2), 173\u2013207.","journal-title":"Constraints"},{"issue":"5","key":"9017_CR15","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1145\/502102.502106","volume":"48","author":"T. J. Hickey","year":"2001","unstructured":"Hickey, T. J., Ju, Q., & Van Emden M. H. (2001). Interval arithmetic: From principles to implementation. Journal of the ACM, 48(5), 1038\u20131068.","journal-title":"Journal of the ACM"},{"key":"9017_CR16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with constraints: An introduction","author":"K. Marriott","year":"1998","unstructured":"Marriott, K., & Stuckey, P. (1998). Programming with constraints: An introduction. Cambridge, MA: MIT Press."},{"key":"9017_CR17","volume-title":"Interval analysis","author":"R. E. Moore","year":"1966","unstructured":"Moore, R. E. (1966). Interval analysis. Englewood Cliffs, NJ: Prentice-Hall."},{"key":"9017_CR18","unstructured":"Ratz, D. (1996). Inclusion isotone extended interval arithmetic: A toolbox update. Technical Report D-76128, University of Karlsruhe."},{"key":"9017_CR19","unstructured":"Schulte, C., & Smolka, G. (2002). Finite domain constraint programming in Oz. A tutorial. Available from http:\/\/www.mozart-oz.org\/documentation\/fdt\/, Version 1.3.1 (20040616), (August)."},{"issue":"3","key":"9017_CR20","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/1065887.1065889","volume":"27","author":"C. Schulte","year":"2005","unstructured":"Schulte, C., & Stuckey, P. J. (2005). When do bounds and domain propagation lead to the same search space? Transactions on Programming Languages and Systems, 27(3), 388\u2013425.","journal-title":"Transactions on Programming Languages and Systems"},{"key":"9017_CR21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5073.001.0001","volume-title":"Numerica: A modeling language for global optimization","author":"P. Van Hentenryck","year":"1997","unstructured":"Van\u00a0Hentenryck, P., Michel, L., & Deville, Y. (1997). Numerica: A modeling language for global optimization. Cambridge, MA: MIT Press."},{"key":"9017_CR22","unstructured":"Wallace, R. J., & Freuder, E. F. (1992). Ordering heuristics for arc consistency algorithms. Available from http:\/\/4c.ucc.ie\/web\/pubs.jsp."},{"key":"9017_CR23","doi-asserted-by":"crossref","unstructured":"Zoeteweij, P. (2003). Opensolver: A coordination-enabled abstract branch-and-prune tree search engine (abstract). In F. Rossi (Ed.), Proceedings of CP 2003. LNCS, vol.\u00a02833, p.\u00a01002. Springer.","DOI":"10.1007\/978-3-540-45193-8_126"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9017-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-007-9017-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10601-007-9017-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9017-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T18:42:25Z","timestamp":1630435345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-007-9017-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,17]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["9017"],"URL":"https:\/\/doi.org\/10.1007\/s10601-007-9017-9","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,17]]},"assertion":[{"value":"5 July 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2007","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}