{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:17:17Z","timestamp":1725603437100},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_53","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T03:58:42Z","timestamp":1314763122000},"page":"706-720","source":"Crossref","is-referenced-by-count":5,"title":["Octagonal Domains for Continuous Constraints"],"prefix":"10.1007","author":[{"given":"Marie","family":"Pelleau","sequence":"first","affiliation":[]},{"given":"Charlotte","family":"Truchet","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Benhamou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: Exploiting monotonicity in interval constraint propagation. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010 (2010)","DOI":"10.1609\/aaai.v24i1.7541"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"Benhamou, F.: Heterogeneous constraint solvings. In: Proceedings of the 5th International Conference on Algebraic and Logic Programming, pp. 62\u201376 (1996)","DOI":"10.1007\/3-540-61735-3_4"},{"key":"53_CR3","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revisiting hull and box consistency. In: Proceedings of the 16th International Conference on Logic Programming, pp. 230\u2013244 (1999)"},{"key":"53_CR4","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.artint.2009.03.002","volume":"173","author":"G. Chabert","year":"2009","unstructured":"Chabert, G., Jaulin, L.: Contractor programming. Artificial Intelligence\u00a0173, 1079\u20131100 (2009)","journal-title":"Artificial Intelligence"},{"key":"53_CR5","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. In: Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning (1989)"},{"key":"53_CR6","doi-asserted-by":"crossref","unstructured":"Floyd, R.: Algorithm 97: Shortest path. Communications of the ACM\u00a05(6) (1962)","DOI":"10.1145\/367766.368168"},{"key":"53_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-85958-1_13","volume-title":"Principles and Practice of Constraint Programming","author":"A. Goldsztejn","year":"2008","unstructured":"Goldsztejn, A., Granvilliers, L.: A new framework for sharp and efficient resolution of ncsp with manifolds of solutions. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 190\u2013204. Springer, Heidelberg (2008)"},{"key":"53_CR8","unstructured":"Menasche, M., Berthomieu, B.: Time petri nets for analyzing and verifying time dependent communication protocols. In: Protocol Specification, Testing, and Verification (1983)"},{"issue":"1","key":"53_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10990-006-8609-1","volume":"19","author":"A. Min\u00e9","year":"2006","unstructured":"Min\u00e9, A.: The octagon abstract domain. Higher-Order and Symbolic Computation\u00a019(1), 31\u2013100 (2006)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"53_CR10","volume-title":"Interval Analysis","author":"R. Moore","year":"1966","unstructured":"Moore, R.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C., Rueher, M.: Inequality-sum: a global constraint capturing the objective function. RAIRO Operations Research (2005)","DOI":"10.1051\/ro:2005007"},{"issue":"1","key":"53_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1452044.1452046","volume":"31","author":"C. Schulte","year":"2008","unstructured":"Schulte, C., Stuckey, P.J.: Efficient constraint propagation engines. Transactions on Programming Languages and Systems\u00a031(1), 2:1\u20132:43 (2008)","journal-title":"Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T22:31:58Z","timestamp":1686263518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}