{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T06:14:51Z","timestamp":1784182491013,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540749691","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74970-7_56","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T19:49:08Z","timestamp":1191959348000},"page":"790-797","source":"Crossref","is-referenced-by-count":9,"title":["An Analysis of Slow Convergence in Interval Propagation"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Bordeaux","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youssef","family":"Hamadi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1-2","key":"56_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","volume":"221","author":"K.R. Apt","year":"1999","unstructured":"Apt, K.R.: The essence of constraint propagation. Theoretical Computer Science (TCS)\u00a0221(1-2), 179\u2013210 (1999)","journal-title":"Theoretical Computer Science (TCS)"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Zoeteweij, P.: An analysis of arithmetic constraints on integer intervals. Constraints (to appear)","DOI":"10.1007\/s10601-007-9017-9"},{"issue":"1","key":"56_CR3","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.: Applying interval arithmetic to real, integer, and boolean constraints. J. of Logic Programming (JLP)\u00a032(1), 1\u201324 (1997)","journal-title":"J. of Logic Programming (JLP)"},{"issue":"2","key":"56_CR4","first-page":"125","volume":"2","author":"J.G. Cleary","year":"1987","unstructured":"Cleary, J.G.: Logical arithmetic. Future Computing Systems\u00a02(2), 125\u2013149 (1987)","journal-title":"Future Computing Systems"},{"issue":"3","key":"56_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","volume":"32","author":"E. Davis","year":"1987","unstructured":"Davis, E.: Constraint propagation with interval labels. Artificial Intelligence\u00a032(3), 281\u2013331 (1987)","journal-title":"Artificial Intelligence"},{"key":"56_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11817963_11","volume-title":"Computer Aided Verification","author":"B. Dutertre","year":"2006","unstructured":"Dutertre, B., De Moura, L.M.: A fast linear arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 81\u201394. Springer, Heidelberg (2006)"},{"issue":"1-3","key":"56_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T.W. Fruehwirth","year":"1998","unstructured":"Fruehwirth, T.W.: Theory and practice of constraint handling rules. J. of Logic Programming (JLP)\u00a037(1-3), 95\u2013138 (1998)","journal-title":"J. of Logic Programming (JLP)"},{"key":"56_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-58601-6_92","volume-title":"Principles and Practice of Constraint Programming","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J., Stuckey, P.J., Yap, R.H.C.: Beyond finite domains. In: Borning, A. (ed.) PPCP 1994. LNCS, vol.\u00a0874, pp. 86\u201394. Springer, Heidelberg (1994)"},{"key":"56_CR9","first-page":"69","volume-title":"Proc. of ACM Symp. on Theory of Computing (STOC)","author":"M.W. Krentel","year":"1986","unstructured":"Krentel, M.W.: The complexity of optimization problems. In: Proc. of ACM Symp. on Theory of Computing (STOC), pp. 69\u201376. ACM Press, New York (1986)"},{"issue":"1","key":"56_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0004-3702(02)00194-7","volume":"139","author":"Y. Lebbah","year":"2002","unstructured":"Lebbah, Y., Lhomme, O.: Accelerating filtering techniques for numeric CSPs. Artificial Intelligence\u00a0139(1), 109\u2013132 (2002)","journal-title":"Artificial Intelligence"},{"key":"56_CR11","series-title":"Lecture Notes in Computer Science","first-page":"22","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"M. Leconte","year":"2006","unstructured":"Leconte, M., Berstel, B.: Extending a CP solver with congruences as domains for program verification. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 22\u201333. Springer, Heidelberg (2006)"},{"key":"56_CR12","first-page":"378","volume-title":"Proc.of Joint Int. Conf. and Symp. on Logic Programming (JICSLP)","author":"O. Lhomme","year":"1996","unstructured":"Lhomme, O., Gottlieb, A., Rueher, M., Taillibert, P.: Boosting the interval narrowing algorithm. In: Proc.of Joint Int. Conf. and Symp. on Logic Programming (JICSLP), pp. 378\u2013392. MIT Press, Cambridge (1996)"},{"issue":"4","key":"56_CR13","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"C. Papadimitiou","year":"1981","unstructured":"Papadimitiou, C.: On the complexity of integer programming. J. of the ACM\u00a028(4), 765\u2013768 (1981)","journal-title":"J. of the ACM"},{"key":"56_CR14","volume-title":"Computational Complexity","author":"C..H. Papadimitriou.","year":"1994","unstructured":"Papadimitriou, Ch.H.: Computational Complexity. Addison Wesley, Reading (1994)"},{"key":"56_CR15","doi-asserted-by":"crossref","unstructured":"Seshia, S.A., Bryant, R.A.: Deciding quantifier-free presburger formulas using parametrized solution bounds. Logical Methods in Computer Science 1(2) (2005)","DOI":"10.2168\/LMCS-1(2:6)2005"},{"key":"56_CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretic fixpoint theorem and its applications. Pacific J. of Mathematics\u00a05, 285\u2013309 (1955)","journal-title":"Pacific J. of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:25Z","timestamp":1619506165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749691"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_56","relation":{},"subject":[]}}