{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T23:35:44Z","timestamp":1783812944133,"version":"3.55.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031959752","type":"print"},{"value":"9783031959769","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-95976-9_10","type":"book-chapter","created":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T03:53:59Z","timestamp":1751082839000},"page":"155-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Acquiring and\u00a0Selecting Implied Constraints with\u00a0an\u00a0Application to\u00a0the\u00a0BinSeq and\u00a0Partition Global Constraints"],"prefix":"10.1007","author":[{"given":"Jovial Cheukam","family":"Ngouonou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramiz","family":"Gindullin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Beldiceanu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R\u00e9mi","family":"Douence","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"10_CR1","unstructured":"CSPLib: A problem library for constraints. https:\/\/www.csplib.org\/. Accessed 06 Dec 2024"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/IJOC.2018.0857","volume":"32","author":"T Achterberg","year":"2020","unstructured":"Achterberg, T., Bixby, R.E., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. INFORMS J. Comput. 32(2), 473\u2013506 (2020). https:\/\/doi.org\/10.1287\/IJOC.2018.0857","journal-title":"INFORMS J. Comput."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.endm.2005.06.090","volume":"22","author":"M Aouchiche","year":"2005","unstructured":"Aouchiche, M., Caporossi, G., Hansen, P., Laffay, M.: Autographix: a survey. Electron. Notes Discret. Math. 22, 515\u2013520 (2005). https:\/\/doi.org\/10.1016\/j.endm.2005.06.090","journal-title":"Electron. Notes Discret. Math."},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10601-017-9276-z","volume":"23","author":"E Arafailova","year":"2018","unstructured":"Arafailova, E., Beldiceanu, N., Simonis, H.: Deriving generic bounds for time-series constraints based on regular expressions characteristics. Constraints Int. J. 23(1), 44\u201386 (2018). https:\/\/doi.org\/10.1007\/s10601-017-9276-z","journal-title":"Constraints Int. J."},{"key":"10_CR5","unstructured":"Baptiste, P., Pape, C.L., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer (2012)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-30201-8_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"N Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 107\u2013122. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_11"},{"key":"10_CR7","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global constraint catalog, (revision a) (2012)"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Beldiceanu, N., Cheukam-Ngouonou, J., Douence, R., Gindullin, R., Quimper, C.: Acquiring maps of interrelated conjectures on sharp bounds. In: Solnon, C. (ed.) 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel. LIPIcs, vol.\u00a0235, pp. 6:1\u20136:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CP.2022.6","DOI":"10.4230\/LIPIcs.CP.2022.6"},{"issue":"12","key":"10_CR9","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, \u00c9.: Introducing global constraints in chip. Math. Comput. Model. 20(12), 97\u2013123 (1994). https:\/\/doi.org\/10.1016\/0895-7177(94)90127-9","journal-title":"Math. Comput. Model."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/11493853_8","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C Bessiere","year":"2005","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Filtering algorithms for the NValue constraint. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 79\u201393. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11493853_8"},{"key":"10_CR11","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., et al.: The balance constraint family. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 174\u2013189. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_15"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Biere, A., J\u00e4rvisalo, M., Kiesl, B.: Preprocessing in SAT solving. In: Handbook of Satisfiability, pp. 391\u2013435. IOS Press (2021)","DOI":"10.3233\/FAIA200992"},{"key":"10_CR13","unstructured":"Carlsson, M., Mildner, P.: Sicstus prolog \u2013 the first 25 years. CoRR abs\/1011.5640 (2010). http:\/\/arxiv.org\/abs\/1011.5640"},{"key":"10_CR14","unstructured":"Charnley, J.W., Colton, S., Miguel, I.: Automatic generation of implied constraints. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI 2006, 17th European Conference on Artificial Intelligence, August 29 - September 1, 2006, Riva del Garda, Italy, Including Prestigious Applications of Intelligent Systems (PAIS 2006), Proceedings. Frontiers in Artificial Intelligence and Applications, vol.\u00a0141, pp. 73\u201377. IOS Press (2006). http:\/\/www.booksonline.iospress.nl\/Content\/View.aspx?piid=1649"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Demassey, S., Pesant, G., Rousseau, L.M.: A cost-regular based hybrid column generation approach. Constraints 11(4), 315\u2013333 (2006). https:\/\/doi.org\/10.1007\/s10601-006-9003-7. https:\/\/publications.polymtl.ca\/23185\/, aRRAY(0x55680943b278)","DOI":"10.1007\/s10601-006-9003-7"},{"issue":"1\u20133","key":"10_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0012-365X(88)90199-9","volume":"72","author":"S Fajtlowicz","year":"1988","unstructured":"Fajtlowicz, S.: On conjectures of Graffiti. Discret. Math. 72(1\u20133), 113\u2013118 (1988). https:\/\/doi.org\/10.1016\/0012-365X(88)90199-9","journal-title":"Discret. Math."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.ARTINT.2014.03.001","volume":"211","author":"IP Gent","year":"2014","unstructured":"Gent, I.P., Jefferson, C., Linton, S., Miguel, I., Nightingale, P.: Generating custom propagators for arbitrary constraints. Artif. Intell. 211, 1\u201333 (2014). https:\/\/doi.org\/10.1016\/J.ARTINT.2014.03.001","journal-title":"Artif. Intell."},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-15396-9_19","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"IP Gent","year":"2010","unstructured":"Gent, I.P., Jefferson, C., Miguel, I., Nightingale, P.: Generating special-purpose stateless propagators for arbitrary constraints. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 206\u2013220. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15396-9_19"},{"key":"10_CR19","unstructured":"Chu, G., Stuckey, P.J., Schutt, A., Ehlers, T., Gange, G., Francis, K.: Chuffed 0.12.1, a lazy clause generation solver (2023). https:\/\/github.com\/chuffed\/chuffed"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Gindullin, R., Beldiceanu, N., Ngouonou, J.C., Douence, R., Quimper, C.G.: Boolean-arithmetic equations: acquisition and uses. In: Proceedings of the 20th International Conference on the Integration of Constraint Programming (CPAIOR) (2023)","DOI":"10.1007\/978-3-031-33271-5_25"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/S1571-0653(05)80151-9","volume":"5","author":"P Hansen","year":"2000","unstructured":"Hansen, P., Caporossi, G.: Autographix: an automated system for finding conjectures in graph theory. Electron. Notes Discret. Math. 5, 158\u2013161 (2000). https:\/\/doi.org\/10.1016\/S1571-0653(05)80151-9","journal-title":"Electron. Notes Discret. Math."},{"key":"10_CR22","unstructured":"Hnich, B., Kiziltan, Z., Walsh, T.: CSPLib problem 030: balanced academic curriculum problem (BACP) (1999). http:\/\/www.csplib.org\/Problems\/prob030"},{"key":"10_CR23","unstructured":"Lauri\u00e8re, J.: Constraint propagation or automatic programming. Technical report.\u00a019, IBP-Laforia (1996). https:\/\/www.lri.fr\/~sebag\/Slides\/Lauriere\/Rabbit.pdf"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-48085-3_24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F Pachet","year":"1999","unstructured":"Pachet, F., Roy, P.: Automatic generation of music programs. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 331\u2013345. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48085-3_24"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-45578-7_13","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 2001","author":"G Pesant","year":"2001","unstructured":"Pesant, G.: A filtering algorithm for the stretch constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 183\u2013195. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45578-7_13"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Pesant, G., R\u00e9gin, J.C.: Spread: a balancing constraint based on statistics. In: Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP\u00a02005), pp. 460\u2013474 (2005)","DOI":"10.1007\/11564751_35"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Schaus, P., Deville, Y., Dupont, P.: Bound-consistent deviation constraint. In: Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP\u00a02007), pp. 620\u2013634 (2007)","DOI":"10.1007\/978-3-540-74970-7_44"},{"key":"10_CR28","unstructured":"Rendl, A., Miguel, I., Gent, I.P., Gregory, P.: Common subexpressions in constraint models of planning problems. In: Bulitko, V., Beck, J.C. (eds.) Eighth Symposium on Abstraction, Reformulation, and Approximation, SARA 2009, Lake Arrowhead, California, USA, 8\u201310 August 2009. AAAI (2009). http:\/\/www.aaai.org\/ocs\/index.php\/SARA\/SARA09\/paper\/view\/823"},{"key":"10_CR29","unstructured":"R\u00e9gin, J.C.: Mod\u00e9lisation et Contraintes Globales en Programmation par Contraintes. HDR dissertation, Universit\u00e9 de Nice (2004)"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-72397-4_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P Schaus","year":"2007","unstructured":"Schaus, P., Deville, Y., Dupont, P., R\u00e9gin, J.-C.: The deviation constraint. In: Van Hentenryck, P., Wolsey, L. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 260\u2013274. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72397-4_19"},{"key":"10_CR31","unstructured":"Schaus, P., Deville, Y., Dupout, P., R\u00e9gin, J.C.: Simplification and extension of the spread constraint. In: Proceedings of the Third International Workshop on Constraint Propagation and Implementation, pp. 77\u201391 (2006)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95976-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T06:00:59Z","timestamp":1777528859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95976-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031959752","9783031959769"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95976-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}