{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:20:30Z","timestamp":1648527630404},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,10,20]],"date-time":"2013-10-20T00:00:00Z","timestamp":1382227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10601-013-9152-4","type":"journal-article","created":{"date-parts":[[2013,10,19]],"date-time":"2013-10-19T06:47:58Z","timestamp":1382165278000},"page":"139-149","source":"Crossref","is-referenced-by-count":3,"title":["Toward sustainable development in constraint programming"],"prefix":"10.1007","volume":"19","author":[{"given":"Nicolas","family":"Beldiceanu","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Flener","sequence":"additional","affiliation":[]},{"given":"Jean-No\u00ebl","family":"Monette","sequence":"additional","affiliation":[]},{"given":"Justin","family":"Pearson","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Simonis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,20]]},"reference":[{"issue":"4","key":"9152_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1017\/S1471068405002371","volume":"5","author":"S Abdennadher","year":"2005","unstructured":"Abdennadher, S., & Rigotti, C. (2005). Automatic generation of CHR constraint solvers. Theory and Practice of Logic Programming, 5(4), 403\u2013418.","journal-title":"Theory and Practice of Logic Programming"},{"key":"9152_CR2","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T. (2004). Deriving filtering algorithms from constraint checkers. In M.G. Wallace (Ed.), CP 2004. LNCS (Vol. 3258, pp. 107\u2013122). Springer.","DOI":"10.1007\/978-3-540-30201-8_11"},{"key":"9152_CR3","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T., R\u00e9gin, J.C. (2012). An O(nlogn) bound consistency algorithm for the conjunction of an alldifferent and an inequality between a sum of variables and a constant, and its generalization. In L.D. Raedt, C. Bessi\u00e8re, D. Dubois, P. Doherty, P. Frasconi, F. Heintz, P.J.F. Lucas (Eds.), ECAI 2012 (pp. 145\u2013150). IOS Press."},{"key":"9152_CR4","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., Truchet, C. (2007). A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In C.\u00a0Bessi\u00e8re (Ed.), CP 2007. LNCS (Vol. 4741, pp. 180\u2013194). Springer.","DOI":"10.1007\/978-3-540-74970-7_15"},{"key":"9152_CR5","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.X. (2012). Global constraint catalog 2nd edn. (revision\u00a0a). Tech. Rep. T2012:03, Swedish Institute of Computer Science. Available at http:\/\/soda.swedish-ict.se\/5195 ."},{"issue":"4","key":"9152_CR6","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1051\/ro:2007001","volume":"40","author":"N Beldiceanu","year":"2006","unstructured":"Beldiceanu, N., Petit, T., Rochart, G. (2006). Bounds of parameters for global constraints. RAIRO Operations Research, 40(4), 327\u2013353.","journal-title":"RAIRO Operations Research"},{"key":"9152_CR7","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., & Simonis, H. (2011). A constraint seeker: Finding and ranking global constraints from examples. In J.H.M. Lee (Ed.), CP 2011. LNCS (Vol. 6876, pp. 12\u201326). Springer.","DOI":"10.1007\/978-3-642-23786-7_4"},{"key":"9152_CR8","unstructured":"Berger, M. (2010). Geometry revealed, a Jacob\u2019s ladder to modern higher geometry. Springer."},{"key":"9152_CR9","doi-asserted-by":"crossref","unstructured":"Carlsson, M., Beldiceanu, N., Martin, J. (2008). A geometric constraint over k-dimensional objects and shapes subject to business rules. In P.J. Stuckey (Ed.), CP 2008. LNCS (Vol. 5202, pp. 220\u2013234). Springer.","DOI":"10.1007\/978-3-540-85958-1_15"},{"key":"9152_CR10","unstructured":"Colmerauer, A. (1996). Les bases de Prolog IV. Internal publication of the Laboratoire d\u2019Informatique de Marseille, France. Available at http:\/\/alain.colmerauer.free.fr\/ ."},{"key":"9152_CR11","doi-asserted-by":"crossref","unstructured":"Dao, T.B.H., Lallouet, A., Legtchenko, A., Martin, L. (2002). Indexical-based solver learning. In P. Van Hentenryck (Ed.), CP 2002. LNCS (Vol. 2470, pp. 541\u2013555). Springer.","DOI":"10.1007\/3-540-46135-3_36"},{"key":"9152_CR12","unstructured":"Deransart, P., Hermenegildo, M.V., Maluszynski, J. (Eds.) (2000). Analysis and visualization tools for constraint programming, constraint debugging (DiSCiPl project). LNCS (Vol. 1870). Springer."},{"key":"9152_CR13","unstructured":"Diaz, D., & Codognet, P. (1993). A minimal extension of the WAM for clp(FD). In ICLP 1993 (pp. 774\u2013790). The MIT Press."},{"issue":"3","key":"9152_CR14","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/s10601-008-9063-y","volume":"14","author":"G Dooms","year":"2009","unstructured":"Dooms, G., Van\u00a0Hentenryck, P., Michel, L. (2009). Model-driven visualizations of constraint-based local search. Constraints, 14(3), 294\u2013324.","journal-title":"Constraints"},{"key":"9152_CR15","doi-asserted-by":"crossref","unstructured":"de\u00a0la Higuera, C. (2010). Grammatical inference: Learning automata and grammars. Cambridge University Press.","DOI":"10.1017\/CBO9781139194655"},{"key":"9152_CR16","unstructured":"Jussien, N. (2003). The versatility of using explanations within constraint programming. Habilitation thesis, Universit\u00e9 de Nantes, France. Available at http:\/\/tel.archives-ouvertes.fr\/tel-00293905 ."},{"issue":"1","key":"9152_CR17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"JL Lauri\u00e8re","year":"1978","unstructured":"Lauri\u00e8re, J.L. (1978). A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 10(1), 29\u2013127.","journal-title":"Artificial Intelligence"},{"key":"9152_CR18","doi-asserted-by":"crossref","unstructured":"Letort, A., Beldiceanu, N., Carlsson, M. (2012). A scalable sweep algorithm for the cumulative constraint. In M. Milano (Ed.), CP 2012. LNCS (Vol. 7514, pp. 439\u2013454). Springer.","DOI":"10.1007\/978-3-642-33558-7_33"},{"issue":"6","key":"9152_CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1287\/inte.31.6.29.9647","volume":"31","author":"IJ Lustig","year":"2001","unstructured":"Lustig, I.J., & Puget, J.F. (2001). Program does not equal program: constraint programming and its relationship to mathematical programming. Interfaces, 31(6), 29\u201353.","journal-title":"Interfaces"},{"key":"9152_CR20","doi-asserted-by":"crossref","unstructured":"Mehta, D., O\u2019Sullivan, B., Simonis, H. (2012). Comparing solution methods for the machine reassignment problem. In M.\u00a0Milano (Ed.), CP 2012. LNCS (Vol. 7514, pp. 782\u2013797).","DOI":"10.1007\/978-3-642-33558-7_56"},{"key":"9152_CR21","doi-asserted-by":"crossref","unstructured":"Monette, J.N., Beldiceanu, N., Flener, P., Pearson, J. (2013). A parametric propagator for discretely convex pairs of sum constraints. In C. Schulte (Ed.), CP 2013. LNCS (Vol. 8124, pp. 529\u2013544). Springer.","DOI":"10.1007\/978-3-642-40627-0_40"},{"key":"9152_CR22","doi-asserted-by":"crossref","unstructured":"Monette, J.N., Flener, P., Pearson, J. (2012). Towards solver-independent propagators. In M.\u00a0Milano (Ed.), CP 2012. LNCS (Vol. 7514, pp. 544\u2013560). Springer.","DOI":"10.1007\/978-3-642-33558-7_40"},{"key":"9152_CR23","unstructured":"Oncina, J., & Garcia, P. (1992). Identifying regular languages in polynomial time. In Advances in structural and syntactic pattern recognition (Vol. 5, pp. 99\u2013108)."},{"key":"9152_CR24","unstructured":"O\u2019Sullivan, B. (2011). CP panel position \u2013 The future of CP. Available at http:\/\/www.dmi.unipg.it\/cp2011\/downloads\/slides\/panel\/osullivan.pdf ."},{"key":"9152_CR25","doi-asserted-by":"crossref","unstructured":"Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In M.G. Wallace (Ed.), CP 2004. LNCS (Vol. 3258, pp. 482\u2013495). Springer.","DOI":"10.1007\/978-3-540-30201-8_36"},{"key":"9152_CR26","unstructured":"Petit, T., Beldiceanu, N., Lorca, X. (2011). A generalized arc-consistency algorithm for a class of counting constraints. In IJCAI 2011 (pp. 643\u2013648). AAAI Press \/ IJCAI. Revised edition available at http:\/\/arxiv.org\/abs\/1110.4719 ."},{"key":"9152_CR27","unstructured":"Prosser, P. (2012). Exact algorithms for maximum clique: a computational study. Tech. Rep. 2012-333, Department of Computer Science, Glasgow University, Scotland. Available at http:\/\/arxiv.org\/abs\/1207.4616 ."},{"key":"9152_CR28","doi-asserted-by":"crossref","unstructured":"Raiser, F. (2008). Semi-automatic generation of CHR solvers for global constraints. In P.J. Stuckey (Ed.), CP 2008. LNCS (Vol. 5202, pp. 588\u2013592). Springer.","DOI":"10.1007\/978-3-540-85958-1_47"},{"key":"9152_CR29","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M.J. Maher, J.F. Puget (Eds.), CP 1998. LNCS (Vol. 1520, pp. 417\u2013431). Springer.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"9152_CR30","doi-asserted-by":"crossref","unstructured":"Simonis, H., Aggoun, A., Beldiceanu, N., Bourreau, E. (2000). Complex constraint abstraction: Global constraint visualisation. In P. Deransart, M.V. Hermenegildo, J. Maluszynski, (Eds.), Analysis and visualization tools for constraint programming, constraint debugging (DiSCiPl project). LNCS (Vol. 1870, pp. 299\u2013317). Springer.","DOI":"10.1007\/10722311_13"},{"key":"9152_CR31","doi-asserted-by":"crossref","unstructured":"Simonis, H., Davern, P., Feldman, J., Mehta, D., Quesada, L., Carlsson, M. (2010). A generic visualization platform for CP. In J.H.M. Lee (Ed.), CP 2010. LNCS (Vol. 6308, pp. 460\u2013474). Springer.","DOI":"10.1007\/978-3-642-15396-9_37"},{"key":"9152_CR32","doi-asserted-by":"crossref","unstructured":"Tack, G., Schulte, C., Smolka, G. (2006). Generating propagators for finite set constraints. In F. Benhamou (Ed.), CP 2006. LNCS (Vol. 4204, pp. 575\u2013589). Springer.","DOI":"10.1007\/11889205_41"},{"key":"9152_CR33","unstructured":"Van\u00a0Hentenryck, P., & Michel, L. (2007). Constraint-based local search. The MIT Press."},{"key":"9152_CR34","unstructured":"Van\u00a0Hentenryck, P., Saraswat, V., Deville, Y. Design, implementation, and evaluation of the constraint language cc(FD). Tech. Rep. CS-93-02, Brown University, Providence, USA (1993). Based on the unpublished manuscript Constraint Processing in cc(FD), 1991."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9152-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-013-9152-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9152-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T00:56:06Z","timestamp":1564534566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-013-9152-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,20]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9152"],"URL":"https:\/\/doi.org\/10.1007\/s10601-013-9152-4","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,20]]}}}