{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:24:52Z","timestamp":1775053492500,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540859574","type":"print"},{"value":"9783540859581","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85958-1_23","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:26:13Z","timestamp":1221881173000},"page":"342-357","source":"Crossref","is-referenced-by-count":12,"title":["Exploiting Common Subexpressions in Numerical CSPs"],"prefix":"10.1007","author":[{"given":"Ignacio","family":"Araya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Neveu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Trombettoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising Hull and Box Consistency. In: Proc. ICLP, pp. 230\u2013244 (1999)"},{"key":"23_CR2","volume-title":"Calculus and Mathematica","author":"D.P. Brown","year":"1991","unstructured":"Brown, D.P.: Calculus and Mathematica. Addison Wesley, Reading (1991)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: Gr\u00f6bner Bases: an Algorithmic Method in Polynomial Ideal Theory. Multidimensional Systems Theory, 184\u2013232 (1985)","DOI":"10.1007\/978-94-009-5225-6_6"},{"key":"23_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45988-X_10","volume-title":"Frontiers of Combining Systems","author":"M. Ceberio","year":"2002","unstructured":"Ceberio, M., Granvilliers, L.: Solving Nonlinear Equations by Abstraction, Gaussian Elimination, and Interval Methods. In: Armando, A. (ed.) FroCos 2002. LNCS (LNAI), vol.\u00a02309. Springer, Heidelberg (2002)"},{"key":"23_CR5","unstructured":"Chabert, G. (2008), http:\/\/ibex-lib.org"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1009922003700","volume":"5","author":"H. Collavizza","year":"1999","unstructured":"Collavizza, H., Delobel, F., Rueher, M.: Comparing partial consistencies. Reliable Computing\u00a05(3), 213\u2013228 (1999)","journal-title":"Reliable Computing"},{"key":"23_CR7","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Some Practicable Filtering Techniques for the Constraint Satisfaction Problem. In: Proc. IJCAI, pp. 412\u2013417 (1997)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/BFb0032034","volume-title":"Automata, Languages and Programming","author":"P. Flajolet","year":"1990","unstructured":"Flajolet, P., Sipala, P., Steyaert, J.-M.: Analytic variations on the common subexpression problem. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 220\u2013334. Springer, Heidelberg (1990)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1145\/384101.384123","volume-title":"Proc. ISSAC","author":"L. Granvilliers","year":"2001","unstructured":"Granvilliers, L., Monfroy, E., Benhamou, F.: Symbolic-Interval Cooperation in Constraint Programming. In: Proc. ISSAC, pp. 150\u2013166. ACM, New York (2001)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1022323717928","volume":"7","author":"W. Harvey","year":"2003","unstructured":"Harvey, W., Stuckey, P.J.: Improving Linear Constraint Propagation by Changing Constraint Representation. Constraints\u00a07, 173\u2013207 (2003)","journal-title":"Constraints"},{"key":"23_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0023-6","volume-title":"Introduction to Maple","author":"A. Heck","year":"2003","unstructured":"Heck, A.: Introduction to Maple. Springer, Heidelberg (2003)"},{"key":"23_CR12","unstructured":"Lebbah, Y.: Contribution \u00e0 la R\u00e9solution de Contraintes par Consistance Forte. Phd thesis, Universit\u00e9 de Nantes (1999)"},{"key":"23_CR13","unstructured":"Lhomme, O.: Consistency Tech. for Numeric CSPs. In: IJCAI, pp. 232\u2013238 (1993)"},{"key":"23_CR14","unstructured":"Merlet, J.-P.: ALIAS: An Algorithms Library for Interval Analysis for Equation Systems. Technical report, INRIA Sophia (2000), http:\/\/www-sop.inria.fr\/coprin\/logiciels\/ALIAS\/ALIAS.html"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Merlet, J.-P.: Interval Analysis and Robotics. In: Symp. of Robotics Research (2007)","DOI":"10.1007\/11889205_3"},{"key":"23_CR16","unstructured":"Muchnick, S.: Advanced Compiler Design and Implem. M. Kauffmann (1997)"},{"key":"23_CR17","volume-title":"Interval Methods for Systems of Equations","author":"A. Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)"},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10898-005-0937-x","volume":"33","author":"H. Schichl","year":"2005","unstructured":"Schichl, H., Neumaier, A.: Interval analysis on directed acyclic graphs for global optimization. Journal of Global Optimization\u00a033(4), 541\u2013562 (2005)","journal-title":"Journal of Global Optimization"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-540-74970-7_45","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"G. Trombettoni","year":"2007","unstructured":"Trombettoni, G., Chabert, G.: Constructive Interval Disjunction. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 635\u2013650. Springer, Heidelberg (2007)"},{"key":"23_CR20","first-page":"72","volume-title":"Proc. ICTAI 2004","author":"X.-H. Vu","year":"2004","unstructured":"Vu, X.-H., Schichl, H., Sam-Haroud, D.: Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems. In: Proc. ICTAI 2004, pp. 72\u201381. IEEE, Los Alamitos (2004)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85958-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:45:42Z","timestamp":1738370742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85958-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859574","9783540859581"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85958-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}