{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:53Z","timestamp":1725664973971},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617327"},{"type":"electronic","value":"9783540707400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61732-9_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:17:20Z","timestamp":1330294640000},"page":"144-159","source":"Crossref","is-referenced-by-count":9,"title":["Combining local consistency, symbolic rewriting and interval methods"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Benhamou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Granvilliers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"9_CR1","unstructured":"G. Alefeld and J. Herzberger. Introduction to Interval Computations. Academic Press, 1983."},{"key":"9_CR2","first-page":"133","volume-title":"Proceedings of ICLP'95","author":"P. Barth","year":"1995","unstructured":"P. Barth and A. Bockmayr. Finite domain and cutting plane techniques in CLP $$\\left( {\\mathcal{P}\\mathcal{B}} \\right)$$ . In L. Sterling, editor, Proceedings of ICLP'95, pages 133\u2013147, Kanagawa, Japan, 1995. MIT Press."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"F. Benhamou. Interval Constraint Logic Programming. In A. Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of LNCS, pages 1\u201321. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59155-9_1"},{"key":"9_CR4","unstructured":"F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) Revisited. In Proceedings of ILPS'94, pages 124\u2013138, Ithaca, NY, USA, 1994."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"F. Benhamou and W. J. Older. Applying Interval Arithmetic to Real, Integer and Boolean Constraints. Journal of Logic Programming, 1996. forthcoming.","DOI":"10.1016\/S0743-1066(96)00142-2"},{"key":"9_CR6","unstructured":"B. Buchberger. An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal. PhD thesis, University of Innsbruck, 1965. (in German)."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"B. Buchberger. Gr\u00f6bner Bases: an Algorithmic Method in Polynomial Ideal Theory. In Multidimensional Systems Theory, pages 184\u2013232. D. Reidel Publishing Company, 1985.","DOI":"10.1007\/978-94-009-5225-6_6"},{"issue":"2","key":"9_CR8","first-page":"125","volume":"2","author":"J. G. Cleary","year":"1987","unstructured":"J. G. Cleary. Logical Arithmetic. Future Computing Systems, 2(2):125\u2013149, 1987.","journal-title":"Future Computing Systems"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"D. Cox, J. Little, and D. O'Shea. Ideals, Varieties and Algorithms. Springer-Verlag, 1992.","DOI":"10.1007\/978-1-4757-2181-2"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"E. Davis. Constraint Propagation with Interval Labels. Artificial Intelligence, (32), 1987.","DOI":"10.1016\/0004-3702(87)90091-9"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0096-3003(83)90001-2","volume":"12","author":"E. R. Hansen","year":"1983","unstructured":"E. R. Hansen and R. I. Greenberg. An Interval Newton Method. Applied Mathematics and Computation, 12:89\u201398, 1983.","journal-title":"Applied Mathematics and Computation"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01933165","volume":"21","author":"E. R. Hansen","year":"1981","unstructured":"E. R. Hansen and S. Sengupta. Bounding Solutions of Systems of Equations using Interval Analysis. BIT, 21:203\u2013211, 1981.","journal-title":"BIT"},{"key":"9_CR13","volume-title":"Technical Report 94-08","author":"H. Hong","year":"1994","unstructured":"H. Hong. Confluency of Cooperative Constraint Solving. Technical Report 94-08, RISC-Linz, Johannes Kepler University, Linz, Austria, 1994."},{"issue":"3\u20134","key":"9_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF02307383","volume":"53","author":"H. Hong","year":"1994","unstructured":"H. Hong and V. Stahl. Safe Start Region by Fixed points and Tightening. Computing, 53(3\u20134):323\u2013335, 1994.","journal-title":"Computing"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0004-3702(92)90005-I","volume":"58","author":"E. Hyv\u00f6nen","year":"1992","unstructured":"E. Hyv\u00f6nen. Constraint Reasoning based on Interval Arithmetic. The Tolerance Propagation Approach. Artificial Intelligence, 58:71\u2013112, 1992.","journal-title":"Artificial Intelligence"},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02234767","volume":"4","author":"R. Krawczyk","year":"1969","unstructured":"R. Krawczyk. Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken. Computing, 4:187\u2013201, 1969.","journal-title":"Computing"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF02253190","volume":"37","author":"R. Krawczyk","year":"1986","unstructured":"R. Krawczyk. A Class of Interval Newton Operators. Computing, 37:179\u2013183, 1986.","journal-title":"Computing"},{"key":"9_CR18","first-page":"232","volume-title":"Proceedings of the 13th IJCAI","author":"O. Lhomme","year":"1993","unstructured":"O. Lhomme. Consistency techniques for numeric CSPs. In R. Bajcsy, editor, Proceedings of the 13th IJCAI, pages 232\u2013238, Chamb\u00e9ry, France, 1993. IEEE Computer Society Press."},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. Mackworth","year":"1977","unstructured":"A. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99\u2013118, 1977.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1142\/S0218213095000061","volume":"4","author":"P. Marti","year":"1995","unstructured":"P. Marti and M. Rueher. A Distributed Cooperating Constraint Solving System. International Journal on Artificial Intelligence Tools, 4(1):93\u2013113, 1995.","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"E. Monfroy. Gr\u00f6bner Bases: Strategies and Applications. In Proceedings of AISMC'92, volume 737 of LNCS, pages 133\u2013151. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-57322-4_9"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"E. Monfroy, M. Rusinowitch, and R. Schott. Implementing Non-Linear Constraints with Cooperative Solvers. In K. George, J. Carroll, D. Oppenheim, and J. Hightower, editors, Proceedings of ACM Symposium on Applied Computing, pages 63\u201372, February 1996.","DOI":"10.1145\/331119.331147"},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"U. Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Science, 7(2):95\u2013132, 1974.","journal-title":"Information Science"},{"key":"9_CR24","volume-title":"Interval Analysis","author":"R. E. Moore","year":"1966","unstructured":"R. E. Moore. Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1966."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"A. Neumaier. Interval Methods for Systems of Equations. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511526473"},{"key":"9_CR26","unstructured":"W. Older and A. Vellino. Constraint Arithmetic on Real Intervals. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Research. MIT Press, 1993."},{"key":"9_CR27","unstructured":"I. Shvetzov, A. Semenov, and V. Telerman. Constraint Programming based on Subdefinite Models and its Applications. In ILPS'95 post-conference workshop on Interval Constraints, Portland, Oregon, USA, 1995."},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"P. Van Hentenryck, D. McAllester, and D. Kapur. Solving Polynomial Systems Using a Branch and Prune Approach. SIAM Journal on Numerical Analysis. (To appear).","DOI":"10.1137\/S0036142995281504"},{"issue":"1\u20133","key":"9_CR29","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","volume":"58","author":"P. Hentenryck Van","year":"1992","unstructured":"P. Van Hentenryck, H. Simonis, and M. Dincbas. Constraint Satisfaction Using Constraint Logic Programming. Artificial Intelligence, 58(1\u20133): 113\u2013159, Dec. 1992.","journal-title":"Artificial Intelligence"},{"key":"9_CR30","unstructured":"D. L. Waltz. Generating Semantic Descriptions from Drawings of Scenes with Shadows. In P. H. Winston, editor, The Psychology of Computer Vision. McGraw Hill, 1975."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Mathematical Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61732-9_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:09:49Z","timestamp":1605647389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61732-9_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617327","9783540707400"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-61732-9_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}