{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:39:36Z","timestamp":1725680376615},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_8","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T07:59:40Z","timestamp":1336982380000},"page":"113-128","source":"Crossref","is-referenced-by-count":1,"title":["The Conjunction of Interval Among Constraints"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Chabert","sequence":"first","affiliation":[]},{"given":"Sophie","family":"Demassey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"12","key":"8_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing Global Constraints in CHIP. Journal of Mathematical and Computer Moddeling\u00a020(12), 97\u2013123 (1994)","journal-title":"Journal of Mathematical and Computer Moddeling"},{"key":"8_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/11754602_3","volume-title":"Recent Advances in Constraints","author":"C. Bessi\u00e8re","year":"2006","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Among, Common and Disjoint Constraints. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS (LNAI), vol.\u00a03978, pp. 29\u201343. Springer, Heidelberg (2006)"},{"key":"8_CR3","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: The Range and Roots Constraints: Specifying Counting and Occurrence Problems. In: IJCAI, pp. 60\u201365 (2005)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-74970-7_17","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S. Brand","year":"2007","unstructured":"Brand, S., Narodytska, N., Quimper, C.-G., Stuckey, P.J., Walsh, T.: Encodings of the Sequence Constraint. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 210\u2013224. Springer, Heidelberg (2007)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-04244-7_18","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"G. Chabert","year":"2009","unstructured":"Chabert, G., Jaulin, L., Lorca, X.: A Constraint on the Number of Distinct Vectors with Application to Localization. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 196\u2013210. Springer, Heidelberg (2009)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/11814948_19","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"S. Cotton","year":"2006","unstructured":"Cotton, S., Maler, O.: Fast and Flexible Difference Constraint Propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 170\u2013183. Springer, Heidelberg (2006)"},{"issue":"1-3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence\u00a049(1-3), 61\u201395 (1991)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10601-005-2237-y","volume":"10","author":"I. Katriel","year":"2005","unstructured":"Katriel, I., Thiel, S.: Complete Bound Consistency for the Global Cardinality Constraint. Constraints\u00a010(3), 191\u2013217 (2005)","journal-title":"Constraints"},{"key":"8_CR9","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Saunders College Publishing (1976)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-85958-1_11","volume-title":"Principles and Practice of Constraint Programming","author":"M.J. Maher","year":"2008","unstructured":"Maher, M.J., Narodytska, N., Quimper, C.-G., Walsh, T.: Flow-Based Propagators for the SEQUENCE and Related Global Constraints. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 159\u2013174. Springer, Heidelberg (2008)"},{"key":"8_CR11","unstructured":"R\u00e9gin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraint. In: 13th Conference on Artificial Intelligence, AAAI 1996, pp. 209\u2013215 (1996)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11493853_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J.-C. R\u00e9gin","year":"2005","unstructured":"R\u00e9gin, J.-C.: Combination of Among and Cardinality Constraints. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 288\u2013303. Springer, Heidelberg (2005)"},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1145\/322276.322288","volume":"28","author":"R. Shostak","year":"1981","unstructured":"Shostak, R.: Deciding linear inequalities by computing loop residues. Journal of the ACM\u00a028(4), 769\u2013779 (1981)","journal-title":"Journal of the ACM"},{"key":"8_CR14","unstructured":"CHOCO Team. choco: an open source java constraint programming library. Research report 10-02-INFO, Ecole des Mines de Nantes (2010)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10601-008-9067-7","volume":"14","author":"W.-J. Hoeve van","year":"2009","unstructured":"van Hoeve, W.-J., Pesant, G., Rousseau, L.-M., Sabharwal, A.: New filtering algorithms for combinations of among constraints. Constraints\u00a014, 273\u2013292 (2009)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:17:46Z","timestamp":1620127066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}