{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:15:34Z","timestamp":1725909334228},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319661575"},{"type":"electronic","value":"9783319661582"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-66158-2_33","type":"book-chapter","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T03:24:38Z","timestamp":1503372278000},"page":"512-528","source":"Crossref","is-referenced-by-count":3,"title":["Learning the Parameters of Global Constraints Using Branch-and-Bound"],"prefix":"10.1007","author":[{"given":"\u00c9milie","family":"Picard-Cantin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Bouchard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Sweeney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"key":"33_CR1","unstructured":"Arcangioli, R., Lazaar, N.: Multiple constraint acquisition. In: Proceedings of the 2015 International Conference on Constraints and Preferences for Configuration and Recommendation and Intelligent Techniques for Web Personalization, CPCR+ITWP 2015, vol. 1440, pp. 16\u201320. CEUR-WS.org (2015)"},{"issue":"1","key":"33_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10479-008-0492-1","volume":"180","author":"R Bart\u00e1k","year":"2010","unstructured":"Bart\u00e1k, R., \u010cepek, O., Surynek, P.: Discovering implied constraints in precedence graphs with alternatives. Ann. Oper. Res. 180(1), 233\u2013263 (2010)","journal-title":"Ann. Oper. Res."},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-23786-7_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"A Bartolini","year":"2011","unstructured":"Bartolini, A., Lombardi, M., Milano, M., Benini, L.: Neuron constraints to model complex real-world problems. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 115\u2013129. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-23786-7_11"},{"issue":"12","key":"33_CR4","doi-asserted-by":"crossref","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. Math. Comput. Model. 20(12), 97\u2013123 (1994)","journal-title":"Math. Comput. Model."},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-642-40627-0_54","volume-title":"Principles and Practice of Constraint Programming","author":"N Beldiceanu","year":"2013","unstructured":"Beldiceanu, N., Ifrim, G., Lenoir, A., Simonis, H.: Describing and generating solutions for the EDF unit commitment problem with the ModelSeeker. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 733\u2013748. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40627-0_54"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-23786-7_4","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"N Beldiceanu","year":"2011","unstructured":"Beldiceanu, N., Simonis, H.: A constraint seeker: finding and ranking global constraints from examples. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 12\u201326. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-23786-7_4"},{"key":"33_CR7","unstructured":"Beldiceanu, N., Simonis, H.: Using the global constraint seeker for learning structured constraint models: a first attempt. In: The 10th International Workshop on Constraint Modelling and Reformulation (ModRef 2011), Perugia, Italy, pp. 20\u201334 (2011)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-33558-7_13","volume-title":"Principles and Practice of Constraint Programming","author":"N Beldiceanu","year":"2012","unstructured":"Beldiceanu, N., Simonis, H.: A model seeker: extracting global constraint models from positive examples. In: Milano, M. (ed.) CP 2012. LNCS, pp. 141\u2013157. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33558-7_13"},{"issue":"1","key":"33_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10601-006-9010-8","volume":"12","author":"N Beldiceanu","year":"2007","unstructured":"Beldiceanu, N., Carlsson, M., Demassey, S., Petit, T.: Global constraint catalogue: past, present and future. Constraints 12(1), 21\u201362 (2007)","journal-title":"Constraints"},{"key":"33_CR10","unstructured":"Bessiere, C., Coletta, R., Daoudi, A., Lazaar, N., Mechqrane, Y., Bouyakhf, E.H.: Boosting constraint acquisition via generalization queries. In: ECAI, pp. 99\u2013104 (2014)"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Coletta, R., Freuder, E.C., O\u2019Sullivan, B.: Leveraging the learning power of examples in automated constraint acquisition. In: Principles and Practice of Constraint Programming-CP 2004, pp. 123\u2013137 (2004)","DOI":"10.1007\/978-3-540-30201-8_12"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Coletta, R., Petit, T.: Acquiring parameters of implied global constraints. In: Principles and Practice of Constraint Programming-CP 2005, pp. 747\u2013751 (2005)","DOI":"10.1007\/11564751_57"},{"key":"33_CR13","unstructured":"Bessiere, C., Coletta, R., Petit, T.: Learning implied global constraints. In: IJCAI, pp. 44\u201349 (2007)"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-50137-6_3","volume-title":"Data Mining and Constraint Programming","author":"C Bessiere","year":"2016","unstructured":"Bessiere, C., et al.: New approaches to constraint acquisition. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O\u2019Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS, vol. 10101, pp. 51\u201376. Springer, Cham (2016). doi: 10.1007\/978-3-319-50137-6_3"},{"key":"33_CR15","unstructured":"Bessiere, C., Koriche, F., Lazaar, N., O\u2019Sullivan, B.: Constraint acquisition. Artif. Intell. (2015, in press)"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-10428-7_15","volume-title":"Principles and Practice of Constraint Programming","author":"C Bessiere","year":"2014","unstructured":"Bessiere, C., Hebrard, E., Katsirelos, G., Kiziltan, Z., Picard-Cantin, \u00c9., Quimper, C.-G., Walsh, T.: The balance constraint family. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 174\u2013189. Springer, Cham (2014). doi: 10.1007\/978-3-319-10428-7_15"},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-18008-3_6","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"A Bonfietti","year":"2015","unstructured":"Bonfietti, A., Lombardi, M., Milano, M.: Embedding decision trees and random forests in constraint programming. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 74\u201390. Springer, Cham (2015). doi: 10.1007\/978-3-319-18008-3_6"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-25566-3_25","volume-title":"Learning and Intelligent Optimization","author":"P Campigotto","year":"2011","unstructured":"Campigotto, P., Passerini, A., Battiti, R.: Active learning of combinatorial features for interactive optimization. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 336\u2013350. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25566-3_25"},{"key":"33_CR19","first-page":"73","volume":"141","author":"J Charnley","year":"2006","unstructured":"Charnley, J., Colton, S., Miguel, I.: Automatic generation of implied constraints. ECAI 141, 73\u201377 (2006)","journal-title":"ECAI"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Daoudi, A., Lazaar, N., Mechqrane, Y., Bessiere, C., Bouyakhf, E.H.: Detecting types of variables for generalization in constraint acquisition. In: 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 413\u2013420. IEEE (2015)","DOI":"10.1109\/ICTAI.2015.69"},{"key":"33_CR21","unstructured":"Kiziltan, Z., Lippi, M., Torroni, P.: Constraint detection in natural language problem descriptions. In: Proceedings of the Twenty-fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, USA, 9\u201315 July 2016"},{"key":"33_CR22","unstructured":"Kolb, S.: Learning constraints and optimization criteria. In: Proceedings of the First Workshop on Declarative Learning Based Programming (2016)"},{"key":"33_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1007\/978-3-540-45193-8_107","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"J Little","year":"2003","unstructured":"Little, J., Gebruers, C., Bridge, D., Freuder, E.C.: Using case-based reasoning to write constraint programs. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, p. 983. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45193-8_107"},{"key":"33_CR24","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.artint.2016.01.005","volume":"244","author":"M Lombardi","year":"2017","unstructured":"Lombardi, M., Milano, M., Bartolini, A.: Empirical decision model learning. Artif. Intell. 244, 343\u2013367 (2017). Elsevier","journal-title":"Artif. Intell."},{"key":"33_CR25","unstructured":"Lopez, M., Lallouet, A.: On learning CSP specifications. In: The 15th International Conference on Principles and Practice of Constraint Programming Doctoral Program Proceedings, p. 70 (2009)"},{"key":"33_CR26","doi-asserted-by":"crossref","unstructured":"Pachet, F., Roy, P.: Automatic generation of music programs. In: International Conference on Principles and Practice of Constraint Programming, pp. 331\u2013345 (1999)","DOI":"10.1007\/978-3-540-48085-3_24"},{"key":"33_CR27","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1613\/jair.3463","volume":"43","author":"G Pesant","year":"2012","unstructured":"Pesant, G., Quimper, C.G., Zanarini, A.: Counting-based search: branching heuristics for constraint satisfaction problems. J. Artif. Intell. Res. 43, 173\u2013210 (2012)","journal-title":"J. Artif. Intell. Res."},{"key":"33_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-33558-7_42","volume-title":"Principles and Practice of Constraint Programming","author":"T Petit","year":"2012","unstructured":"Petit, T.: Focus: a constraint for concentrating high costs. In: Milano, M. (ed.) CP 2012. LNCS, pp. 577\u2013592. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33558-7_42"},{"key":"33_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-319-44953-1_26","volume-title":"Principles and Practice of Constraint Programming","author":"\u00c9 Picard-Cantin","year":"2016","unstructured":"Picard-Cantin, \u00c9., Bouchard, M., Quimper, C.-G., Sweeney, J.: Learning parameters for the sequence constraint from solutions. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 405\u2013420. Springer, Cham (2016). doi: 10.1007\/978-3-319-44953-1_26"},{"key":"33_CR30","unstructured":"R\u00e9gin, J.C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of the 13th National Conference on Artificial Intelligence, AAAI 1996, vol. 1, pp. 209\u2013215. AAAI Press (1996)"},{"key":"33_CR31","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.trc.2012.08.002","volume":"26","author":"P Suraweera","year":"2013","unstructured":"Suraweera, P., Webb, G.I., Evans, I., Wallace, M.: Learning crew scheduling constraints from historical schedules. Transp. Res. Part C: Emerg. Technol. 26, 214\u2013232 (2013)","journal-title":"Transp. Res. Part C: Emerg. Technol."}],"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-319-66158-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T13:13:43Z","timestamp":1570022023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66158-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319661575","9783319661582"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66158-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}