{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:20:24Z","timestamp":1757312424366},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2008,1,10]],"date-time":"2008-01-10T00:00:00Z","timestamp":1199923200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10601-007-9027-7","type":"journal-article","created":{"date-parts":[[2008,1,9]],"date-time":"2008-01-09T07:16:18Z","timestamp":1199862978000},"page":"206-226","source":"Crossref","is-referenced-by-count":9,"title":["A Reinforcement Learning Approach to Interval Constraint Propagation"],"prefix":"10.1007","volume":"13","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Goualard","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Jermann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,1,10]]},"reference":[{"issue":"1","key":"9027_CR1","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (2002). The non-stochastic multi-armed bandit problem. SIAM Journal on Computing, 32(1), 48\u201377.","journal-title":"SIAM Journal on Computing"},{"key":"9027_CR2","doi-asserted-by":"crossref","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., & Shapire, R. E. (1995). Gambling in a rigged casino: The adversarial multi-armed bandit problem. In Proceedings of the 36th annual symposium on foundations of computer science (FOCS \u201995), pp. 322\u2013331. IEEE Computer Society Press.","DOI":"10.1109\/SFCS.1995.492488"},{"key":"9027_CR3","doi-asserted-by":"crossref","unstructured":"Benhamou, F. (2001). Interval constraints, interval propagation. In P.\u00a0M. Pardalos, & C.\u00a0A. Floudas (Eds.), Encyclopedia of Optimization, vol.\u00a03, pp. 45\u201348. Kluwer Academic Publishers.","DOI":"10.1007\/0-306-48332-7_230"},{"key":"9027_CR4","unstructured":"Benhamou, F., McAllester, D., & Van Hentenryck, P. (1994). CLP(Intervals) revisited. In Proceedings international symposium on logic program, pp. 124\u2013138. The MIT Press."},{"key":"9027_CR5","unstructured":"Dixon, L.\u00a0C.\u00a0W., & Szeg\u00f6, G.\u00a0P. (1978). The global optimization problem: An introduction. In L.\u00a0C.\u00a0W. Dixon & G.\u00a0P. Szeg\u00f6 (Eds.), Towards Global Optimization 2, pp. 1\u201315. North-Holland."},{"issue":"3","key":"9027_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/355958.355963","volume":"7","author":"I.S. Duff","year":"1981","unstructured":"Duff, I.\u00a0S. (1981). On algorithms for obtaining a maximum transversal. ACM Transactions on Mathematical Software, 7(3), 315\u2013330, (September).","journal-title":"ACM Transactions on Mathematical Software"},{"key":"9027_CR7","doi-asserted-by":"crossref","unstructured":"Goualard, F. (2005). On considering an interval constraint solving algorithm as a free-steering nonlinear gauss-seidel procedure. In Proceedings of the 20th annual ACM symposium on applied computing (reliable computation and applications track), vol.\u00a02, pp. 1434\u20131438. The Association for Computing Machinery, Inc, (March).","DOI":"10.1145\/1066677.1067004"},{"key":"9027_CR8","doi-asserted-by":"crossref","unstructured":"Goualard, F., & Jermann, C. (2006). On the selection of a transversal to solve nonlinear systems with interval arithmetic. In V. N. Alexandrov et\u00a0al. (Eds.), Proceedings international conference on computational science 2006, Lecture Notes in Computer Science, vol. 3991, pp. 332\u2013339. Springer-Verlag.","DOI":"10.1007\/11758501_47"},{"key":"9027_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0020-0190(00)00048-X","volume":"74","author":"L. Granvilliers","year":"2000","unstructured":"Granvilliers, L., & Hains, G. (2000). A conservative scheme for parallel interval narrowing. Information Processing Letters, 74, 141\u2013146.","journal-title":"Information Processing Letters"},{"key":"9027_CR10","first-page":"203","volume":"21","author":"E.R. Hansen","year":"1981","unstructured":"Hansen. E.\u00a0R., & Sengupta, S. (1981). Bounding solutions of systems of equations using interval analysis. Bibliothek Information Technologie, 21, 203\u2013211.","journal-title":"Bibliothek Information Technologie"},{"key":"9027_CR11","unstructured":"Herbort, S., & Ratz, D. (1997). Improving the efficiency of a nonlinear-system-solver using a componentwise newton method. Research Report 2\/1997, Institut f\u00fcr Angewandte Mathematik, Universit\u00e4t Karslruhe (TH)."},{"issue":"5","key":"9027_CR12","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1145\/502102.502106","volume":"48","author":"T. J. Hickey","year":"2001","unstructured":"Hickey, T.\u00a0J., Ju, Q., & Van Emden, M.\u00a0H. (2001). Interval arithmetic: From principles to implementation. J. ACM, 48(5), 1038\u20131068, (September).","journal-title":"J. ACM"},{"key":"9027_CR13","unstructured":"IEEE (1990). IEEE standard for binary floating-point arithmetic. Technical Report IEEE Std 754-1985, Institute of Electrical and Electronics Engineers, 1985. Reaffirmed 1990."},{"key":"9027_CR14","unstructured":"INRIA Project COPRIN: Contraintes, OPtimisation, R\u00e9solution par INtervalles. The COPRIN examples page. Web page at http:\/\/www-sop.inria.fr\/coprin\/logiciels\/ALIAS\/Benches\/benches.html ."},{"key":"9027_CR15","first-page":"59","volume":"1","author":"R.B. Kearfott","year":"1991","unstructured":"Kearfott, R.\u00a0B., Hu, C., & Novoa, M. III (1991). A review of preconditioners for the interval Gauss-Seidel method. Interval Computations, 1, 59\u201385.","journal-title":"Interval Computations"},{"key":"9027_CR16","unstructured":"Kearfott, R.\u00a0B., & Shi, X. (1996). Optimal preconditioners for interval gauss-seidel methods. In G.\u00a0Alefeld & A.\u00a0Frommer (Eds.), Scientific Computing and Validated Numerics, pp. 173\u2013178. Akademie Verlag."},{"issue":"1","key":"9027_CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0004-3702(02)00194-7","volume":"139","author":"Y. Lebbah","year":"2002","unstructured":"Lebbah, Y., & Lhomme, O. (2002). Accelerating filtering techniques for numeric csps. Artificial Intelligence, 139(1), 109\u2013132.","journal-title":"Artificial Intelligence"},{"key":"9027_CR18","unstructured":"Luksan, L., & Vlcek, J. (1998). Sparse and partially separable test problems for unconstrained and equality constrained optimization. Research Report V767-98, Institute of Computer Science, Academy of Science of the Czech Republic, (December)."},{"issue":"8","key":"9027_CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"1","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.\u00a0K. (1977). Consistency in networks of relations. Artificial Intelligence, 1(8), 99\u2013118.","journal-title":"Artificial Intelligence"},{"key":"9027_CR20","volume-title":"Interval Analysis","author":"R.E. Moore","year":"1966","unstructured":"Moore, R.\u00a0E. (1966). Interval Analysis. Prentice-Hall, Englewood Cliffs, N. J."},{"key":"9027_CR21","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/355815.355820","volume":"5","author":"J.J. Mor\u00e9","year":"1979","unstructured":"Mor\u00e9, J.\u00a0J., & Cosnard, M.\u00a0Y. (1979). Numerical solutions of nonlinear equations. ACM Transactions on Mathematical Software, 5, 64\u201385.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"9027_CR22","unstructured":"Neumaier, A. (1990). Interval methods for systems of equations, Encyclopedia of Mathematics and its Applications, vol.\u00a037. Cambridge University Press."},{"key":"9027_CR23","unstructured":"Ortega, J.\u00a0M., & Rheinboldt, W.\u00a0C. (1970). Iterative solutions of nonlinear equations in several variables. Academic Press Inc."},{"key":"9027_CR24","doi-asserted-by":"crossref","unstructured":"Ratschek, H., & Rokne, J. (1995). Interval methods. In Handbook of global optimization, pp. 751\u2013828. Kluwer Academic.","DOI":"10.1007\/978-1-4615-2025-2_14"},{"key":"9027_CR25","unstructured":"Sotiropoulos, D.\u00a0G., Nikas, J.\u00a0A., & Grapsa, T.\u00a0N. (2002). Improving the efficiency of a polynomial system solver via a reordering technique. In Proceedings 4th GRACM congress on computational mechanics, vol. III, pp. 970\u2013976."},{"key":"9027_CR26","doi-asserted-by":"crossref","unstructured":"Sutton, R., & Barto, A. (1998). Reinforcement learning: An introduction. MIT Press.","DOI":"10.1109\/TNN.1998.712192"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9027-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-007-9027-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9027-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:13Z","timestamp":1559243653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-007-9027-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,10]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["9027"],"URL":"https:\/\/doi.org\/10.1007\/s10601-007-9027-7","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,10]]}}}