{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T12:06:14Z","timestamp":1758629174843,"version":"3.40.3"},"publisher-location":"Cham","reference-count":71,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031605963"},{"type":"electronic","value":"9783031605970"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60597-0_12","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:39Z","timestamp":1716818679000},"page":"170-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["UNSAT Solver Synthesis via\u00a0Monte Carlo Forest Search"],"prefix":"10.1007","author":[{"given":"Chris","family":"Cameron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Hartford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taylor","family":"Lundy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuan","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Milligan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rex","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Leyton-Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"key":"12_CR1","unstructured":"SAT competition. The International SAT Competition Web Page (2002\u20132024). http:\/\/www.satcompetition.org\/"},{"key":"12_CR2","unstructured":"Abe, K., Xu, Z., Sato, I., Sugiyama, M.: Solving NP-hard problems on graphs by reinforcement learning without domain knowledge. arXiv preprint arXiv:1905.11623, pp. 1\u201324 (2019)"},{"issue":"8","key":"12_CR3","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1038\/s42256-019-0070-z","volume":"1","author":"F Agostinelli","year":"2019","unstructured":"Agostinelli, F., McAleer, S., Shmakov, A., Baldi, P.: Solving the Rubik\u2019s cube with deep reinforcement learning and search. Nat. Mach. Intell. 1(8), 356\u2013363 (2019)","journal-title":"Nat. Mach. Intell."},{"key":"12_CR4","unstructured":"Balcan, M.: Data-driven algorithm design. CoRR abs\/2011.07177 (2020). https:\/\/arxiv.org\/abs\/2011.07177"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-31866-5_3","volume-title":"Advances in Computer Games","author":"P Baudi\u0161","year":"2012","unstructured":"Baudi\u0161, P., Gailly, J.: PACHI: state of the art open source go program. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 24\u201338. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31866-5_3"},{"issue":"2","key":"12_CR6","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.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR7","unstructured":"Berre, D.L., Roussel, O., Simon, L.: SAT 2007 competition. The International SAT Competition Web Page (2007). http:\/\/www.satcompetition.org\/"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"issue":"130","key":"12_CR9","first-page":"1","volume":"24","author":"Q Cappart","year":"2023","unstructured":"Cappart, Q., Ch\u00e9telat, D., Khalil, E.B., Lodi, A., Morris, C., Veli\u010dkovi\u0107, P.: Combinatorial optimization and reasoning with graph neural networks. J. Mach. Learn. Res. 24(130), 1\u201361 (2023)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/0221022","volume":"21","author":"PC Chen","year":"1992","unstructured":"Chen, P.C.: Heuristic sampling: a method for predicting the performance of tree searching programs. SIAM J. Comput. 21(2), 295\u2013315 (1992)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1287\/ijoc.1040.0107","volume":"18","author":"G Cornu\u00e9jols","year":"2006","unstructured":"Cornu\u00e9jols, G., Karamanov, M., Li, Y.: Early estimates of the size of branch-and-bound trees. INFORMS J. Comput. 18(1), 86\u201396 (2006)","journal-title":"INFORMS J. Comput."},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R Coulom","year":"2007","unstructured":"Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72\u201383. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75538-8_7"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Coulom, R.: Computing \u201cElo ratings\u201d of move patterns in the game of Go. ICGA J. 30(4), 198\u2013208 (2007)","DOI":"10.3233\/ICG-2007-30403"},{"key":"12_CR14","unstructured":"Czech, J., Korus, P., Kersting, K.: Monte-Carlo graph search for AlphaZero. arXiv preprint arXiv:2012.11045, pp. 1\u201311 (2020)"},{"issue":"7","key":"12_CR15","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-24605-3_36","volume-title":"Theory and Applications of Satisfiability Testing","author":"G Dequen","year":"2004","unstructured":"Dequen, G., Dubois, O.: kcnfs: an efficient solver for random k-SAT formulae. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 486\u2013501. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_36"},{"key":"12_CR17","unstructured":"Duan, H., Nejati, S., Trimponias, G., Poupart, P., Ganesh, V.: Online Bayesian moment matching based SAT solver heuristics. In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, pp. 2710\u20132719 (2020)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-030-58942-4_12","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"M Etheve","year":"2020","unstructured":"Etheve, M., Al\u00e8s, Z., Bissuel, C., Juan, O., Kedad-Sidhoum, S.: Reinforcement learning for variable selection in a branch and bound algorithm. In: Hebrard, E., Musliu, N. (eds.) CPAIOR 2020. LNCS, vol. 12296, pp. 176\u2013185. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58942-4_12"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Fr\u00e9chette, A., Newman, N., Leyton-Brown, K.: Solving the station repacking problem. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence, AAAI 2016, pp. 702\u2013709 (2016)","DOI":"10.1609\/aaai.v30i1.10077"},{"key":"12_CR21","unstructured":"Gasse, M., Ch\u00e9telat, D., Ferroni, N., Charlin, L., Lodia, A.: Exact combinatorial optimization with graph convolutional neural networks. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems, NeurIPS 2019, pp. 15580\u201315592 (2019)"},{"key":"12_CR22","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, NeurIPS 2017, pp. 1024\u20131034 (2017)"},{"key":"12_CR23","unstructured":"Hartford, J.S., Graham, D.R., Leyton-Brown, K., Ravanbakhsh, S.: Deep models of interactions across sets. In: Proceedings of the 35th International Conference on Machine Learning, ICML 2018, vol.\u00a080, pp. 1914\u20131923 (2018)"},{"key":"12_CR24","first-page":"155","volume":"185","author":"M Heule","year":"2009","unstructured":"Heule, M., van Maaren, H.: Look-ahead based sat solvers. Handb. Satisf. 185, 155\u2013184 (2009)","journal-title":"Handb. Satisf."},{"key":"12_CR25","unstructured":"Heule, M., van Maaren, H.: march_hi. In: SAT Competition 2009: Solver and Benchmark Descriptions, SAT 2009, pp. 27\u201328 (2009)"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-34188-5_8","volume-title":"Hardware and Software: Verification and Testing","author":"MJH Heule","year":"2012","unstructured":"Heule, M.J.H., Kullmann, O., Wieringa, S., Biere, A.: Cube and conquer: guiding CDCL SAT solvers by lookaheads. In: Eder, K., Louren\u00e7o, J., Shehory, O. (eds.) HVC 2011. LNCS, vol. 7261, pp. 50\u201365. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34188-5_8"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-21434-9_3","volume-title":"Autonomous Search","author":"HH Hoos","year":"2011","unstructured":"Hoos, H.H.: Automated algorithm configuration and parameter tuning. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 37\u201371. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21434-9_3"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"104781","DOI":"10.1016\/j.cor.2019.104781","volume":"113","author":"A Hottung","year":"2020","unstructured":"Hottung, A., Tanaka, S., Tierney, K.: Deep learning assisted heuristic tree search for the container pre-marshalling problem. Comput. Oper. Res. 113, 104781 (2020)","journal-title":"Comput. Oper. Res."},{"key":"12_CR29","unstructured":"Huang, J., Darwiche, A.: A structure-based variable ordering heuristic for SAT. In: Proceedings of the 18th International Joint Conference on Artificial intelligence, IJCAI 2003, pp. 1167\u20131172 (2003)"},{"issue":"2","key":"12_CR30","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1017932429737","volume":"49","author":"M Kearns","year":"2002","unstructured":"Kearns, M., Mansour, Y., Ng, A.Y.: A sparse sampling algorithm for near-optimal planning in large Markov decision processes. Mach. Learn. 49(2), 193\u2013208 (2002)","journal-title":"Mach. Learn."},{"key":"12_CR31","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-20323-8_5","volume-title":"Advanced Boolean Techniques","author":"O Keszocze","year":"2020","unstructured":"Keszocze, O., Schmitz, K., Schloeter, J., Drechsler, R.: Improving SAT solving using Monte Carlo tree search-based clause learning. In: Drechsler, R., Soeken, M. (eds.) Advanced Boolean Techniques, pp. 107\u2013133. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-20323-8_5"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Khalil, E., Le\u00a0Bodic, P., Song, L., Nemhauser, G., Dilkina, B.: Learning to branch in mixed integer programming. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a030 (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Vaezipoor, P., Dilkina, B.: Finding backdoors to integer programs: a Monte Carlo tree search framework. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, pp. 1\u201310 (2022)","DOI":"10.1609\/aaai.v36i4.20293"},{"key":"12_CR34","unstructured":"Kilby, P., Slaney, J., Thi\u00e9baux, S., Walsh, T.: Estimating search tree size. In: Proceedings of the 21st National Conference of DArtificial Intelligence, AAAI 2006, pp. 1014\u20131019 (2006)"},{"key":"12_CR35","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. In: Proceedings of the 3rd International Conference on Learning Representations, pp. 1\u201315, ICLR 2014 (2014)"},{"issue":"129","key":"12_CR36","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1090\/S0025-5718-1975-0373371-6","volume":"29","author":"DE Knuth","year":"1975","unstructured":"Knuth, D.E.: Estimating the efficiency of backtrack programs. Math. Comput. 29(129), 122\u2013136 (1975)","journal-title":"Math. Comput."},{"key":"12_CR37","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_29"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-50137-6_7","volume-title":"Data Mining and Constraint Programming","author":"L Kotthoff","year":"2016","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O\u2019Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS (LNAI), vol. 10101, pp. 149\u2013190. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50137-6_7"},{"key":"12_CR39","unstructured":"Kurin, V., Godil, S., Whiteson, S., Catanzaro, B.: Can $$q$$-learning with graph networks learn a generalizable branching heuristic for a SAT solver? In: Proceedings of the 34th International Conference on Neural Information Processing Systems, NeurIPS 2020, pp. 9608\u20139621 (2019)"},{"key":"12_CR40","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/S1571-0653(04)00332-4","volume":"9","author":"MG Lagoudakis","year":"2001","unstructured":"Lagoudakis, M.G., Littman, M.L.: Learning to select branching rules in the DPLL procedure for satisfiability. Electron. Notes Discrete Math. 9, 344\u2013359 (2001)","journal-title":"Electron. Notes Discrete Math."},{"key":"12_CR41","unstructured":"Lederman, G., Rabe, M., Lee, E.A., Seshia, S.A.: Learning heuristics for quantified Boolean formulas through reinforcement learning. In: Proceedings of the 8th International Conference on Learning Representations, ICLR 2019, pp. 1\u201318 (2019)"},{"issue":"1\u20132","key":"12_CR42","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0004-3702(99)00097-1","volume":"116","author":"P Liberatore","year":"2000","unstructured":"Liberatore, P.: On the complexity of choosing the branching literal in DPLL. Artif. Intell. 116(1\u20132), 315\u2013326 (2000)","journal-title":"Artif. Intell."},{"issue":"1","key":"12_CR43","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/1119439.1119442","volume":"7","author":"P Liberatore","year":"2006","unstructured":"Liberatore, P.: Complexity results on DPLL and resolution. ACM Trans. Comput. Log. (TOCL) 7(1), 84\u2013107 (2006)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"12_CR44","unstructured":"Lobjois, L., Lema\u00eetre, M.: Branch and bound algorithm selection by performance prediction. In: Proceedings of the 15th National\/10th Conference on Artificial Intelligence, AAAI 1998, pp. 353\u2013358 (1998)"},{"key":"12_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-642-40627-0_36","volume-title":"Principles and Practice of Constraint Programming","author":"M Loth","year":"2013","unstructured":"Loth, M., Sebag, M., Hamadi, Y., Schoenauer, M.: Bandit-based search for constraint programming. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 464\u2013480. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_36"},{"key":"12_CR46","unstructured":"Maddison, C.J., Huang, A., Sutskever, I., Silver, D.: Move evaluation in Go using deep convolutional neural networks. arXiv preprint arXiv:1412.6564, pp. 1\u20138 (2014)"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference, DAC 2001, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"12_CR48","unstructured":"Nair, V., et al.: Solving mixed integer programs using neural networks. arXiv preprint arXiv:2012.13349, pp. 1\u201357 (2020)"},{"key":"12_CR49","doi-asserted-by":"crossref","unstructured":"Parsonson, C.W., Laterre, A., Barrett, T.D.: Reinforcement learning for branch-and-bound optimisation using retrospective trajectories. arXiv preprint arXiv:2205.14345 (2022)","DOI":"10.1609\/aaai.v37i4.25521"},{"key":"12_CR50","unstructured":"Paszke, A., et al.: PyTorch: an imperative style, high-performance deep learning library. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems, NeurIPS 2019, pp. 8024\u20138035 (2019)"},{"key":"12_CR51","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-23954-0_18","volume-title":"AI*IA 2011: Artificial Intelligence Around Man and Beyond","author":"A Previti","year":"2011","unstructured":"Previti, A., Ramanujan, R., Schaerf, M., Selman, B.: Monte-Carlo style UCT search for Boolean satisfiability. In: Pirrone, R., Sorbello, F. (eds.) AI*IA 2011. LNCS (LNAI), vol. 6934, pp. 177\u2013188. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23954-0_18"},{"issue":"4","key":"12_CR52","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1137\/0207038","volume":"7","author":"PW Purdom","year":"1978","unstructured":"Purdom, P.W.: Tree size by partial backtracking. SIAM J. Comput. 7(4), 481\u2013491 (1978)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"12_CR53","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10472-011-9258-6","volume":"61","author":"CD Rosin","year":"2011","unstructured":"Rosin, C.D.: Multi-armed bandits with episode context. Ann. Math. Artif. Intell. 61(3), 203\u2013230 (2011)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"12_CR54","first-page":"139","volume":"7","author":"O Roussel","year":"2011","unstructured":"Roussel, O.: Controlling a solver execution with the runsolver tool. J. Satisf. Boolean Model. Comput. 7(4), 139\u2013144 (2011)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"12_CR55","unstructured":"Ryvchin, V., Nadel, A.: Maple_LCM_Dist_ChronoBT: featuring chronological backtracking. In: Proceedings of SAT Competition 2018\u2014Solver and Benchmark Descriptions, vol. B-2018-1, p.\u00a029. Department of Computer Science Series of Publications B (2018)"},{"key":"12_CR56","first-page":"18514","volume":"35","author":"L Scavuzzo","year":"2022","unstructured":"Scavuzzo, L., et al.: Learning to branch with tree MDPs. Adv. Neural. Inf. Process. Syst. 35, 18514\u201318526 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"12_CR57","unstructured":"Schloeter, J.: A Monte Carlo tree search based conflict-driven clause learning SAT solver. In: Proceedings of the 2017 INFORMATIK Conference, INFORMATIK 2017, pp. 2549\u20132560 (2017)"},{"issue":"7839","key":"12_CR58","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1038\/s41586-020-03051-4","volume":"588","author":"J Schrittwieser","year":"2020","unstructured":"Schrittwieser, J., Antonoglou, I., Hubert, T., et al.: Mastering Atari, Go, chess and shogi by planning with a learned model. Nature 588(7839), 604\u2013609 (2020)","journal-title":"Nature"},{"key":"12_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-24258-9_24","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"D Selsam","year":"2019","unstructured":"Selsam, D., Bj\u00f8rner, N.: Guiding high-performance SAT solvers with Unsat-core predictions. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 336\u2013353. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_24"},{"key":"12_CR60","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., Huang, A., Maddison, C.J., et al.: Mastering the game of Go with deep neural networks and tree search. Nature 529, 484\u2013489 (2016)","journal-title":"Nature"},{"issue":"6419","key":"12_CR61","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1126\/science.aar6404","volume":"362","author":"D Silver","year":"2018","unstructured":"Silver, D., Hubert, T., Schrittwieser, J., et al.: A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play. Science 362(6419), 1140\u20131144 (2018)","journal-title":"Science"},{"key":"12_CR62","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1038\/nature24270","volume":"550","author":"D Silver","year":"2017","unstructured":"Silver, D., Schrittwieser, J., Simonyan, K., et al.: Mastering the game of Go without human knowledge. Nature 550, 354\u2013359 (2017)","journal-title":"Nature"},{"key":"12_CR63","doi-asserted-by":"publisher","first-page":"104603","DOI":"10.1016\/j.engappai.2021.104603","volume":"109","author":"W Song","year":"2022","unstructured":"Song, W., Cao, Z., Zhang, J., Xu, C., Lim, A.: Learning variable ordering heuristics for solving constraint satisfaction problems. Eng. Appl. Artif. Intell. 109, 104603 (2022)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"12_CR64","doi-asserted-by":"crossref","unstructured":"Spence, I.: sgen1: A generator of small but difficult satisfiability benchmarks. ACM J. Exp. Algorithmics 15, 1.1\u20131.15 (2010)","DOI":"10.1145\/1671970.1671972"},{"key":"12_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-87559-8_11","volume-title":"Artificial Neural Networks - ICANN 2008","author":"I Sutskever","year":"2008","unstructured":"Sutskever, I., Nair, V.: Mimicking Go experts with convolutional neural networks. In: K\u016frkov\u00e1, V., Neruda, R., Koutn\u00edk, J. (eds.) ICANN 2008. LNCS, vol. 5164, pp. 101\u2013110. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87559-8_11"},{"key":"12_CR66","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2018)"},{"key":"12_CR67","doi-asserted-by":"crossref","unstructured":"T\u00f6nshoff, J., Kisin, B., Lindner, J., Grohe, M.: One model, any CSP: graph neural networks as fast global search heuristics for constraint satisfaction. arXiv preprint arXiv:2208.10227, pp. 1\u201323 (2022)","DOI":"10.24963\/ijcai.2023\/476"},{"key":"12_CR68","doi-asserted-by":"crossref","unstructured":"Vaezipoor, P., et al.: Learning branching heuristics for propositional model counting. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence, AAAI 2021, pp. 12427\u201312435 (2021)","DOI":"10.1609\/aaai.v35i14.17474"},{"key":"12_CR69","unstructured":"Wang, W., Hu, Y., Tiwari, M., Khurshid, S., McMillan, K., Miikkulainen, R.: NeuroComb: improving sat solving with graph neural networks (2022)"},{"key":"12_CR70","unstructured":"Yolcu, E., P\u00f3czos, B.: Learning local search heuristics for Boolean satisfiability. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems, NeurIPS 2019, pp. 7992\u20138003 (2019)"},{"key":"12_CR71","unstructured":"Zook, A., Harrison, B., Riedl, M.O.: Monte-Carlo tree search for simulation-based strategy analysis. arXiv preprint arXiv:1908.01423, pp. 1\u20139 (2019)"}],"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-60597-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:05:57Z","timestamp":1716818757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60597-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031605963","9783031605970"],"references-count":71,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60597-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","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":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}