{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T23:05:46Z","timestamp":1778886346659,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T00:00:00Z","timestamp":1489968000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10472-017-9544-z","type":"journal-article","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T01:44:38Z","timestamp":1489974278000},"page":"131-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4756-4765","authenticated-orcid":false,"given":"Federico","family":"Bergenti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefania","family":"Monica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,20]]},"reference":[{"key":"9544_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of constraint programming","author":"K Apt","year":"2003","unstructured":"Apt, K.: Principles of constraint programming. Cambridge University Press, Cambridge, UK (2003)"},{"key":"9544_CR2","unstructured":"Bergenti, F., Monica, S., Rossi, G.: Polynomial constraint solving over finite domains with the modified Bernstein form. In: Fiorentini, C., Momigliano, A. (eds.) Proceedings 31st Italian Conference on Computational Logic, CEUR Workshop Proceedings, vol. 1645, pp. 118-131. RWTH Aachen (2016)"},{"key":"9544_CR3","doi-asserted-by":"crossref","unstructured":"Bergenti, F., Monica, S., Rossi, G.: A subdivision approach to the solution of polynomial constraints over finite domains using the modified Bernstein form. In: Adorni, G., Cagnoni, S., Gori, M., Maratea, M. (eds.) AI*IA 2016 Advances in Artificial Intelligence, Lecture Notes in Computer Science, vol. 10037, pp. 179-191. Springer International Publishing (2016)","DOI":"10.1007\/978-3-319-49130-1_14"},{"issue":"1","key":"9544_CR4","first-page":"1","volume":"2:XIII","author":"SN Bernstein","year":"1912","unstructured":"Bernstein, S.N.: D\u00e9monstration du th\u00e9or\u00e8me de Weierstrass fond\u00e9e sur le calcul des probabilit\u00e9s. Communications de la Soci\u00e9t\u00e9 Math\u00e9matique de Kharkov 2:XIII(1), 1\u20132 (1912)","journal-title":"Communications de la Soci\u00e9t\u00e9 Math\u00e9matique de Kharkov"},{"issue":"1","key":"9544_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10817-010-9196-8","volume":"48","author":"C Borralleras","year":"2010","unstructured":"Borralleras, C., Lucas, S., Oliveras, A., Rodr\u00edguez-Carbonell, E., Rubio, A.: SAT modulo linear arithmetic for solving polynomial constraints. J. Autom. Reason. 48(1), 107\u2013131 (2010)","journal-title":"J. Autom. Reason."},{"key":"9544_CR6","volume-title":"Computer algebra 2nd edn.: Systems and algorithms for algebraic computation","author":"JH Davenport","year":"1993","unstructured":"Davenport, J.H., Siret, Y., Tournier, E.: Computer algebra 2nd edn.: Systems and algorithms for algebraic computation. Academic Press Professional, CA, USA (1993)"},{"issue":"6","key":"9544_CR7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.cagd.2012.03.001","volume":"29","author":"RT Farouki","year":"2012","unstructured":"Farouki, R.T.: The Bernstein polynomial basis: A centennial retrospective. Computer Aided Geometric Design 29(6), 379\u2013419 (2012)","journal-title":"Computer Aided Geometric Design"},{"issue":"1","key":"9544_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8396(88)90016-7","volume":"5","author":"RT Farouki","year":"1988","unstructured":"Farouki, R.T., Rajan, V.T.: Algorithms for polynomials in Bernstein form. Comput.-Aided Geom. Des. 5(1), 1\u201326 (1988)","journal-title":"Comput.-Aided Geom. Des."},{"key":"9544_CR9","doi-asserted-by":"crossref","unstructured":"Garloff, J.: Convergent bounds for the range of multivariate polynomials. In: Nickel, K. (ed.) Interval Mathematics 1985, Lecture Notes in Computer Science, vol. 212, pp. 37\u201356. Springer International Publishing (1986)","DOI":"10.1007\/3-540-16437-5_5"},{"key":"9544_CR10","first-page":"154","volume":"2","author":"J Garloff","year":"1993","unstructured":"Garloff, J.: The Bernstein algorithm. Interval Comput. 2, 154\u2013168 (1993)","journal-title":"Interval Comput."},{"key":"9544_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-7091-6280-4_9","volume-title":"Symbolic Algebraic Methods and Verification Methods","author":"J Garloff","year":"2001","unstructured":"Garloff, J., Smith, A.P.: Solution of systems of polynomial equations by using Bernstein expansion. In: Alefeld, G., Rohn, J., Rump, S., Yamamoto, T. (eds.) Symbolic Algebraic Methods and Verification Methods, pp. 87-97. Springer, Vienna (2001)"},{"key":"9544_CR12","volume-title":"Modern computer algebra","author":"J von zur Gathen","year":"2003","unstructured":"von zur Gathen, J., Gerhard, J.: Modern computer algebra, 2nd edn. Cambridge University Press, Cambridge, UK (2003)","edition":"2nd edn."},{"issue":"3","key":"9544_CR13","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10898-015-0358-4","volume":"65","author":"B Grimstad","year":"2016","unstructured":"Grimstad, B., Sandnes, A.: Global optimization with spline constraints: A new branch-and-bound method based on B-splines. J. Glob. Optim. 65(3), 401\u2013439 (2016)","journal-title":"J. Glob. Optim."},{"key":"9544_CR14","volume-title":"Bernstein polynomials","author":"GG Lorentz","year":"1953","unstructured":"Lorentz, G.G.: Bernstein polynomials. University of Toronto Press, Toronto, CA (1953)"},{"issue":"3","key":"9544_CR15","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.jsc.2008.04.016","volume":"44","author":"B Mourrain","year":"2009","unstructured":"Mourrain, B., Pavone, J.: Subdivision methods for solving polynomial equations. J. Symb. Comput. 44(3), 292\u2013306 (2009)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"9544_CR16","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/s11633-007-0342-7","volume":"4","author":"P Nataraj","year":"2007","unstructured":"Nataraj, P., Arounassalame, M.: A new subdivision algorithm for the Bernstein polynomial approach to global optimization. Int. J. Autom. Comput. 4(4), 342\u2013352 (2007)","journal-title":"Int. J. Autom. Comput."},{"issue":"2","key":"9544_CR17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s00607-011-0175-7","volume":"94","author":"BV Patil","year":"2012","unstructured":"Patil, B.V., Nataraj, P.S.V., Bhartiya, S.: Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach. Computing 94(2), 325\u2013343 (2012)","journal-title":"Computing"},{"key":"9544_CR18","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10898-008-9382-y","volume":"45","author":"S Ray","year":"2009","unstructured":"Ray, S., Nataraj, P.: An efficient algorithm for range computation of polynomials using the Bernstein form. J. Glob. Optim. 45, 403\u2013426 (2009)","journal-title":"J. Glob. Optim."},{"key":"9544_CR19","volume-title":"Handbook of constraint programming","author":"F Rossi","year":"2006","unstructured":"Rossi, F., Beek, P.V., Walsh, T.: Handbook of constraint programming. Elsevier, NY, USA (2006)"},{"key":"9544_CR20","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/S0010-4485(03)00021-6","volume":"35","author":"J S\u00e1nchez-Reyes","year":"2003","unstructured":"S\u00e1nchez-Reyes, J.: Algebraic manipulation in the Bernstein form made simple via convolutions. Comput.-Aided Des. 35, 959\u2013967 (2003)","journal-title":"Comput.-Aided Des."},{"key":"9544_CR21","volume-title":"The history of approximation theory: From euler to bernstein","author":"KG Steffens","year":"2006","unstructured":"Steffens, K.G.: The history of approximation theory: From euler to bernstein. Birkh\u00e4user, MA, USA (2006)"},{"key":"9544_CR22","first-page":"307","volume-title":"Functional and Logic Programming, Lecture Notes in Computer Science, vol. 7294","author":"M Triska","year":"2012","unstructured":"Triska, M.: The finite domain constraint solver of SWI-Prolog. In: Schrijvers, T., Thiemann, P. (eds.) Functional and Logic Programming, Lecture Notes in Computer Science, vol. 7294, pp. 307-316. Springer, Berlin Heidelberg (2012)"},{"issue":"1\u20132","key":"9544_CR23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1017\/S1471068411000494","volume":"12","author":"J Wielemaker","year":"2012","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-Prolog. Theory Pract. Log. Programm. 12(1\u20132), 67\u201396 (2012)","journal-title":"Theory Pract. Log. Programm."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-017-9544-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-017-9544-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-017-9544-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,18]],"date-time":"2017-05-18T14:15:45Z","timestamp":1495116945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-017-9544-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,20]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["9544"],"URL":"https:\/\/doi.org\/10.1007\/s10472-017-9544-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,20]]}}}