{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:57:50Z","timestamp":1760608670610},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2011,11,15]],"date-time":"2011-11-15T00:00:00Z","timestamp":1321315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s00607-011-0169-5","type":"journal-article","created":{"date-parts":[[2011,11,14]],"date-time":"2011-11-14T07:00:30Z","timestamp":1321254030000},"page":"297-311","source":"Crossref","is-referenced-by-count":10,"title":["Solving set-valued constraint satisfaction problems"],"prefix":"10.1007","volume":"94","author":[{"given":"Luc","family":"Jaulin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,15]]},"reference":[{"key":"169_CR1","doi-asserted-by":"crossref","unstructured":"Araya I, Neveu B, Trombettoni G (2008) Exploiting common subexpressions in numerical CSPs. In: Proc. CP, Constraint Programming, LNCS 5202, pp 342\u2013357","DOI":"10.1007\/978-3-540-85958-1_23"},{"key":"169_CR2","volume-title":"Set-valued analysis","author":"J Aubin","year":"1990","unstructured":"Aubin J, Frankowska H (1990) Set-valued analysis. Birkh\u00e4user, Boston"},{"key":"169_CR3","unstructured":"Benhamou F, Goualard F, Granvilliers L, Puget JF (1999) Revising hull and box consistency. In: Proceedings of the international conference on logic programming, Las Cruces, pp 230\u2013244"},{"key":"169_CR4","doi-asserted-by":"crossref","unstructured":"Bottino A, Jaulin L, Laurentini A (2003) Reconstructing 3D objects from silhouettes with unknown viewpoints: the case of planar orthographic views. In: 8th Iberoamerican congress on pattern recognition, Havana, pp 26\u201329","DOI":"10.1007\/978-3-540-24586-5_18"},{"key":"169_CR5","doi-asserted-by":"crossref","unstructured":"Ceberio M, Granvilliers L (2001) Solving nonlinear systems by constraint inversion and interval arithmetic. In: Artificial Intelligence and Symbolic Computation, vol 1930, pp 127\u2013141, LNCS 5202","DOI":"10.1007\/3-540-44990-6_10"},{"key":"169_CR6","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1016\/j.artint.2009.03.002","volume":"173","author":"G Chabert","year":"2009","unstructured":"Chabert G, Jaulin L (2009) Contractor programming. Artif Intell 173: 1079\u20131100","journal-title":"Artif Intell"},{"key":"169_CR7","first-page":"926","volume":"41","author":"D Daney","year":"2006","unstructured":"Daney D, Andreff N, Chabert G, Papegay Y (2006) Interval method for calibration of parallel robots : vision-based experiments. Mech Mach Theory Elsevier 41: 926\u2013944","journal-title":"Mech Mach Theory Elsevier"},{"key":"169_CR8","doi-asserted-by":"crossref","unstructured":"Delanoue N, Jaulin L, Cottenceau B (2006) Using interval arithmetic to prove that a set is path-connected. Theor Comput Sci Spec Issue Real Numb Comput 351(1): 119\u2013128","DOI":"10.1016\/j.tcs.2005.09.055"},{"key":"169_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00137870","volume":"1","author":"C Gervet","year":"1997","unstructured":"Gervet C (1997) Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints 1: 191\u2013246","journal-title":"Constraints"},{"key":"169_CR10","doi-asserted-by":"crossref","unstructured":"Goldsztejn A, Jaulin L (2006) Inner and outer approximations of existentially quantified equality constraints. In: Proceedings of the twelfth international conference on principles and practice of constraint programming (CP 2006), Nantes (France)","DOI":"10.1007\/11889205_16"},{"issue":"5","key":"169_CR11","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1109\/TRO.2011.2147110","volume":"27","author":"L Jaulin","year":"2011","unstructured":"Jaulin L (2011) Range-only SLAM with occupancy maps; A set-membership approach. IEEE Trans Robot 27(5): 1004\u20131010","journal-title":"IEEE Trans Robot"},{"issue":"2","key":"169_CR12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/10556781003636851","volume":"26","author":"R Kearfott","year":"2011","unstructured":"Kearfott R (2011) Interval computations, rigor and non-rigor in deterministic continuous global optimization. Optim Methods Softw 26(2): 259\u2013279","journal-title":"Optim Methods Softw"},{"key":"169_CR13","unstructured":"Kieffer M, Jaulin L, Braems I, Walter E (2001) Scientific computing, validated numerics, interval methods. In: Proceedings of SCAN 2000, chapter guaranteed set computation with subpavings. Kluwer Academic Publishers, pp 167\u2013178"},{"issue":"4","key":"169_CR14","first-page":"405","volume":"4","author":"V Kreinovich","year":"1997","unstructured":"Kreinovich V, Lakeyev A, Rohn J, Kahl P (1997) Computational complexity and feasibility of data processing and interval computations. Reliab Comput 4(4): 405\u2013409","journal-title":"Reliab Comput"},{"issue":"5","key":"169_CR15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s11155-007-9042-9","volume":"13","author":"S Lagrange","year":"2007","unstructured":"Lagrange S, Delanoue N, Jaulin L (2007) On sufficient conditions of injectivity, development of a numerical test via interval analysis. Reliab Comput 13(5): 409\u2013421","journal-title":"Reliab Comput"},{"key":"169_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3652-9","volume-title":"Directed sonar sensing for mobile robot navigation","author":"JJ Leonard","year":"1992","unstructured":"Leonard JJ, Durrant-Whyte HF (1992) Directed sonar sensing for mobile robot navigation. Kluwer, Boston"},{"key":"169_CR17","doi-asserted-by":"crossref","unstructured":"Moore RE (1979) Methods and applications of interval analysis. SIAM, Philadelphia","DOI":"10.1137\/1.9781611970906"},{"key":"169_CR18","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1017\/CBO9780511569975.004","volume":"13","author":"A Neumaier","year":"2004","unstructured":"Neumaier A (2004) Complete search in continuous global optimization and constraint satisfaction. Acta Numer 13: 271\u2013369","journal-title":"Acta Numer"},{"key":"169_CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.jlap.2004.07.008","volume":"64","author":"N Revol","year":"2005","unstructured":"Revol N, Makino K, Berz M (2005) Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY. J Logic Algebr Program 64: 135\u2013154","journal-title":"J Logic Algebr Program"},{"key":"169_CR20","volume-title":"Probabilistic robotics","author":"S Thrun","year":"2005","unstructured":"Thrun S, Bugard W, Fox D (2005) Probabilistic robotics. MIT Press, Cambridge"},{"issue":"12","key":"169_CR21","first-page":"1197","volume":"328","author":"W Tucker","year":"1999","unstructured":"Tucker W (1999) The Lorenz attractor exists. Comptes Rendus de l\u2019acadTmie des Sciences 328(12): 1197\u20131202","journal-title":"Comptes Rendus de l\u2019acadTmie des Sciences"},{"issue":"4","key":"169_CR22","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1009821007410","volume":"4","author":"M Emden van","year":"1999","unstructured":"van Emden M (1999) Algorithmic power from declarative use of redundant constraints. Constraints 4(4): 363\u2013381","journal-title":"Constraints"},{"key":"169_CR23","unstructured":"Yao J, Yao Y, Kreinovich V, da Silva PP, Starks S, Xiang G, Nguyen HT (2008) Towards more adequate representation of uncertainty: from intervals to set intervals, with the possible addition of probabilities and certainty degrees. In: Proceedings of the IEEE world congress on computational intelligence WCCI\u20192008, Hong Kong, pp 983\u2013990"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-011-0169-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-011-0169-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-011-0169-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T13:53:13Z","timestamp":1560952393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-011-0169-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,15]]},"references-count":23,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["169"],"URL":"https:\/\/doi.org\/10.1007\/s00607-011-0169-5","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,15]]}}}