{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:13:49Z","timestamp":1767237229393},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406263"},{"type":"electronic","value":"9783642406270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_34","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T03:11:01Z","timestamp":1378523461000},"page":"432-447","source":"Crossref","is-referenced-by-count":8,"title":["Globalizing Constraint Models"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Leo","sequence":"first","affiliation":[]},{"given":"Christopher","family":"Mears","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Tack","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Garcia de la Banda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Simonis, H.: A constraint seeker: Finding and ranking global constraints from examples. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 12\u201326. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-23786-7_4"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Simonis, H.: A model seeker: Extracting global constraint models from positive examples. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 141\u2013157. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-33558-7_13"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Coletta, R., Koriche, F., O\u2019Sullivan, B.: A SAT-based version space algorithm for acquiring constraint satisfaction problems. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol.\u00a03720, pp. 23\u201334. Springer, Heidelberg (2005)","DOI":"10.1007\/11564096_8"},{"key":"34_CR4","unstructured":"Bessiere, C., Coletta, R., Petit, T.: Learning implied global constraints. In: Veloso, M.M. (ed.) IJCAI, pp. 44\u201349 (2007)"},{"key":"34_CR5","unstructured":"Charnley, J., Colton, S., Miguel, I.: Automatic generation of implied constraints. In: European Conference on Artificial Intelligence, ECAI, vol.\u00a0141, pp. 73\u201377. IOS Press (2006)"},{"key":"34_CR6","unstructured":"Frisch, A., Miguel, I., Walsh, T.: Extensions to proof planning for generating implied constraints. In: Calculemus 2001 (2001)"},{"key":"34_CR7","unstructured":"Frisch, A.M., Jefferson, C., Mart\u00ednez-Hern\u00e1ndez, B., Miguel, I.: The rules of constraint modelling. In: International Joint Conference on Artificial Intelligence, vol.\u00a019, pp. 109\u2013116. Lawrence Erlbaum Associates LTD. (2005)"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Frisch, A.M., Miguel, I., Walsh, T.: CGRASS: A system for transforming constraint satisfaction problems. In: O\u2019Sullivan, B. (ed.) CologNet 2002. LNCS (LNAI), vol.\u00a02627, pp. 15\u201330. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36607-5_2"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Miguel, I., Rendl, A.: Tailoring solver-independent constraint models: A case study with essence\u2032 and minion. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol.\u00a04612, pp. 184\u2013199. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-73580-9_16"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Mears, C., Garcia de la Banda, M., Wallace, M., Demoen, B.: A novel approach for detecting symmetries in CSP models. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 158\u2013172. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-68155-7_14"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: Towards a standard CP modelling language. In: Bessiere, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 529\u2013543. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-74970-7_38"},{"issue":"1","key":"34_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF00143880","volume":"1","author":"B.M. Smith","year":"1996","unstructured":"Smith, B.M., Brailsford, S.C., Hubbard, P.M., Williams, H.P.: The progressive party problem: Integer linear programming and constraint programming compared. Constraints\u00a01(1), 119\u2013138 (1996)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40627-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T22:18:08Z","timestamp":1558045088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}