{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:38Z","timestamp":1750307798125,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,3,16]],"date-time":"2008-03-16T00:00:00Z","timestamp":1205625600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,3,16]]},"DOI":"10.1145\/1363686.1363724","type":"proceedings-article","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T13:04:11Z","timestamp":1209474251000},"page":"134-139","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An efficient algorithm for a sharp approximation of universally quantified inequalities"],"prefix":"10.1145","author":[{"given":"A.","family":"Goldsztejn","sequence":"first","affiliation":[{"name":"University of Nantes, France"}]},{"given":"C.","family":"Michel","sequence":"additional","affiliation":[{"name":"University of Nice, France"}]},{"given":"M.","family":"Rueher","sequence":"additional","affiliation":[{"name":"University of Nice, France"}]}],"member":"320","published-online":{"date-parts":[[2008,3,16]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/647487.726645"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1024922.1024927"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1016\/S0743-1066(96)00142-2"},{"key":"e_1_3_2_1_4_1","first-page":"124","volume-title":"SLP","author":"Benhamou F.","year":"1994","unstructured":"F. Benhamou , D. A. McAllester , and P. V. Hentenryck . CLP(Intervals) Revisited . In SLP , pages 124 -- 138 , 1994 . F. Benhamou, D. A. McAllester, and P. V. Hentenryck. CLP(Intervals) Revisited. In SLP, pages 124--138, 1994."},{"key":"e_1_3_2_1_5_1","first-page":"125","volume-title":"Future Computing Systems","author":"Cleary J. G.","year":"1987","unstructured":"J. G. Cleary . Logical arithmetic . Future Computing Systems , pages 125 -- 149 , 1987 . J. G. Cleary. Logical arithmetic. Future Computing Systems, pages 125--149, 1987."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of IJCAI","author":"Collavizza H.","year":"1999","unstructured":"H. Collavizza , F. Delobel , and M. Rueher . Extending Consistent Domains of Numeric CSP . In Proceedings of IJCAI 1999 . H. Collavizza, F. Delobel, and M. Rueher. Extending Consistent Domains of Numeric CSP. In Proceedings of IJCAI 1999."},{"key":"e_1_3_2_1_7_1","first-page":"1","volume":"1","author":"Collavizza H.","year":"1999","unstructured":"H. Collavizza , F. Delobel , and M. Rueher . Comparing Partial Consistencies. Reliab. Comp. , 1 : 1 -- 16 , 1999 . H. Collavizza, F. Delobel, and M. Rueher. Comparing Partial Consistencies. Reliab. Comp., 1:1--16, 1999.","journal-title":"Comparing Partial Consistencies. Reliab. Comp."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/37.872903"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1006\/jsco.1997.0120"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/CDC.1993.325757"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/103162.103163"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/1141277.1141665"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/11889205_16"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1109\/CDC.2002.1185116"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.5555\/238665.238697"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1006\/jsco.1997.0119"},{"issue":"1","key":"e_1_3_2_1_17_1","first-page":"95","article-title":"Introduction, Uses, and Resources. Euromath","volume":"2","author":"Kearfott R. B.","year":"1996","unstructured":"R. B. Kearfott . Interval Computations : Introduction, Uses, and Resources. Euromath , Bulletin 2 ( 1 ): 95 -- 112 , 1996 . R. B. Kearfott. Interval Computations: Introduction, Uses, and Resources. Euromath, Bulletin 2(1):95--112, 1996.","journal-title":"Bulletin"},{"key":"e_1_3_2_1_18_1","volume-title":"Computing, 53(3--4):277--287","author":"Knueppel O.","year":"1994","unstructured":"O. Knueppel . PROFIL\/ BIAS - A Fast Interval Library . Computing, 53(3--4):277--287 , 1994 . O. Knueppel. PROFIL\/BIAS - A Fast Interval Library. Computing, 53(3--4):277--287, 1994."},{"key":"e_1_3_2_1_19_1","first-page":"232","volume-title":"Proceedings of IJCAI","author":"Lhomme O.","year":"1993","unstructured":"O. Lhomme . Consistency Techniques for Numeric CSPs . In Proceedings of IJCAI 1993 , pages 232 -- 238 . O. Lhomme. Consistency Techniques for Numeric CSPs. In Proceedings of IJCAI 1993, pages 232--238."},{"key":"e_1_3_2_1_20_1","first-page":"99","volume-title":"Artificial Intelligence","author":"Mackworth A. K.","year":"1977","unstructured":"A. K. Mackworth . Consistency in networks of relations . Artificial Intelligence , pages 99 -- 118 , 1977 . A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, pages 99--118, 1977."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1016\/S0005-1098(97)00028-9"},{"key":"e_1_3_2_1_22_1","volume-title":"Interval Methods for Systems of Equations","author":"Neumaier A.","year":"1990","unstructured":"A. Neumaier . Interval Methods for Systems of Equations . Cambridge Univ. Press , Cambridge , 1990 . A. Neumaier. Interval Methods for Systems of Equations. Cambridge Univ. Press, Cambridge, 1990."},{"unstructured":"S. Ratschan. Applications of Quantified Constraint Solving over the Reals Bibliography. http:\/\/www.cs.cas.cz\/ratschan\/appqcs.html.  S. Ratschan. Applications of Quantified Constraint Solving over the Reals Bibliography. http:\/\/www.cs.cas.cz\/ratschan\/appqcs.html.","key":"e_1_3_2_1_23_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1023\/A:1014785518570"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/1183278.1183282"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.5555\/645848.668802"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1109\/9.661615"}],"event":{"sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"acronym":"SAC '08","name":"SAC '08: The 2008 ACM Symposium on Applied Computing","location":"Fortaleza, Ceara Brazil"},"container-title":["Proceedings of the 2008 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1363686.1363724","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1363686.1363724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:28Z","timestamp":1750254988000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1363686.1363724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,16]]},"references-count":27,"alternative-id":["10.1145\/1363686.1363724","10.1145\/1363686"],"URL":"https:\/\/doi.org\/10.1145\/1363686.1363724","relation":{},"subject":[],"published":{"date-parts":[[2008,3,16]]},"assertion":[{"value":"2008-03-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}