{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T04:16:27Z","timestamp":1787717787746,"version":"build-2784847793"},"reference-count":37,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0167-6423(97)00008-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:52:44Z","timestamp":1051141964000},"page":"83-118","source":"Crossref","is-referenced-by-count":30,"title":["Constraint programming over nonlinear constraints"],"prefix":"10.1016","volume":"30","author":[{"given":"Pascal","family":"Van Hentenryck","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurent","family":"Michel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Benhamou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(97)00008-7_BIB1","series-title":"Proc. Internat. Symp. on Logic Programming (ILPS-94)","first-page":"124","article-title":"CLP(intervals) revisited","author":"Benhamou","year":"1994"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/S0743-1066(96)00142-2","article-title":"Applying interval arithmetic to real, integer and Boolean constraints","author":"Benhamou","year":"1997","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB3","first-page":"125","article-title":"Logical arithmetic","volume":"2","author":"Cleary","year":"1987","journal-title":"Future Generation Comput. Systems"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB4","series-title":"Numerical Toolbox for Verified Computing I \u2014 Basic Numerical Problems, Theory, Algorithms, and PASCAL-XSC Programs","author":"Hammer","year":"1993"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB5","series-title":"Global Optimization Using Interval Analysis","author":"Hansen","year":"1992"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0096-3003(83)90001-2","article-title":"An interval Newton method","volume":"12","author":"Hansen","year":"1983","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/S0167-6423(97)00008-7_BIB7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01933165","article-title":"Bounding solutions of systems of equations using interval analysis","volume":"21","author":"Hansen","year":"1981","journal-title":"BIT"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48320-2","article-title":"Test Examples for Nonlinear Programming Codes","author":"Hock","year":"1981"},{"issue":"3\u20134","key":"10.1016\/S0167-6423(97)00008-7_BIB9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF02307383","article-title":"Safe starting regions by fixed points and tightening","volume":"53","author":"Hong","year":"1994","journal-title":"Computing"},{"issue":"1","key":"10.1016\/S0167-6423(97)00008-7_BIB10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","article-title":"Testing unconstrained optimization software","volume":"7","author":"Mor\u00e9","year":"1981","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB11","article-title":"Preconditioners for the interval Gauss-Seidel Method","volume":"27","author":"Kearfott","year":"1990","journal-title":"S1AM J. Numer. Anal."},{"issue":"1","key":"10.1016\/S0167-6423(97)00008-7_BIB12","first-page":"59","article-title":"A review of preconditioners for the interval Gauss-Seidel method","volume":"1","author":"Kearfott","year":"1991","journal-title":"Interval Comput."},{"key":"10.1016\/S0167-6423(97)00008-7_BIB13","unstructured":"R.B. Kearfott, A review of techniques in the verified solution of constrained global optimization problems, to appear."},{"key":"10.1016\/S0167-6423(97)00008-7_BIB14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02234767","article-title":"Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken","volume":"4","author":"Krawczyk","year":"1969","journal-title":"Computing"},{"issue":"3\u20134","key":"10.1016\/S0167-6423(97)00008-7_BIB15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0743-1066(93)90045-I","article-title":"Interval computation as deduction in CHIP","volume":"16","author":"Lee","year":"1993","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/S0167-6423(97)00008-7_BIB16","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/0906002","article-title":"The tunnelling algorithm for the global minimization of functions","volume":"6","author":"Levy","year":"1985","journal-title":"SIAM J. Sci. Statist. Comput."},{"issue":"1","key":"10.1016\/S0167-6423(97)00008-7_BIB17","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/78928.78930","article-title":"Chemical equilibrium systems as numerical test problems","volume":"16","author":"Meintjes","year":"1990","journal-title":"ACM Trans. Math. Software"},{"issue":"2","key":"10.1016\/S0167-6423(97)00008-7_BIB19","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: Fundamental properties and applications to picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Inform. Sci."},{"key":"10.1016\/S0167-6423(97)00008-7_BIB20","series-title":"Interval Analysis","author":"Moore","year":"1966"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB21","series-title":"Methods and Applications of Interval Analysis","author":"Moore","year":"1979"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB22","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1137\/0714072","article-title":"Safe starting regions for iterative methods","volume":"14","author":"Moore","year":"1977","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0167-6423(97)00008-7_BIB23","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/355815.355820","article-title":"Numerical solution of nonlinear equations","volume":"5","author":"More","year":"1979","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB24","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0096-3003(87)90064-6","article-title":"Computing all solutions to polynomial systems using homotopy continuation","volume":"24","author":"Morgan","year":"1987","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/S0167-6423(97)00008-7_BIB25","series-title":"Solving Polynomial Systems Using Continuation for Scientific and Engineering Problems","author":"Morgan","year":"1987"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB26","article-title":"Interval Methods for Systems of Equations","author":"Neumaier","year":"1990"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB27","series-title":"PPCP'93","article-title":"Programming in CLP(BNR)","author":"Older","year":"1993"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB28","series-title":"Canadian Conf. on Computer & Electrical Engineering","article-title":"Extending prolog with constraint arithmetics on real intervals","author":"Older","year":"1990"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB29","series-title":"Constraint Logic Programming: Selected Research","article-title":"Constraint arithmetic on real intervals","author":"Older","year":"1993"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB30","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10861-0","article-title":"Automatic Differentiation: Techniques and Applications","author":"Rall","year":"1981"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB31","series-title":"New Computer Methods for Global Optimization","author":"Ratschek","year":"1988"},{"issue":"3\u20134","key":"10.1016\/S0167-6423(97)00008-7_BIB32","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02307384","article-title":"Box-splitting strategies for the interval Gauss-Seidel step in a global optimization method","volume":"53","author":"Ratz","year":"1994","journal-title":"Computing"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB33","series-title":"Topics in Validated Computations","first-page":"217","article-title":"Verification methods for dense and sparse systems of equations","author":"Rump","year":"1988"},{"key":"10.1016\/S0167-6423(97)00008-7_BIB34","series-title":"Numerical Optimization of Computer Models","author":"Schwefel","year":"1981"},{"issue":"4","key":"10.1016\/S0167-6423(97)00008-7_BIB35","article-title":"Hierarchical arc consistency applied to numeric processing in constraint logic programming","volume":"8","author":"Sidebottom","year":"1992","journal-title":"Computat. Intelligence"},{"issue":"2","key":"10.1016\/S0167-6423(97)00008-7_BIB36","doi-asserted-by":"crossref","DOI":"10.1137\/S0036142995281504","article-title":"Solving polynomial systems using a branch and prune approach","volume":"34","author":"Van Hentenryck","year":"1997","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"10.1016\/S0167-6423(97)00008-7_BIB37","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1137\/0731049","article-title":"Homotopies exploiting Newton polytopes for solving sparse polynomial systems","volume":"31","author":"Verschelde","year":"1994","journal-title":"SIAM J. Numer. Anal."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642397000087?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642397000087?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T03:55:35Z","timestamp":1555473335000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642397000087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0167642397000087"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(97)00008-7","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}