{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T09:31:02Z","timestamp":1769851862229,"version":"3.49.0"},"reference-count":86,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,10,7]],"date-time":"2017-10-07T00:00:00Z","timestamp":1507334400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"publisher","award":["SFI\/12\/RC\/2289"],"award-info":[{"award-number":["SFI\/12\/RC\/2289"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10601-017-9275-0","type":"journal-article","created":{"date-parts":[[2017,10,7]],"date-time":"2017-10-07T06:08:50Z","timestamp":1507356530000},"page":"158-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Progress towards the Holy Grail"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1467-5012","authenticated-orcid":false,"given":"Eugene C.","family":"Freuder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"9275_CR1","unstructured":"Akg\u00fcn, \u00d6. (2014). Extensible automated constraint modelling via refinement of abstract problem specifications (Doctoral dissertation, University of St Andrews). St Andrews Research Repository. https:\/\/research-repository.st-andrews.ac.uk\/handle\/10023\/6547 ."},{"key":"9275_CR2","doi-asserted-by":"crossref","unstructured":"Amadini, R., Gabbrielli, M., & Mauro, J. (2014). An enhanced features extractor for a portfolio of constraint solvers. In Proceedings of the 29th annual ACM symposium on applied computing (pp. 1357\u20131359). ACM.","DOI":"10.1145\/2554850.2555114"},{"issue":"7","key":"9275_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.9781\/ijimai.2016.3712","volume":"3","author":"R Amadini","year":"2016","unstructured":"Amadini, R., Gabbrielli, M., & Mauro, J. (2016). An extensive evaluation of portfolio approaches for constraint satisfaction problems. International Journal of Interactive Multimedia and Artificial Intelligence, 3(7), 81\u201386.","journal-title":"International Journal of Interactive Multimedia and Artificial Intelligence"},{"issue":"1\u20132","key":"9275_CR4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(01)00162-X","volume":"135","author":"J Amilhastre","year":"2002","unstructured":"Amilhastre, J., Fargier, H., & Marquis, P. (2002). Consistency restoration and explanations in dynamic CSPs\u2014application to configuration. Artificial Intelligence, 135(1\u20132), 199\u2013234.","journal-title":"Artificial Intelligence"},{"key":"9275_CR5","doi-asserted-by":"crossref","unstructured":"Arbelaez, A., Hamadi, Y., & Sebag, M. (2011). Continuous search in constraint programming. In Autonomous search (pp. 219\u2013243). Berlin: Springer.","DOI":"10.1007\/978-3-642-21434-9_9"},{"key":"9275_CR6","unstructured":"Balafrej, A., Bessiere, C., Paparrizou, A., & 2015. Multi-armed bandits for adaptive constraint propagation. In Proceedings of the twenty-fourth international joint conference on artificial intelligence (pp. 290\u2013296)."},{"key":"9275_CR7","doi-asserted-by":"crossref","unstructured":"Beacham, A., Chen, X., Sillito, J., & Van Beek, P. (2001). Constraint programming lessons learned from crossword puzzles. In Conference of the Canadian Society for computational studies of intelligence (pp. 78\u201387). Berlin: Springer.","DOI":"10.1007\/3-540-45153-6_8"},{"key":"9275_CR8","unstructured":"Beck, J.C., Prosser, P., & Selensky, E. (2003). Vehicle routing and job shop scheduling: what\u2019s the difference? In ICAPS (pp. 267\u2013276)."},{"issue":"1","key":"9275_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. (2007). Global constraint catalogue: past, present and future. Constraints, 12(1), 21\u201362.","journal-title":"Constraints"},{"key":"9275_CR10","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., & Simonis, H. (2012). A model seeker: extracting global constraint models from positive examples. In Principles and practice of constraint programming (pp. 141\u2013157). Berlin: Springer LNCS.","DOI":"10.1007\/978-3-642-33558-7_13"},{"key":"9275_CR11","unstructured":"Bessiere, C., Coletta, R., O\u2019Sullivan, B., & Paulin, M. (2007). Query-driven constraint acquisition. In Proceedings of the twentieth international joint conference on artificial intelligence (pp. 50\u201355)."},{"key":"9275_CR12","unstructured":"Bessiere, C., Coletta, R., & Petit, T. (2007). Learning implied global constraints. In Proceedings of the twentieth international joint conference on artificial intelligence (pp. 44-49)."},{"key":"9275_CR13","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Daoudi, A., Hebrard, E., Katsirelos, G., Lazaar, N., Mechqrane, Y., Narodytska, N., Quimper, C.-G., & Walsh, T. (2016). New approaches to constraint acquisition. In Data mining and constraint programming (pp. 51\u201376). Springer LNAI 10101.","DOI":"10.1007\/978-3-319-50137-6_3"},{"key":"9275_CR14","doi-asserted-by":"crossref","unstructured":"Bessiere, C., De Raedt, L., Guns, T., Kotthoff, L., Nanni, M., Nijssen, S., O\u2019Sullivan, B., Paparrizou, A., Pedreschi, D., & Simonis, H. (2016). The inductive constraint programming loop. In Data mining and constraint programming (pp. 303\u2013309). Springer LNAI 10101.","DOI":"10.1007\/978-3-319-50137-6_12"},{"key":"9275_CR15","doi-asserted-by":"crossref","unstructured":"Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O\u2019Sullivan, B., & Pedreschi, D. (Eds.) (2016). Data mining and constraint programming. Berlin: Springer.","DOI":"10.1007\/978-3-319-50137-6"},{"key":"9275_CR16","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.artint.2015.08.001","volume":"244","author":"C Bessiere","year":"2017","unstructured":"Bessiere, C., Koriche, F., Lazaar, N., & O\u2019Sullivan, B. (2017). Constraint acquisition. Artificial Intelligence, 244, 315\u2013342.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"9275_CR17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10601-015-9184-z","volume":"20","author":"G Bj\u00f6rdal","year":"2015","unstructured":"Bj\u00f6rdal, G., Monette, J.N., Flener, P., & Pearson, J. (2015). A constraint-based local search backend for MiniZinc. Constraints, 20(3), 325\u2013345.","journal-title":"Constraints"},{"issue":"4","key":"9275_CR18","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1011432307724","volume":"6","author":"J Borrett","year":"2001","unstructured":"Borrett, J., & Tsang, E. (2001). Constraints, 6(4), 299\u2013327.","journal-title":"Constraints"},{"issue":"4","key":"9275_CR19","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1111\/j.1467-8640.2005.00278.x","volume":"21","author":"T Carchrae","year":"2005","unstructured":"Carchrae, T., & Beck, J.C. (2005). Applying machine learning to low-knowledge control of optimization algorithms. Computational Intelligence, 21(4), 372\u2013387.","journal-title":"Computational Intelligence"},{"key":"9275_CR20","unstructured":"Charnley, J., Colton, S., & Miguel, I. (2006). Automatic generation of implied constraints. In Proceedings of the 17th European conference on artificial intelligence (pp. 73\u201377)."},{"key":"9275_CR21","unstructured":"Colton, S., & Miguel, I. (2239). Constraint generation via automated theory formation. In Principles and practice of constraint programming\u2014CP 2001 (pp. 575\u2013579). Berlin: Springer LNCS."},{"key":"9275_CR22","doi-asserted-by":"crossref","unstructured":"Chu, G., & Stuckey, P. (2015). Learning value heuristics for constraint programming. In Integration of AI and OR techniques in constraint programming (pp. 108\u2013123). Springer LNCS 9075.","DOI":"10.1007\/978-3-319-18008-3_8"},{"key":"9275_CR23","doi-asserted-by":"crossref","unstructured":"Dasygenis, M., & Stergiou, K. (2014). Building portfolios for parallel constraint solving by varying the local consistency applied. In 2014 IEEE 26th international conference on tools with artificial intelligence (ICTAI) (pp. 717\u2013724). IEEE.","DOI":"10.1109\/ICTAI.2014.112"},{"key":"9275_CR24","unstructured":"De Raedt, L., Nijssen, S., O\u2019Sullivan, B., & Hentenryck, P.V. (Eds.) (2011). Constraint programming meets machine learning and data mining. Dagstuhl Reports, 1(5), 61\u201383."},{"key":"9275_CR25","doi-asserted-by":"crossref","unstructured":"Deransart, P., Hermenegildo, M., & Maluszynski, J. (Eds.) (2000). Analysis and visualization tools for constraint programming constraint debugging. Springer LNCS 1870.","DOI":"10.1007\/10722311"},{"key":"9275_CR26","doi-asserted-by":"crossref","unstructured":"Deransart, P. (2004). Main results of the OADymPPaC project. In Logic programming, 20th international conference (pp. 456\u2013457). Berlin: Springer LNCS 3132.","DOI":"10.1007\/978-3-540-27775-0_36"},{"key":"9275_CR27","doi-asserted-by":"crossref","unstructured":"Elsayed, S., & Michel, L. (2011). Synthesis of search algorithms from high-level CP models. In Principles and practice of constraint programming (pp. 256\u2013270). Springer LNCS 6876.","DOI":"10.1007\/978-3-642-23786-7_21"},{"issue":"4","key":"9275_CR28","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1111\/j.1467-8640.2005.00277.x","volume":"21","author":"SL Epstein","year":"2005","unstructured":"Epstein, S.L., Freuder, E.C., & Wallace, R.J. (2005). Learning to support constraint programmers. Computational Intelligence, 21(4), 336\u2013371.","journal-title":"Computational Intelligence"},{"key":"9275_CR29","doi-asserted-by":"crossref","unstructured":"Feldman, J. (2011). Representing and solving rule-based decision models with constraint solvers. In Rule-based modeling and computing on the semantic web, 5th International Symposium (pp. 208\u2013221). Springer LNCS 7018.","DOI":"10.1007\/978-3-642-24908-2_23"},{"issue":"1","key":"9275_CR30","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1023\/A:1009749006768","volume":"2","author":"E Freuder","year":"1997","unstructured":"Freuder, E. (1997). In pursuit of the holy grail. Constraints, 2(1), 57\u201361.","journal-title":"Constraints"},{"key":"9275_CR31","unstructured":"Freuder, E. (2006). Constraints: the ties that bind. In Proceedings of the twenty-first national conference on artificial intelligence (pp. 1520\u20131523)."},{"key":"9275_CR32","first-page":"3","volume":"1","author":"E Freuder","year":"2007","unstructured":"Freuder, E. (2007). Holy Grail Redux. Constraint Programming Letters, 1, 3\u20135.","journal-title":"Constraint Programming Letters"},{"key":"9275_CR33","doi-asserted-by":"crossref","unstructured":"Freuder, E. (2017). Explaining ourselves: human-aware constraint reasoning. In Proceedings of the thirty-first AAAI conference on artificial intelligence (pp. 4858\u20134862).","DOI":"10.1609\/aaai.v31i1.11147"},{"key":"9275_CR34","doi-asserted-by":"crossref","unstructured":"Freuder, E., Likitvivatanavong, C., & Wallace, R. (2001). Deriving explanations and implications for constraint satisfaction problems. In Principles and practice of constraint programming \u2013 CP 2001 (pp. 585\u2013589). Berlin: Springer LNCS 2239.","DOI":"10.1007\/3-540-45578-7_44"},{"key":"9275_CR35","unstructured":"Freuder, E., & Sabin, D. (1997). Interchangeability supports abstraction and reformulation for multi-dimensional constraint satisfaction. In Proceedings of the fourteenth national conference on artificial intelligence (pp. 191\u2013196)."},{"issue":"01","key":"9275_CR36","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1142\/S0218213002000769","volume":"11","author":"E Freuder","year":"2002","unstructured":"Freuder, E., & Wallace, R. (2002). Suggestion strategies for constraint-based matchmaker agents. International Journal on Artificial Intelligence Tools, 11(01), 3\u201318.","journal-title":"International Journal on Artificial Intelligence Tools"},{"issue":"3","key":"9275_CR37","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/s10601-008-9047-y","volume":"13","author":"A Frisch","year":"2008","unstructured":"Frisch, A., Harvey, W., Jefferson, C., Mart\u00ednez-Hern\u00e1ndez, B., & Miguel, I (2008). Essence: a constraint language for specifying combinatorial problems. Constraints, 13(3), 268\u2013306.","journal-title":"Constraints"},{"key":"9275_CR38","unstructured":"Frisch, A. (2011). A decade of progress in constraint modelling and reformulation: the quest for abstraction and automation. Invited Talk slides, ModRef, 2011, https:\/\/www-users.cs.york.ac.uk\/frisch\/Research\/decade.pdf ."},{"key":"9275_CR39","doi-asserted-by":"crossref","unstructured":"Gebruers, C., Hnich, B., Bridge, D., & Freuder, E. (2005). Using CBR to select solution strategies in constraint programming. In Case-based reasoning research and development, 6th international conference on case-based reasoning (pp. 222\u2013236). Springer LNCS 3620.","DOI":"10.1007\/11536406_19"},{"issue":"3\u20134","key":"9275_CR40","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.artint.2009.11.015","volume":"174","author":"M Gelain","year":"2010","unstructured":"Gelain, M., Pini, M., Rossi, F., Venable, K., & Walsh, T. (2010). Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies. Artificial Intelligence, 174(3\u20134), 270\u2013294.","journal-title":"Artificial Intelligence"},{"key":"9275_CR41","doi-asserted-by":"crossref","unstructured":"Gent, I., Hussain, B., Jefferson, C., Kotthoff, L., Miguel, I., Nightingale, G.F., & Nightingale, P. (2014). Discriminating instance generation for automated constraint model selection. In Principles and practice of constraint programming (pp. 356\u2013365). Springer LNCS 8656.","DOI":"10.1007\/978-3-319-10428-7_27"},{"key":"9275_CR42","doi-asserted-by":"crossref","unstructured":"Gent, I., Jefferson, C., Miguel, I., & Nightingale, P. (2010). Generating special-purpose stateless propagators for arbitrary constraints. In Principles and practice of constraint programming - CP 2010 (pp. 206\u2013220). Berlin: Springer LNCS.","DOI":"10.1007\/978-3-642-15396-9_19"},{"key":"9275_CR43","unstructured":"Gent, I., Kotthoff, L., Miguel, I., & Nightingale, P. (2010). Machine learning for constraint solver design\u2014a case study for the alldifferent constraint. CoRR arXiv: 1008.4326 ."},{"issue":"1","key":"9275_CR44","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"C Gomes","year":"2000","unstructured":"Gomes, C., Selman, B., Crato, N., & Kautz, H. (2000). Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning, 24(1), 67\u2013100.","journal-title":"Journal of Automated Reasoning"},{"key":"9275_CR45","unstructured":"Goodman, B., & Flaxmanar, S. (2016). European Union regulations on algorithmic decision-making and a \u201cright to explanation\u201d. arXiv: 1606.08813v3 [stat.ML]."},{"issue":"1","key":"9275_CR46","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TVCG.2016.2598545","volume":"23","author":"S Goodwin","year":"2017","unstructured":"Goodwin, S., Mears, C., Dwyer, T., Garcia de la Banda, M., Tack, G., & Wallace, M (2017). What do constraint programming users want to see? Exploring the role of visualisation in profiling of models and search. IEEE Transactions on Visualization and Computer Graphics, 23(1), 281\u2013290.","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"9275_CR47","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., & Piette, C. (2007). MUST: Provide a finer-grained explanation of unsatisfiability. In Principles and practice of constraint programming - CP 2007 (pp. 317\u2013331). Springer LNCS 4741.","DOI":"10.1007\/978-3-540-74970-7_24"},{"key":"9275_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-41482-4","volume-title":"Combinatorial search: from algorithms to systems","author":"Y Hamadi","year":"2013","unstructured":"Hamadi, Y. (2013). Combinatorial search: from algorithms to systems. Berlin: Springer."},{"key":"9275_CR49","doi-asserted-by":"crossref","unstructured":"Hamadi, Y., Monfroy, E., & Saubion, F. (Eds.) (2012). Autonomous search. Berlin: Springer.","DOI":"10.1007\/978-3-642-21434-9"},{"key":"9275_CR50","unstructured":"Hammond, T., & O\u2019Sullivan, B. (2007). Recognizing free-form hand-sketched constraint network diagrams by combining geometry and context. In Proceedings of Eurographics Ireland (pp. 67\u201374), Vol. 2007."},{"key":"9275_CR51","unstructured":"Hinton, G., Sejnowski, T., & Ackley, D. (1984). Boltzmann machines: constraint satisfaction networks that learn. Tech. Rep. CMU-CS-84-119, Carnegie Mellon University."},{"key":"9275_CR52","doi-asserted-by":"crossref","unstructured":"Hurley, B., Kotthoff, L., Malitsky, Y., & O\u2019Sullivan, B. (2014). Proteus: a hierarchical portfolio of solvers and transformations. In Integration of AI and OR techniques in constraint programming (pp. 301\u2013317). Springer LNCS 8451.","DOI":"10.1007\/978-3-319-07046-9_22"},{"key":"9275_CR53","unstructured":"Junker, U. (2004). QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems. In Proceedings of the nineteenth national conference on artificial intelligence (pp. 167\u2013172)."},{"key":"9275_CR54","unstructured":"Jussien, N., & Barichard, V. (2000). The PaLM system: explanation-based constraint programming. In CP2000 workshop on techniques for implementing constraint programming systems (pp. 118\u2013133)."},{"key":"9275_CR55","unstructured":"Jussien, N., & Ouis, S. (2001). User-friendly explanations for constraint programming. In Proceedings of the eleventh workshop on logic programming environments (WLPE\u201901). arXiv: cs\/0111042v2 [cs.PL]."},{"key":"9275_CR56","unstructured":"Kiziltan, Z., Lippi, M., & Torroni, P. (2016). Constraint detection in natural language problem descriptions. In Proceedings of the twenty-fifth international joint conference on artificial intelligence (pp. 744\u2013750)."},{"issue":"3","key":"9275_CR57","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1609\/aimag.v35i3.2460","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L. (2014). Algorithm selection for combinatorial search problems: a survey. AI Magazine, 35(3), 48\u201360.","journal-title":"AI Magazine"},{"key":"9275_CR58","unstructured":"Kotthoff, L. (2017). Algorithm selection literature summary. http:\/\/larskotthoff.github.io\/assurvey\/ ."},{"key":"9275_CR59","doi-asserted-by":"crossref","unstructured":"Lallouet, A., Lopez, M., Martin, L., & Vrain, C. (2010). On learning constraint problems. In Proceedings of the 22nd IEEE international conference on tools for artificial intelligence, IEEE-ICTAI\u201910 (pp. 45\u201352).","DOI":"10.1109\/ICTAI.2010.16"},{"issue":"4","key":"9275_CR60","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s10601-007-9024-x","volume":"12","author":"Y Law","year":"2007","unstructured":"Law, Y., Lee, J., & Smith, B. (2007). Automatic generation of redundant models for permutation constraint satisfaction problems. Constraints, 12(4), 469\u2013505.","journal-title":"Constraints"},{"issue":"2","key":"9275_CR61","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10601-015-9183-0","volume":"21","author":"M Liffiton","year":"2016","unstructured":"Liffiton, M., Previti, A., Malik, A., & Marques-Silva, J. (2016). Fast, flexible MUS enumeration. Constraints, 21(2), 223\u2013250.","journal-title":"Constraints"},{"key":"9275_CR62","doi-asserted-by":"crossref","unstructured":"Loreggia, A., Malitsky, Y., Samulowitz, H., & Saraswat, V. (2016). Deep learning for algorithm portfolios. In Proceedings of the thirtieth AAAI conference on artificial intelligence (pp. 1280\u2013 1286).","DOI":"10.1609\/aaai.v30i1.10170"},{"issue":"3","key":"9275_CR63","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10601-008-9041-4","volume":"13","author":"K Marriott","year":"2008","unstructured":"Marriott, K., Nethercote, N., Rafeh, R., Stuckey, P, de la Banda, M., & Wallace, M (2008). The design of the zinc modelling language. Constraints, 13(3), 229\u2013267.","journal-title":"Constraints"},{"key":"9275_CR64","unstructured":"Mazeran, E., & Puget, J.-F. (2017). Machine learning, optimization and rules : time for agility and convergence. DecisionCAMP-2017 (and RuleML+RR 2017). http:\/\/2017.ruleml-rr.org\/decisioncamp-2017\/decisioncamp-2017-schedule\/ ."},{"key":"9275_CR65","unstructured":"Mears, C., & de la Banda, M. (2015). Towards automatic dominance breaking for constraint optimization problems. In Proceedings of the twenty-fourth international joint conference on artificial intelligence (pp. 360\u2013366)."},{"key":"9275_CR66","doi-asserted-by":"crossref","unstructured":"Michel, L. (2012). Constraint programming and a usability quest. In Principles and practice of constraint programming - CP 2012 (p. 1). Springer LNCS 7514.","DOI":"10.1007\/978-3-642-33558-7_1"},{"issue":"1\/2","key":"9275_CR67","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00143877","volume":"1","author":"S Minton","year":"1996","unstructured":"Minton, S. (1996). Automatically configuring constraint satisfaction programs: A case study. Constraints, 1(1\/2), 7\u201343.","journal-title":"Constraints"},{"key":"9275_CR68","doi-asserted-by":"crossref","unstructured":"Monette, J., Deville, Y., & Van Hentenryck, P. (2009). Aeon: synthesizing scheduling algorithms from high-level models. In J.W. Chinneck, B. Kristjansson, M.J. Saltzman (Eds.), Operations research and cyber-infrastructure (pp. 43\u201359). Springer ORCS 47.","DOI":"10.1007\/978-0-387-88843-9_3"},{"key":"9275_CR69","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/64.54670","volume":"5","author":"B Nadel","year":"1990","unstructured":"Nadel, B. (1990). Representation selection for constraint satisfaction: a case study using n-queens. IEEE Expert, 5, 16\u201323.","journal-title":"IEEE Expert"},{"key":"9275_CR70","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P., Becket, R., Brand, S., Duck, G., & Tack, G. (2007). MiniZinc: towards a standard CP modelling language. In Principles and Practice of Constraint Programming - CP 2007 (pp. 529-543). Springer LNCS 4741.","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"9275_CR71","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.artint.2017.07.001","volume":"251","author":"P Nightingale","year":"2017","unstructured":"Nightingale, P., Akg\u00fcn, \u00d6., Gent, I., Jefferson, C., Miguel, I., & Spracklen, P. (2017). Automatically improving constraint models in Savile Row. Artificial Intelligence, 251, 35\u201361.","journal-title":"Artificial Intelligence"},{"key":"9275_CR72","doi-asserted-by":"crossref","unstructured":"Nordlander, T., Freuder, E., & Wallace, R. (2007). Maintaining constraint-based applications. In Proceedings of the 4th international conference on Knowledge capture (pp. 79\u201386). ACM.","DOI":"10.1145\/1298406.1298422"},{"key":"9275_CR73","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., & O\u2019Sullivan, B. (2008). Using case-based reasoning in an algorithm portfolio for constraint solving. In Proceedings of the 19th Irish conference on artificial intelligence (pp. 210\u2013216)."},{"key":"9275_CR74","doi-asserted-by":"crossref","unstructured":"Ortiz-Bayliss, J., Terashima-Mar\u00edn, H., & Conant-Pablos, S. (2015). Lifelong learning selection hyper-heuristics for constraint satisfaction problems. In Mexican international conference on artificial intelligence (pp. 190\u2013201). Springer LNCS 9413.","DOI":"10.1007\/978-3-319-27060-9_15"},{"key":"9275_CR75","unstructured":"O\u2019Sullivan, B., Papadopoulos, A., Faltings, B., & Pu, P. (2007). Representative explanations for over-constrained problems. In Proceedings of the twenty-second national conference on artificial intelligence (pp. 323\u2013328)."},{"key":"9275_CR76","doi-asserted-by":"crossref","unstructured":"O\u2019Sullivan, B. (2010). Automated modelling and solving in constraint programming. In Proceedings of the twenty-fourth national conference on artificial intelligence (pp. 1493\u20131497).","DOI":"10.1609\/aaai.v24i1.7530"},{"key":"9275_CR77","doi-asserted-by":"crossref","unstructured":"Picard-Cantin, \u00c9., Bouchard, M., Quimper, C., & Sweeney, J. (2016). Learning parameters for the Sequence constraint from solutions. In Principles and practice of constraint programming (pp. 405\u2013420). Springer LNCS 9892.","DOI":"10.1007\/978-3-319-44953-1_26"},{"key":"9275_CR78","doi-asserted-by":"crossref","unstructured":"Puget, J.-F. (2004). Constraint programming next challenge: simplicity of use. In Principles and practice of constraint programming - CP 2004 (pp. 5\u20138). Springer LNCS 3258.","DOI":"10.1007\/978-3-540-30201-8_2"},{"issue":"4","key":"9275_CR79","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/B:CONS.0000049206.43218.5f","volume":"9","author":"F Rossi","year":"2004","unstructured":"Rossi, F., & Sperduti, A. (2004). Acquiring both constraint and solution preferences in interactive constraint systems. Constraints, 9(4), 311\u2013332.","journal-title":"Constraints"},{"key":"9275_CR80","unstructured":"Sabin, M., & Freuder, E. (1996). Automated formulation of constraint satisfaction problems. In Proceedings of the thirteenth national conference on artificial intelligence (p. 1407)."},{"key":"9275_CR81","doi-asserted-by":"crossref","unstructured":"Sample, T., & Mouhoub, M. (2011). Augmenting spreadsheets with constraint satisfaction. In 2011 24th Canadian conference on electrical and computer engineering (CCECE) (pp. 1028\u20131031). IEEE.","DOI":"10.1109\/CCECE.2011.6030616"},{"key":"9275_CR82","doi-asserted-by":"crossref","unstructured":"Shchekotykhin, K., & Friedrich, G. (2009). Argumentation based constraint acquisition. In Ninth IEEE international conference on data mining (pp. 476\u2013482).","DOI":"10.1109\/ICDM.2009.62"},{"key":"9275_CR83","unstructured":"Smith, D., & Westfold, S. (2013). Toward the synthesis of constraint solvers. Tech. Rep. TR-1311, Kestrel Institute."},{"key":"9275_CR84","unstructured":"Sqalli, M., & Freuder, E. (1996). Inference-based constraint satisfaction supports explanation. In Proceedings of the thirteenth national conference on artificial intelligence (pp. 318\u2013325)."},{"key":"9275_CR85","unstructured":"Wallace, R., & Freuder, E. (2001). Explanations for whom? In First international workshop on user-interaction in constraint satisfaction (pp. 119\u2013130)."},{"key":"9275_CR86","doi-asserted-by":"crossref","unstructured":"Yun, X., & Epstein, S. (2012). Learning algorithm portfolios for parallel execution. In Learning and intelligent optimization (pp. 323\u2013338). Springer LNCS 7219.","DOI":"10.1007\/978-3-642-34413-8_23"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-017-9275-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9275-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9275-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T21:33:59Z","timestamp":1693085639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-017-9275-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,7]]},"references-count":86,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9275"],"URL":"https:\/\/doi.org\/10.1007\/s10601-017-9275-0","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,7]]}}}