{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:08:25Z","timestamp":1767236905241},"publisher-location":"Berlin, Heidelberg","reference-count":27,"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_4","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"12-26","source":"Crossref","is-referenced-by-count":24,"title":["A Constraint Seeker: Finding and Ranking Global Constraints from Examples"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Beldiceanu","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Simonis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45349-0_6","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"N. Beldiceanu","year":"2000","unstructured":"Beldiceanu, N.: Global constraints as graph properties on a structured network of elementary constraints of the same type. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 52\u201366. Springer, Heidelberg (2000)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Debruyne, R., Petit, T.: Reformulation of global constraints based on constraint checkers. Constraints\u00a010(3) (2005)","DOI":"10.1007\/s10601-005-2809-x"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace (ed.) [25], pp. 107\u2013122","DOI":"10.1007\/978-3-540-30201-8_11"},{"key":"4_CR4","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.: Global constraint catalog, 2nd edn. Technical Report T2010:07, SICS (2010)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C., Coletta, R., Freuder, E.C., O\u2019Sullivan, B.: Leveraging the learning power of examples in automated constraint acquisition. In: Wallace (ed.) [25], pp. 123\u2013137","DOI":"10.1007\/978-3-540-30201-8_12"},{"key":"4_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/11564096_8","volume-title":"Machine Learning: ECML 2005","author":"C. Bessi\u00e8re","year":"2005","unstructured":"Bessi\u00e8re, 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)"},{"key":"4_CR7","volume-title":"AAAI","author":"C. Bessi\u00e8re","year":"2006","unstructured":"Bessi\u00e8re, C., Coletta, R., Koriche, F., O\u2019Sullivan, B.: Acquiring constraint networks using a SAT-based version space algorithm. In: AAAI. AAAI Press, Menlo Park (2006)"},{"key":"4_CR8","unstructured":"Bessi\u00e8re, C., Coletta, R., O\u2019Sullivan, B., Paulin, M.: Query-driven constraint acquisition. In: Veloso (ed.) [23], pp. 50\u201355"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/11564751_57","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C. Bessi\u00e8re","year":"2005","unstructured":"Bessi\u00e8re, C., Coletta, R., Petit, T.: Acquiring parameters of implied global constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 747\u2013751. Springer, Heidelberg (2005)"},{"key":"4_CR10","unstructured":"Bessi\u00e8re, C., Coletta, R., Petit, T.: Learning implied global constraints. In: Veloso (ed.) [23], pp. 44\u201349"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-540-85958-1_15","volume-title":"Principles and Practice of Constraint Programming","author":"M. Carlsson","year":"2008","unstructured":"Carlsson, M., Beldiceanu, N., Martin, J.: A geometric constraint over k-dimensional objects and shapes subject to business rules. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 220\u2013234. Springer, Heidelberg (2008)"},{"key":"4_CR12","unstructured":"Carlsson, M., et al.: SICStus Prolog User\u2019s Manual. Swedish Institute of Computer Science, release 4 edn. (2007) ISBN 91-630-3648-7"},{"key":"4_CR13","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"73","volume-title":"ECAI","author":"J. Charnley","year":"2006","unstructured":"Charnley, J., Colton, S., Miguel, I.: Automatic generation of implied constraints. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI. Frontiers in Artificial Intelligence and Applications, vol.\u00a0141, pp. 73\u201377. IOS Press, Amsterdam (2006)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/978-3-540-45193-8_58","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"R. Coletta","year":"2003","unstructured":"Coletta, R., Bessi\u00e8re, C., O\u2019Sullivan, B., Freuder, E.C., O\u2019Connell, S., Quinqueton, J.: Semi-automatic modeling by constraint acquisition. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 812\u2013816. Springer, Heidelberg (2003)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-04244-7_35","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"E. Hebrard","year":"2009","unstructured":"Hebrard, E., Marx, D., O\u2019Sullivan, B., Razgon, I.: Constraints of difference and equality: A complete taxonomic characterisation. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 424\u2013438. Springer, Heidelberg (2009)"},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/1066677.1066770","volume-title":"SAC","author":"S. O\u2019Connell","year":"2005","unstructured":"O\u2019Connell, S., O\u2019Sullivan, B., Freuder, E.C.: Timid acquisition of constraint satisfaction problems. In: Haddad, H., Liebrock, L.M., Omicini, A., Wainwright, R.L. (eds.) SAC, pp. 404\u2013408. ACM, New York (2005)"},{"key":"4_CR17","volume-title":"AAAI","author":"B. O\u2019Sullivan","year":"2010","unstructured":"O\u2019Sullivan, B.: Automated modelling and solving in constraint programming. In: AAAI. AAAI Press, Menlo Park (2010)"},{"key":"4_CR18","first-page":"229","volume-title":"SYNASC","author":"J. Quinqueton","year":"2007","unstructured":"Quinqueton, J., Raymond, G., Bessiere, C.: An agent for constraint acquisition and emergence. In: Negru, V., Jebelean, T., Petcu, D., Zaharie, D. (eds.) SYNASC, pp. 229\u2013234. IEEE Computer Society, Los Alamitos (2007)"},{"issue":"4","key":"4_CR19","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/B:CONS.0000049206.43218.5f","volume":"9","author":"F. Rossi","year":"2004","unstructured":"Rossi, F., Sperduti, A.: Acquiring both constraint and solution preferences in interactive constraint systems. Constraints\u00a09(4), 311\u2013332 (2004)","journal-title":"Constraints"},{"key":"4_CR20","first-page":"476","volume-title":"ICDM","author":"K.M. Shchekotykhin","year":"2009","unstructured":"Shchekotykhin, K.M., Friedrich, G.: Argumentation based constraint acquisition. In: Wang, W., Kargupta, H., Ranka, S., Yu, P.S., Wu, X. (eds.) ICDM, pp. 476\u2013482. IEEE Computer Society, Los Alamitos (2009)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-45406-3_6","volume-title":"Constraints in Computational Logics. Theory and Applications","author":"H. Simonis","year":"2001","unstructured":"Simonis, H.: Building industrial applications with constraint programming. In: Comon, H., March\u00e9, C., Treinen, R. (eds.) CCL 1999. LNCS, vol.\u00a02002, pp. 271\u2013309. Springer, Heidelberg (2001)"},{"key":"4_CR22","volume-title":"The Encyclopedia of Integer Sequences","author":"N.J.A. Sloane","year":"1995","unstructured":"Sloane, N.J.A., Plouffe, S.: The Encyclopedia of Integer Sequences. Academic Press, San Diego (1995)"},{"key":"4_CR23","unstructured":"Veloso, M.M. (ed.): Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI 2007, Hyderabad, India, January 6-12 (2007)"},{"key":"4_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-540-73580-9_40","volume-title":"Abstraction, Reformulation, and Approximation","author":"X. Vu","year":"2007","unstructured":"Vu, X., O\u2019Sullivan, B.: Generalized constraint acquisition. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol.\u00a04612, pp. 411\u2013412. Springer, Heidelberg (2007)"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","year":"2004","unstructured":"Wallace, M. (ed.): CP 2004. LNCS, vol.\u00a03258. Springer, Heidelberg (2004)"},{"key":"4_CR26","unstructured":"Weis, P., Leroy, X.: Le langage Caml. InterEditions (1993) (in French)"},{"issue":"3","key":"4_CR27","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/s10601-008-9065-9","volume":"14","author":"A. Zanarini","year":"2009","unstructured":"Zanarini, A., Pesant, G.: Solution counting algorithms for constraint-centered search heuristics. Constraints\u00a014(3), 392\u2013413 (2009)","journal-title":"Constraints"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T02:31:59Z","timestamp":1686277919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}