{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:45:06Z","timestamp":1773513906897,"version":"3.50.1"},"reference-count":104,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T00:00:00Z","timestamp":1630281600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T00:00:00Z","timestamp":1630281600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004955","name":"\u00d6sterreichische Forschungsf\u00f6rderungsgesellschaft","doi-asserted-by":"publisher","award":["880657"],"award-info":[{"award-number":["880657"]}],"id":[{"id":"10.13039\/501100004955","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008332","name":"Graz University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100008332","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2022,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Constraint solving is applied in different application contexts. Examples thereof are the configuration of complex products and services, the determination of production schedules, and the determination of recommendations in online sales scenarios. Constraint solvers apply, for example, search heuristics to assure adequate runtime performance and prediction quality. Several approaches have already been developed showing that machine learning (ML) can be used to optimize search processes in constraint solving. In this article, we provide an overview of the state of the art in applying ML approaches to constraint solving problems including constraint satisfaction, SAT solving, answer set programming (ASP) and applications thereof such as configuration, constraint-based recommendation, and model-based diagnosis. We compare and discuss the advantages and disadvantages of these approaches and point out relevant directions for future work.<\/jats:p>","DOI":"10.1007\/s10844-021-00666-5","type":"journal-article","created":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T12:02:48Z","timestamp":1630324968000},"page":"91-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["An overview of machine learning techniques in constraint solving"],"prefix":"10.1007","volume":"58","author":[{"given":"Andrei","family":"Popescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seda","family":"Polat-Erdeniz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Felfernig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Uta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00fcsl\u00fcm","family":"Atas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viet-Man","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Pilsl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Enzelsberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thi Ngoc Trang","family":"Tran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,30]]},"reference":[{"key":"666_CR1","doi-asserted-by":"crossref","unstructured":"Acher, M., Temple, P., J\u00e9z\u00e9quel, J.-M., Galindo, J., Martinez, J., & Ziadi, T. (2018). VaryLATEX: learning paper variants that meet constraints. In 12th International Workshop on Variability Modelling of Software-Intensive Systems (pp. 83\u201388).","DOI":"10.1145\/3168365.3168372"},{"key":"666_CR2","doi-asserted-by":"crossref","unstructured":"Adorf, H. -M., & Johnston, M. (1990). A discrete stochastic neural network algorithm for constraint satisfaction problems. In International Joint Conference on Neural Networks (pp. 917\u2013924).","DOI":"10.1109\/IJCNN.1990.137951"},{"key":"666_CR3","unstructured":"Alves Pereira, J., Martin, H., Acher, M., J\u00e9z\u00e9quel, J.-M., Botterweck, G., & Ventresque, A. (2019). Learning software configuration spaces: a systematic literature review research report 1-44, Univ Rennes, Inria, CNRS, IRISA."},{"key":"666_CR4","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Sellmann, M., & Tierney, K. (2009). A gender-based genetic algorithm for the automatic configuration of algorithms. In I.P. Gent (Ed.) Principles and Practice of Constraint Programming - CP 2009 (pp. 142\u2013157). Berlin: Springer.","DOI":"10.1007\/978-3-642-04244-7_14"},{"key":"666_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of constraint programming","author":"K Apt","year":"2003","unstructured":"Apt, K. (2003). Principles of constraint programming. Cambridge: Cambridge University Press."},{"key":"666_CR6","first-page":"53","volume":"1","author":"A Arbelaez","year":"2010","unstructured":"Arbelaez, A., Hamadi, Y., & Sebag, M. (2010). Continuous search in constraint programming. Autonomous Search, 1, 53\u201360.","journal-title":"Autonomous Search"},{"key":"666_CR7","doi-asserted-by":"crossref","unstructured":"Beck, J.C., Prosser, P., & Wallace, R.J. (2004). Variable Ordering Heuristics Show Promise. In M. Wallace (Ed.) Principles and Practice of Constraint Programming \u2013 CP 2004 (pp. 711\u2013715). Berlin: Springer.","DOI":"10.1007\/978-3-540-30201-8_52"},{"key":"666_CR8","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., & Bengio, S. (2017). Neural combinatorial optimization with reinforcement learning."},{"issue":"2","key":"666_CR9","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., & Prouvost, A. (2021). Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. European Journal of Operational Research, 290(2), 405\u2013421.","journal-title":"European Journal of Operational Research"},{"key":"666_CR10","doi-asserted-by":"crossref","unstructured":"In C. Bessiere, L. De Raedt, L. Kotthoff, S. Nijssen, B. O\u2019Sullivan, & D. Pedreschi (Eds.) (2016). Data Mining and Constraint Programming: Foundations of a Cross-Disciplinary approach, volume 10101 of Lecture Notes in Artificial Intelligence. Berlin: Springer.","DOI":"10.1007\/978-3-319-50137-6"},{"key":"666_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.artint.2016.04.003","volume":"237","author":"B Bischl","year":"2015","unstructured":"Bischl, B., Kerschke, P., Kotthoff, L., Lindauer, M., Malitsky, Y., Frechette, A., Hoos, H., Hutter, F., Leyton-Brown, K., Tierney, K., & Vanschoren, J. (2015). ASLib: A Benchmark Library for Algorithm Selection. Artificial Intelligence, 237, 41\u201358.","journal-title":"Artificial Intelligence"},{"key":"666_CR12","volume-title":"Pattern recognition and machine learning (information science and statistics)","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M. (2006). Pattern recognition and machine learning (information science and statistics). Berlin: Springer."},{"key":"666_CR13","doi-asserted-by":"crossref","unstructured":"Bonfietti, A., Lombardi, M., & Milano, M. (2015). Embedding decision trees and random forests in constraint programming. In L. Michel (Ed.) Integration of AI and OR Techniques in Constraint Programming (pp. 74\u201390). Cham: Springer International Publishing.","DOI":"10.1007\/978-3-319-18008-3_6"},{"issue":"3","key":"666_CR14","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/S0377-2217(98)00364-6","volume":"119","author":"S Brailsford","year":"1999","unstructured":"Brailsford, S., Potts, C., & Smith, B. (1999). Constraint satisfaction problems: Algorithms and applications. European Journal of Operational Research, 119(3), 557\u2013581.","journal-title":"European Journal of Operational Research"},{"key":"666_CR15","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., & Truszczynski, M. (2011). Answer set programming at a glance. Communications of the ACM, 54, 92\u2013103.","journal-title":"Communications of the ACM"},{"key":"666_CR16","unstructured":"B\u00fcnz, B., & Lamm, M. (2017). Graph neural networks and boolean satisfiability. arXiv:1702.03592."},{"key":"666_CR17","unstructured":"Burkardt, J. (2009). Virginia Tech, Advanced Research Computing, Interdisciplinary Center for Applied Mathematics."},{"key":"666_CR18","unstructured":"Burke, R. (2000). Knowledge-based recommender systems. In Encyclopedia of library and information systems (p. 2000). Marcel dekker."},{"key":"666_CR19","doi-asserted-by":"publisher","first-page":"3324","DOI":"10.1609\/aaai.v34i04.5733","volume":"34","author":"C Cameron","year":"2020","unstructured":"Cameron, C., Chen, R., Hartford, J., & Leyton-Brown, K. (2020). Predicting propositional satisfiability via end-to-end learning. AAAI Conference on Artificial Intelligence, 34, 3324\u20133331.","journal-title":"AAAI Conference on Artificial Intelligence"},{"key":"666_CR20","doi-asserted-by":"crossref","unstructured":"Cappart, Q., Moisan, T., Rousseau, L.-M., Pr\u00e9mont-Schwarz, I, & Cire, A. (2020). Combining reinforcement learning and constraint programming for combinatorial optimization.","DOI":"10.1609\/aaai.v35i5.16484"},{"issue":"3","key":"666_CR21","first-page":"69","volume":"4","author":"JG Carbonell","year":"1983","unstructured":"Carbonell, J.G., Michalski, R.S., & Mitchell, T.M. (1983). Machine learning: a historical and methodological analysis. AI Magazine, 4(3), 69.","journal-title":"AI Magazine"},{"key":"666_CR22","unstructured":"Da Col, Giacomo, & Teppan, EC (2017). Learning constraint satisfaction heuristics for configuration problems. In 19Th international configuration workshop (pp. 8\u201311)."},{"key":"666_CR23","unstructured":"Darwiche, A., & Hirth, A. (2020). On the reasons behind decisions. In 24Th european conference on artificial intelligence (ECAI 2020) (pp. 712\u2013720)."},{"key":"666_CR24","doi-asserted-by":"crossref","unstructured":"Epstein, S., & Freuder, E. (2001). Collaborative learning for constraint solving. In Intl. Conference on principles and practice of constraint programming, volume 2239 of LNCS (pp. 46\u201360).","DOI":"10.1007\/3-540-45578-7_4"},{"key":"666_CR25","unstructured":"Erdeniz, S.P., & Felfernig, A. (2018). Cluster and learn: Cluster-specific heuristics for graph coloring. In Intl. Conference on the practice and theory of automated timetabling (pp. 401\u2013404). Elsevier."},{"key":"666_CR26","doi-asserted-by":"crossref","unstructured":"Erdeniz, S.P., Felfernig, A., & Atas, M. (2018). Learndiag: A Direct Diagnosis Algorithm Based On Learned Heuristics. In Joint german\/austrian conference on artificial intelligence (k\u00fcnstliche intelligenz) (pp. 190\u2013197). Springer.","DOI":"10.1007\/978-3-030-00111-7_17"},{"key":"666_CR27","unstructured":"Erdeniz, S.P., Felfernig, A., & Atas, M. (2019). Matrix factorization based heuristics for direct diagnosis. In Intl. Conference on industrial, engineering and other applications of applied intelligent systems (IEA\/AIE\u201919). Springer."},{"key":"666_CR28","doi-asserted-by":"crossref","unstructured":"Erdeniz, S.P., Felfernig, A., Atas, M., Tran, T.N.T., Jeran, M., & Stettinger, M. (2017). Cluster-Specific Heuristics for constraint solving. In Intl. Conference on industrial, engineering and other applications of applied intelligent systems (pp. 21\u201330). Springer.","DOI":"10.1007\/978-3-319-60042-0_3"},{"key":"666_CR29","doi-asserted-by":"crossref","unstructured":"Erdeniz, S.P., Felfernig, A., Samer, R., & Atas, M. (2019). Matrix Factorization based Heuristics for Constraint-based Recommenders. In 34Th ACM\/SIGAPP symposium on applied computing (SAC\u201919) (pp. 1655\u20131662). ACM.","DOI":"10.1145\/3297280.3297441"},{"issue":"3","key":"666_CR30","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1609\/aimag.v32i3.2369","volume":"32","author":"A Falkner","year":"2011","unstructured":"Falkner, A., Felfernig, A., & Haag, A. (2011). Recommendation technologies for configurable products. AI Magazine, 32(3), 99\u2013108.","journal-title":"AI Magazine"},{"key":"666_CR31","unstructured":"Felfernig, A. (2004). Effort estimation for knowledge-based configuration systems. In 16Th intl. Conference on software engineering and knowledge engineering (SEKE2004) (pp. 148\u2013155). Canada: Banff."},{"key":"666_CR32","doi-asserted-by":"crossref","unstructured":"Felfernig, A., & Burke, S. R. (2008). Constraint-based recommender systems: technologies and research issues. In 10th Intl. Conference on Electronic commerce, ICEC \u201908, New York, NY USA. Association for Computing Machinery.","DOI":"10.1145\/1409540.1409544"},{"issue":"2","key":"666_CR33","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0004-3702(03)00117-6","volume":"152","author":"A Felfernig","year":"2004","unstructured":"Felfernig, A., Friedrich, G., Jannach, D., & Stumptner, M. (2004). Consistency-based diagnosis of configuration knowledge bases. Artificial Intelligence, 152(2), 213\u2013234.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"666_CR34","doi-asserted-by":"publisher","first-page":"11","DOI":"10.2753\/JEC1086-4415110201","volume":"11","author":"A Felfernig","year":"2006","unstructured":"Felfernig, A., Friedrich, G., Jannach, D., & Zanker, M. (2006). An integrated environment for the development of knowledge-based recommender applications. International Journal of Electronic Commerce (IJEC), 11(2), 11\u201334.","journal-title":"International Journal of Electronic Commerce (IJEC)"},{"key":"666_CR35","unstructured":"Felfernig, A., Friedrich, G., Schubert, M., Mandl, M., Mairitsch, M., & Teppan, E. (2009). Plausible repairs for inconsistent requirements. In 21St international joint conference on artificial intelligence (IJCAI\u201909) (pp. 791\u2013796). California: Pasadena."},{"key":"666_CR36","volume-title":"Knowledge-Based Configuration: From Research to Business Cases","author":"A Felfernig","year":"2014","unstructured":"Felfernig, A., Hotz, L., Bagley, C., & Tiihonen, J. (2014). Knowledge-Based Configuration: From Research to Business Cases. Burlington: Morgan Kaufmann."},{"key":"666_CR37","doi-asserted-by":"crossref","unstructured":"Felfernig, A., Le, V., Popescu, A., Uta, M., Tran, T., & Atas, M. (2021). An overview of recommender systems and machine learning in feature modeling and configuration, (pp. 1\u20138). Austria: ACM.","DOI":"10.1145\/3442391.3442408"},{"issue":"1","key":"666_CR38","first-page":"53","volume":"26","author":"A Felfernig","year":"2012","unstructured":"Felfernig, A., Schubert, M., & Zehentner, C. (2012). An efficient diagnosis algorithm for inconsistent constraint sets. Artificial intelligence for engineering design. Analysis, and Manufacturing (AIEDAM), 26(1), 53\u201362.","journal-title":"Analysis, and Manufacturing (AIEDAM)"},{"issue":"1","key":"666_CR39","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10844-017-0492-1","volume":"51","author":"A Felfernig","year":"2018","unstructured":"Felfernig, A., Walter, R., Galindo, J.A., Benavides, D., Erdeniz, S.P., Atas, M., & Reiterer, S. (2018). Anytime diagnosis for reconfiguration. Journal of Intelligent Information Systems, 51(1), 161\u2013182.","journal-title":"Journal of Intelligent Information Systems"},{"issue":"4","key":"666_CR40","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/5254.708434","volume":"13","author":"G Fleischanderl","year":"1998","unstructured":"Fleischanderl, G., Friedrich, G., Haselb\u00f6ck, A., Schreiner, H., & Stumptner, M. (1998). Configuring large systems using generative constraint satisfaction. IEEE Intelligent Systems, 13(4), 59\u201368.","journal-title":"IEEE Intelligent Systems"},{"key":"666_CR41","doi-asserted-by":"publisher","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, 57\u201361.","journal-title":"Constraints"},{"key":"666_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1720-6","volume-title":"Four-Color Theorem","author":"R Fritsch","year":"1998","unstructured":"Fritsch, R., Fritsch, R., Fritsch, G., & Fritsch, G. (1998). Four-Color Theorem. Berlin: Springer."},{"key":"666_CR43","doi-asserted-by":"crossref","unstructured":"Galassi, A., Lombardi, M., Mello, P., & Milano, M. (2018). Model Agnostic Solution of CSPs via Deep Learning: A Preliminary Study. In W.-J. van Hoeve (Ed.) Integration of constraint programming, artificial intelligence, and operations research (pp. 254\u2013262). Springer.","DOI":"10.1007\/978-3-319-93031-2_18"},{"key":"666_CR44","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M.T., & Ziller, S. (2011). A portfolio solver for answer set programming: Preliminary report. In J.P. Delgrande W. Faber (Eds.) Logic Programming and Nonmonotonic Reasoning (pp. 352\u2013357). Berlin: Springer.","DOI":"10.1007\/978-3-642-20895-9_40"},{"key":"666_CR45","first-page":"873","volume":"215","author":"I Gent","year":"2010","unstructured":"Gent, I., Jefferson, C., Kotthoff, L., Miguel, I., Moore, N., Nightingale, P., & Petrie, K. (2010). Learning when to use lazy learning in constraint solving. Frontiers in Artificial Intelligence and Applications, 215, 873\u2013878.","journal-title":"Frontiers in Artificial Intelligence and Applications"},{"key":"666_CR46","unstructured":"Gent, I.P., Kotthoff, L., Miguel, I., & Nightingale, P. (2010). Machine learning for constraint solver design \u2013 a case study for the alldifferent constraint. In 3Rd workshop on techniques for implementing constraint programming systems (TRICS) (pp. 13\u201325)."},{"key":"666_CR47","doi-asserted-by":"crossref","unstructured":"Grasch, P., Felfernig, A., & Reinfrank, F. (2013). Recomment: Towards Critiquing-based Recommendation with Speech Interaction. In 7th ACM conference on Recommender systems (RecSys \u201913) (pp. 157\u2013164). China: ACM.","DOI":"10.1145\/2507157.2507161"},{"key":"666_CR48","doi-asserted-by":"crossref","unstructured":"Gu, J., Purdom, P.W., Franco, J., & Wah, B.W. (1996). Algorithms for the satisfiability (SAT) problem: a survey. In DIMACS Series in discrete mathematics and theoretical computer science (pp. 19\u2013152). American Mathematical Society.","DOI":"10.1090\/dimacs\/035\/02"},{"key":"666_CR49","unstructured":"Guerri, A., & Milano, M. (2004). Learning techniques for automatic algorithm portfolio selection. In 16th European Conference on Artificial Intelligence, ECAI\u201904 (pp. 475\u2013479). NLD: IOS Press."},{"key":"666_CR50","doi-asserted-by":"crossref","unstructured":"Gunawardana, A., & Shani, G. (2015). Evaluating Recommender Systems. In F. Ricci, L. Rokach, & B. Shapira (Eds.) Recommender Systems Handbook (pp. 265\u2013308). Springer.","DOI":"10.1007\/978-1-4899-7637-6_8"},{"key":"666_CR51","doi-asserted-by":"crossref","unstructured":"Haim, S., & Walsh, T. (2009). Restart strategy selection using machine learning techniques. In O. Kullmann (Ed.) Theory and Applications of Satisfiability Testing - SAT 2009 (pp. 312\u2013325). Berlin: Springer.","DOI":"10.1007\/978-3-642-02777-2_30"},{"key":"666_CR52","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hamadi, Y., Hoos, H., & Leyton-Brown, K. (2006). Performance prediction and automated tuning of randomized and parametric algorithms. In Intl. Conference on principles and practice of constraint programming (CP 2006), (Vol. 4204 pp. 213\u2013228).","DOI":"10.1007\/11889205_17"},{"key":"666_CR53","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., & Leyton-Brown, K. (2014). Algorithm runtime prediction: Methods & evaluation. Artificial Intelligence, 206, 79\u2013111.","journal-title":"Artificial Intelligence"},{"key":"666_CR54","unstructured":"Jannach, D. (2013). Toward Automatically Learned Search Heuristics for CSP-encoded Configuration Problems - Results from an Initial Experimental Analysis. In 15th international configuration workshop (pp. 9\u201313)."},{"key":"666_CR55","unstructured":"Johnston, M., & Minton, S. (1994). Analyzing a heuristic strategy for constraint satisfaction and scheduling. Intelligent Scheduling, 257\u2013289."},{"key":"666_CR56","unstructured":"Junker, U. (2004). QuickXPlain: preferred explanations and relaxations for over-constrained problems. In AAAI 2004 (pp. 167\u2013172). AAAI."},{"issue":"3","key":"666_CR57","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/245108.245126","volume":"40","author":"J Konstan","year":"1997","unstructured":"Konstan, J., Miller, B., Herlocker, J., Gordon, L., & Riedl, J. (1997). GroupLens: Applying Collaborative Filtering to Usenet News. Communications of the ACM, 40(3), 77\u201387.","journal-title":"Communications of the ACM"},{"issue":"8","key":"666_CR58","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren, Y., Bell, R., & Volinsky, C. (2009). Matrix factorization techniques for recommender systems. IEEE Computer, 42(8), 30\u201337.","journal-title":"IEEE Computer"},{"key":"666_CR59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21708-5","volume-title":"Combinatorial Optimization \u2013 Theory and Algorithms","author":"B Korte","year":"2000","unstructured":"Korte, B., & Vygen, J. (2000). Combinatorial Optimization \u2013 Theory and Algorithms. Berlin: Springer."},{"issue":"3","key":"666_CR60","doi-asserted-by":"publisher","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"},{"issue":"1","key":"666_CR61","first-page":"32","volume":"13","author":"V Kumar","year":"1992","unstructured":"Kumar, V. (1992). Algorithms for Sonstraint-Satisfaction Problems: A Survey. AI Magazine, 13(1), 32\u201344.","journal-title":"AI Magazine"},{"key":"666_CR62","unstructured":"Kurin, V., Godil, S., Whiteson, S., & Catanzaro, B. (2019). Improving SAT solver heuristics with graph networks and reinforcement learning. arXiv:1909.11830."},{"key":"666_CR63","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/S1571-0653(04)00332-4","volume":"9","author":"M Lagoudakis","year":"2001","unstructured":"Lagoudakis, M., & Littman, M. (2001). Learning to select branching rules in the DPLL procedure for satisfiability. Electronic Notes in Discrete Mathematics, 9, 344\u2013359.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"666_CR64","doi-asserted-by":"crossref","unstructured":"Lallouet, A., & Legtchenko, A. (2005). Two contributions of constraint programming to machine learning. In European conference on machine learning (ECML), volume 3720 of LNCS (pp. 617\u2013624).","DOI":"10.1007\/11564096_61"},{"key":"666_CR65","unstructured":"Lederman, G., Rabe, M., Seshia, S., & Lee, E.A. (2020). Learning heuristics for quantified boolean formulas through reinforcement learning. In Intl. Conference on learning representations."},{"issue":"6","key":"666_CR66","doi-asserted-by":"publisher","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"Leighton, F.T. (1979). A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards, 84(6), 489\u2013506.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"666_CR67","doi-asserted-by":"crossref","unstructured":"Liang, J., Ganesh, V., Poupart, P., & Czarnecki, K. (2016). Learning rate based branching heuristic for SAT solvers. In Intl. Conference on theory and applications of satisfiability testing (SAT 2016) (pp. 123\u2013140).","DOI":"10.1007\/978-3-319-40970-2_9"},{"key":"666_CR68","doi-asserted-by":"crossref","unstructured":"Lombardi, M., & Milano, M. (2018). Boosting combinatorial problem modeling with machine learning. In 27Th intl Joint conf on artificial intelligence (IJCAI 2018) (pp. 5472\u20135478).","DOI":"10.24963\/ijcai.2018\/772"},{"key":"666_CR69","doi-asserted-by":"crossref","unstructured":"Loreggia, A., Malitsky, Y., Samulowitz, H., & Saraswat, V. (2016). Deep learning for algorithm portfolios. In AAAI Conference on artificial intelligence, AAAI\u201916 (pp. 1280\u20131286). AAAI Press.","DOI":"10.1609\/aaai.v30i1.10170"},{"key":"666_CR70","unstructured":"Manhaeve, R., Dumancic, S., Kimmig, A., Demeester, T., & Raedt, L.D. (2018). Deepproblog: neural probabilistic logic programming. In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, & R. Garnett (Eds.) Advances in Neural Information Processing Systems (pp. 3749\u20133759)."},{"key":"666_CR71","unstructured":"Maratea, M., Pulina, L., & Ricca, F. (2012). Applying machine learning techniques to ASP solving. In 28Th intl. Conference on logic programming (ICLP 2012), (Vol. 17 pp. 37\u201348)."},{"key":"666_CR72","doi-asserted-by":"crossref","unstructured":"Mouhoub, M., & Jafari, B. (2011). Heuristic Techniques for Variable and Value Ordering in CSPs. In 13Th conference on genetic and evolutionary computation (pp. 457\u2013464). ACM.","DOI":"10.1145\/2001576.2001640"},{"key":"666_CR73","unstructured":"Myll\u00e4rniemi, V., Tiihonen, J., Raatikainen, M., & Felfernig, A. (2014). Using answer set programming for feature model representation and configuration. In International workshop on configuration, volume 1220 of CEUR workshop proceedings (pp. 1\u20138)."},{"key":"666_CR74","first-page":"523","volume-title":"Choosing search heuristics by Non-Stationary reinforcement Learning","author":"A Nareyek","year":"2004","unstructured":"Nareyek, A. (2004). Choosing search heuristics by Non-Stationary reinforcement Learning, (pp. 523\u2013544). USA: Kluwer Academic Publishers."},{"key":"666_CR75","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., & O\u2019Sullivan, B. (2013). Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving?. In Irish Conf. on Artificial Intelligence and Cognitive Science (pp. 210\u2013216)."},{"key":"666_CR76","volume-title":"Heuristics: Intelligent search strategies for computer problem solving","author":"J Pearl","year":"1984","unstructured":"Pearl, J. (1984). Heuristics: Intelligent search strategies for computer problem solving. USA: Addison-Wesley Longman Publishing Co. Inc."},{"key":"666_CR77","volume-title":"Constraint Programming meets Machine Learning and Data Mining, Vol. 1","author":"LD Raedt","year":"2011","unstructured":"Raedt, L.D., Nijssen, S., O\u2019Sullivan, B., & Hentenryck, P.V. (2011). Constraint Programming meets Machine Learning and Data Mining Vol. 1. Germany: Dagstuhl Reports."},{"key":"666_CR78","doi-asserted-by":"crossref","unstructured":"Raedt, L.D., Passerini, A., & Teso, S. (2018). Learning constraints from examples. In 32nd AAAI conference on artificial intelligence (AAAI 2018) (pp. 2\u20137).","DOI":"10.1609\/aaai.v32i1.12217"},{"issue":"1","key":"666_CR79","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"23","author":"R Reiter","year":"1987","unstructured":"Reiter, R. (1987). A theory of diagnosis from first principles. Artificial Intelligence, 23(1), 57\u201395.","journal-title":"Artificial Intelligence"},{"key":"666_CR80","volume-title":"Handbook of Constraint Programming (Foundations of Artificial Intelligence)","author":"F Rossi","year":"2006","unstructured":"Rossi, F., Beek, P.V., & Walsh, v. (2006). Handbook of Constraint Programming (Foundations of Artificial Intelligence). USA: Elsevier Science Inc."},{"issue":"5","key":"666_CR81","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TNN.1998.712192","volume":"9","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., & Barto, A.G. (1998). Reinforcement learning: An introduction. IEEE Transactions on Neural Networks, 9(5), 285\u2013286.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"1","key":"666_CR82","first-page":"1","volume":"86","author":"N Sadeh","year":"1996","unstructured":"Sadeh, N., & Fox, M.S. (1996). Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. AI Journal, 86(1), 1\u201341.","journal-title":"AI Journal"},{"key":"666_CR83","unstructured":"Samulowitz, H., & Memisevic, R. (2007). Learning to solve QBF. In AAAI Conference on Artificial Intelligence (pp. 255\u2013260)."},{"key":"666_CR84","unstructured":"Selsam, D., Lamm, M., B\u00fcnz, B., Liang, P., de Moura, L., & Dill, D.L. (2019). Learning a SAT solver from Single-Bit supervision."},{"key":"666_CR85","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., & Soininen, T. (2002). Extending and implementing the stable model semantics. Artificial Intelligence, 138, 181\u2013234.","journal-title":"Artificial Intelligence"},{"key":"666_CR86","unstructured":"Spieker, H., & Gotlieb, A. (2018). Towards Hybrid Constraint Solving with Reinforcement Learning and Constraint-Based Local Search Data Science meets Optimization Workshop at Federated Artificial Intelligence Meeting."},{"key":"666_CR87","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/MS.2017.4121211","volume":"34","author":"P Temple","year":"2017","unstructured":"Temple, P., Acher, M., J\u00e9z\u00e9quel, J.-M., & Barais, O. (2017). Learning Contextual-Variability models. IEEE Software, 34, 64\u201370.","journal-title":"IEEE Software"},{"key":"666_CR88","doi-asserted-by":"crossref","unstructured":"Temple, P., Galindo Duarte, J., Acher, M., & J\u00e9z\u00e9quel, J.-M. (2016). Using machine learning to infer constraints for product lines. In 20Th international systems and software product line conference (pp. 209\u2013218).","DOI":"10.1145\/2934466.2934472"},{"key":"666_CR89","volume-title":"Foundations of Constraint Satisfaction. Computation In cognitive science","author":"EPK Tsang","year":"1993","unstructured":"Tsang, E.P.K. (1993). Foundations of Constraint Satisfaction. Computation In cognitive science. Cambridge: Academic Press."},{"key":"666_CR90","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10844-016-0433-4","volume":"49","author":"T Ulz","year":"2016","unstructured":"Ulz, T., Schwarz, M., Felfernig, A., Haas, S., Shehadeh, A., Reiterer, S., & Stettinger, M. (2016). Human Computation for Constraint-based Recommenders. Journal of Intelligent Information Systems (JIIS), 49, 37\u201357.","journal-title":"Journal of Intelligent Information Systems (JIIS)"},{"key":"666_CR91","unstructured":"Uta, M., & Felfernig, A. (2020). Towards machine learning based configuration. In C. Forza, L. Hvam, & A. Felfernig (Eds.) 22nd International Configuration Workshop (pp. 25\u201328)."},{"key":"666_CR92","doi-asserted-by":"crossref","unstructured":"Uta, M., Felfernig, A., Le, V. -M., Popescu, A., Tran, T., & Helic, D. (2021). Evaluating recommender systems in feature model configuration. In 25th ACM International Systems and Software Product Line Conference (SPLC \u201921). United Kingdom: ACM.","DOI":"10.1145\/3461001.3471144"},{"key":"666_CR93","unstructured":"Wang, C., & Tsang, E. (1991). Solving Constraint Satisfaction Problems Using Neural Networks. In 2nd Intl Conference on Artificial Neural Networks (pp. 295\u2013299)."},{"key":"666_CR94","unstructured":"Wen, J., Khan, M., Che, M., Yan, Y., & Yang, G. (2020). Constraint solving with deep learning for symbolic execution."},{"key":"666_CR95","doi-asserted-by":"crossref","unstructured":"Wohlin, C. (2014). Guidelines for Snowballing in Systematic Literature Studies and a Replication in Software Engineering. In 18th Intl Conference on Evaluation and Assessment in Software Engineering (EASE\u201914) (pp. 1\u201310).","DOI":"10.1145\/2601248.2601268"},{"key":"666_CR96","doi-asserted-by":"crossref","unstructured":"Xu, H., Koenig, S., & Kumar, T.K.S. (2018). Towards effective deep learning for constraint satisfaction problems. In J.N. Hooker (Ed.) 24th Intl. Conference on Principles and Practice of Constraint Programming (CP Lille, France, August 27-31, 2018, volume 11008 of Lecture Notes in Computer Science (p. 2018). Springer.","DOI":"10.1007\/978-3-319-98334-9_38"},{"key":"666_CR97","unstructured":"Xu, L., Hoos, H., & Leyton-Brown, K. (2012). Predicting satisfiability at the phase transition. In AAAI Conference on artificial intelligence, (Vol. 1 pp. 584\u2013590)."},{"key":"666_CR98","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H., & Leyton-Brown, K. (2008). SATZilla: Portfolio-based Algorithm Selection for SAT. Journal of Artificial Intelligence Research, 32, 565\u2013606.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"666_CR99","unstructured":"Xu, Y., Stern, D., & Samulowitz, H. (2009). Learning adaptation to solve constraint satisfaction problems. In LION 2009, Learning and intelligent optimization."},{"key":"666_CR100","doi-asserted-by":"crossref","unstructured":"Yang, Z., Ishay, A., & Lee, J. (2020). NeurASP: embracing neural networks into answer set programming. In C. Bessiere (Ed.) 29th Intl. Joint Conf. on Artificial Intelligence, IJCAI-20 (pp. 1755\u20131762).","DOI":"10.24963\/ijcai.2020\/243"},{"key":"666_CR101","unstructured":"Yolcu, E., & P\u00f3, czos B. (2019). Learning local search heuristics for boolean satisfiability. In H.M. Wallach, H. Larochelle, Beygelzimer A., F. D\u2019Alch\u00e9-Buc, E.B. Fox, & R. Garnett (Eds.) Neural Information Processing Systems 2019 NeurIPS 2019 (pp. 7990\u20138001)."},{"key":"666_CR102","doi-asserted-by":"crossref","unstructured":"Zanker, M. (2008). A Collaborative Constraint-based Meta-level Recommender. In ACM Conference on recommender systems (pp. 139\u2013146). ACM.","DOI":"10.1145\/1454008.1454032"},{"key":"666_CR103","doi-asserted-by":"crossref","unstructured":"Zanker, M., Aschinger, M., & Jessenitschnig, M. (2007). Development of a collaborative and constraint-based web configuration system for personalized bundling of products and services. In Intl. Conference on web information systems engineering (pp. 273\u2013284). Springer.","DOI":"10.1007\/978-3-540-76993-4_23"},{"key":"666_CR104","doi-asserted-by":"crossref","unstructured":"Zhang, W., Sun, Z., Zhu, Q., Li, G., Cai, S., Xiong, Y., & Zhang, L. (2020). NLOcalSAT: boosting local search with solution prediction. In C. Bessiere (Ed.) Intl Joint Conference on Artificial Intelligence (IJCAI-20) (pp. 1177\u20131183).","DOI":"10.24963\/ijcai.2020\/164"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-021-00666-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10844-021-00666-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-021-00666-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T08:17:49Z","timestamp":1673165869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10844-021-00666-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,30]]},"references-count":104,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["666"],"URL":"https:\/\/doi.org\/10.1007\/s10844-021-00666-5","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,30]]},"assertion":[{"value":"16 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}