{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:44:36Z","timestamp":1725576276991},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232124"},{"type":"electronic","value":"9783540302100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30210-0_11","type":"book-chapter","created":{"date-parts":[[2011,1,18]],"date-time":"2011-01-18T10:34:36Z","timestamp":1295346876000},"page":"118-131","source":"Crossref","is-referenced-by-count":0,"title":["Combination of Nonlinear Terms in Interval Constraint Satisfaction Techniques"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Granvilliers","sequence":"first","affiliation":[]},{"given":"Mina","family":"Ouabiba","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1009943413814","volume":"3","author":"F. Benhamou","year":"1997","unstructured":"Benhamou, F., Granvilliers, L.: Automatic Generation of Numerical Redundancies for Non-Linear Constraint Solving. Reliable Computing\u00a03(3), 335\u2013344 (1997)","journal-title":"Reliable Computing"},{"key":"11_CR2","first-page":"124","volume-title":"Proceedings of International Symposium on Logic Programming","author":"F. Benhamou","year":"1994","unstructured":"Benhamou, F., McAllester, D., Van Hentenryck, P.: CLP(Intervals) Revisited. In: Bruynooghe, M. (ed.) Proceedings of International Symposium on Logic Programming, Ithaca, USA, pp. 124\u2013138. MIT Press, Cambridge (1994)"},{"key":"11_CR3","first-page":"753","volume-title":"Handbook of Automated Reasoning","author":"A. Bockmayr","year":"2001","unstructured":"Bockmayr, A., Weispfenning, V.: Solving Numerical Constraints. In: Handbook of Automated Reasoning, pp. 753\u2013842. Elsevier Science Publishers, Amsterdam (2001)"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0304-3975(01)00358-9","volume":"285","author":"P. Borovansky","year":"2002","unstructured":"Borovansky, P., Kirchner, C., Kirchner, H., Moreau, P.-E.: ELAN from a rewriting logic point of view. Theoretical Computer Science\u00a0285(2), 155\u2013185 (2002)","journal-title":"Theoretical Computer Science"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/978-94-009-5225-6_6","volume-title":"Multidimensional Systems Theory","author":"B. Buchberger","year":"1985","unstructured":"Buchberger, B.: Gr\u00f6bner Bases: an Algorithmic Method in Polynomial Ideal Theory. In: Bose, N.K. (ed.) Multidimensional Systems Theory, pp. 184\u2013232. D. Reidel Publishing Company, Dordrecht (1985)"},{"issue":"6","key":"11_CR6","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1023\/A:1014750702474","volume":"7","author":"L. Granvilliers","year":"2001","unstructured":"Granvilliers, L.: On the Combination of Interval Constraint Solvers. Reliable Computing\u00a07(6), 467\u2013483 (2001)","journal-title":"Reliable Computing"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1023\/A:1011266226870","volume":"20","author":"L. Granvilliers","year":"2001","unstructured":"Granvilliers, L., Benhamou, F.: Progress in the Solving of a Circuit Design Problem. Journal of Global Optimization\u00a020(2), 155\u2013168 (2001)","journal-title":"Journal of Global Optimization"},{"key":"11_CR8","first-page":"150","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Computation","author":"L. Granvilliers","year":"2001","unstructured":"Granvilliers, L., Monfroy, E., Benhamou, F.: Symbolic-Interval Cooperation in Constraint Programming. In: Villard, G. (ed.) Proceedings of International Symposium on Symbolic and Algebraic Computation, pp. 150\u2013166. ACM Press, New York (2001)"},{"issue":"5","key":"11_CR9","doi-asserted-by":"crossref","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.: Interval Arithmetic: From Principles to Implementation. Journal of the Association for Computing Machinery\u00a048(5), 1038\u20131068 (2001)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"11_CR10","unstructured":"Institute of Electrical and Electronics Engineers. IEEE Standard for Binary Floating-Point Arithmetic, 1985. IEEE Std 754-1985, Reaffirmed (1990)"},{"issue":"16","key":"11_CR11","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1145\/78928.78931","volume":"2","author":"R.B. Kearfott","year":"1990","unstructured":"Kearfott, R.B., Novoa, M.: Intbis: A Portable Interval Newton\/Bisection Package. ACM Transactions on Mathematical Software\u00a02(16), 152\u2013157 (1990)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"11_CR12","first-page":"232","volume-title":"Proceedings of International Joint Conference on Artificial Intelligence","author":"O. Lhomme","year":"1993","unstructured":"Lhomme, O.: Consistency Techniques for Numeric CSPs. In: Bajcsy, R. (ed.) Proceedings of International Joint Conference on Artificial Intelligence, pp. 232\u2013238. Morgan Kaufmann, San Francisco (1993)"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in Networks of Relations. Artificial Intelligence\u00a08(1), 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"11_CR14","volume-title":"Interval Analysis","author":"R.E. Moore","year":"1966","unstructured":"Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J.J. Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing Unconstrained Optimization Software. ACM Transactions on Mathematical Software\u00a07(1), 17\u201341 (1981)","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1009821007410","volume":"4","author":"M.H. Emden Van","year":"1999","unstructured":"Van Emden, M.H.: Algorithmic Power from Declarative Use of Redundant Constraints. Constraints\u00a04(4), 363\u2013381 (1999)","journal-title":"Constraints"},{"key":"11_CR17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5073.001.0001","volume-title":"Numerica: a Modeling Language for Global Optimization","author":"P. Hentenryck Van","year":"1997","unstructured":"Van Hentenryck, P., Michel, L., Deville, Y.: Numerica: a Modeling Language for Global Optimization. MIT Press, Cambridge (1997)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30210-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:49:25Z","timestamp":1605761365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30210-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232124","9783540302100"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30210-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}