{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T23:56:29Z","timestamp":1794527789620,"version":"4.9.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_17","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"251-267","source":"Crossref","is-referenced-by-count":10,"title":["Monte-Carlo Tree Search for the Maximum Satisfiability Problem"],"prefix":"10.1007","author":[{"given":"Jack","family":"Goffinet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raghuram","family":"Ramanujan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"issue":"2\u20133","key":"17_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2\u20133), 235\u2013256 (2002). doi: 10.1023\/A:1013689704352","journal-title":"Mach. Learn."},{"key":"17_CR2","unstructured":"Balla, R.K., Fern, A.: UCT for tactical assault planning in real-time strategy games. In: Proceedings of the 21st International Joint Conference on Artifical Intelligence, IJCAI 2009, pp. 40\u201345. Morgan Kaufmann Publishers Inc., San Francisco (2009). http:\/\/dl.acm.org\/citation.cfm?id=1661445.1661453"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1613\/jair.3484","volume":"43","author":"SRK Branavan","year":"2012","unstructured":"Branavan, S.R.K., Silver, D., Barzilay, R.: Learning to win by reading manuals in a Monte-Carlo framework. J. Artif. Intell. Res. (JAIR) 43, 661\u2013704 (2012). doi: 10.1613\/jair.3484","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","volume":"204","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K.: Local search for boolean satisfiability with configuration checking and subscore. Artif. Intell. 204, 75\u201398 (2013). doi: 10.1016\/j.artint.2013.09.001","journal-title":"Artif. Intell."},{"issue":"11","key":"17_CR5","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1016\/j.artint.2010.04.017","volume":"174","author":"P Ciancarini","year":"2010","unstructured":"Ciancarini, P., Favini, G.P.: Monte carlo tree search in Kriegspiel. Artif. Intell. 174(11), 670\u2013684 (2010). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0004370210000536","journal-title":"Artif. Intell."},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"17_CR7","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation-based approach to general game playing. In: Proceedings of the 23rd National Conference on Artificial Intelligence, vol. 1, AAAI 2008, pp. 259\u2013264. AAAI Press (2008). http:\/\/dl.acm.org\/citation.cfm?id=1619995.1620038"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: Proceedings of the 24th International Conference on Machine Learning, ICML 2007, NY, USA, pp. 273\u2013280 (2007). http:\/\/doi.acm.org\/10.1145\/1273496.1273531","DOI":"10.1145\/1273496.1273531"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/3-540-46135-3_12","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"D Habet","year":"2002","unstructured":"Habet, D., Li, C.-M., Devendeville, L., Vasquez, M.: A hybrid approach for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 172\u2013184. Springer, Heidelberg (2002)"},{"key":"17_CR10","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H Hoos","year":"2004","unstructured":"Hoos, H., Sttzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann Publishers Inc., San Francisco (2004)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/3-540-48238-5_25","volume-title":"KI-99: Advances in Artificial Intelligence","author":"H H. Hoos","year":"1999","unstructured":"H. Hoos, H., St\u00fctzle, T.: Systematic vs. local search for SAT. In: Burgard, W., Christaller, T., Cremers, A.B. (eds.) KI 1999. LNCS (LNAI), vol. 1701, pp. 289\u2013293. Springer, Heidelberg (1999)"},{"key":"17_CR12","unstructured":"Keller, T., Eyerich, P.: PROST: probabilistic planning based on UCT. In: McCluskey, L., Williams, B., Silva, J.R., Bonet, B. (eds.) Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012, Atibaia, S\u00e3o Paulo, Brazil, 25\u201329 June 2012. AAAI (2012). http:\/\/www.aaai.org\/ocs\/index.php\/ICAPS\/ICAPS12\/paper\/view\/4715"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","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)"},{"key":"17_CR14","unstructured":"Kroc, L., Sabharwal, A., Gomes, C.P., Selman, B.: Integrating systematic and local search paradigms: a new strategy for maxsat. In: Boutilier, C. (ed.) IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11\u201317 July 2009, pp. 544\u2013551 (2009) http:\/\/ijcai.org\/papers09\/Papers\/IJCAI09-097.pdf"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"7","key":"17_CR16","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1109\/TC.2014.2346196","volume":"64","author":"C Luo","year":"2015","unstructured":"Luo, C., Cai, S., Wu, W., Jie, Z., Su, K.: CCLS: an efficient local search algorithm for weighted maximum satisfiability. IEEE Trans. Comput. 64(7), 1830\u20131843 (2015)","journal-title":"IEEE Trans. Comput."},{"issue":"3\u20134","key":"17_CR17","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018999721141","volume":"22","author":"B Mazure","year":"1998","unstructured":"Mazure, B., Sa\u00efs, L., Gr\u00e9goire, E.: Boosting complete techniques thanks to local search methods. Ann. Math. Artif. Intell. 22(3\u20134), 319\u2013331 (1998). doi: 10.1023\/A:1018999721141","journal-title":"Ann. Math. Artif. Intell."},{"key":"17_CR18","unstructured":"McAllester, D., Selman, B., Kautz, H.: Evidence for invariants in local search. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Conference on Innovative Applications of Artificial Intelligence, AAAI 1997\/IAAI 1997, pp. 321\u2013326. AAAI Press (1997). http:\/\/dl.acm.org\/citation.cfm?id=1867406.1867456"},{"issue":"4","key":"17_CR19","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/s10601-013-9146-2","volume":"18","author":"A Morgado","year":"2013","unstructured":"Morgado, A., Heras, F., Liffiton, M., Planes, J., Marques-Silva, J.: Iterative and core-guided maxsat solving: a survey and assessment. Constraints 18(4), 478\u2013534 (2013)","journal-title":"Constraints"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-3-642-21581-0_35","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"A Previti","year":"2011","unstructured":"Previti, A., Ramanujan, R., Schaerf, M., Selman, B.: Applying UCT to boolean satisfiability. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 373\u2013374. Springer, Heidelberg (2011)"},{"key":"17_CR21","unstructured":"Ramanujan, R., Selman, B.: Trade-offs in sampling-based adversarial planning. In: Bacchus, F., Domshlak, C., Edelkamp, S., Helmert, M. (eds.) Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany, 11\u201316 June 2011. AAAI (2011). http:\/\/aaai.org\/ocs\/index.php\/ICAPS\/ICAPS11\/paper\/view\/2708"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/978-3-642-29828-8_23","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"A Sabharwal","year":"2012","unstructured":"Sabharwal, A., Samulowitz, H., Reddy, C.: Guiding combinatorial optimization with UCT. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 356\u2013361. Springer, Heidelberg (2012)"},{"key":"17_CR23","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Hayes-Roth, B., Korf, R.E. (eds.) Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, 31 July - 4 August 1994, vol. 1, pp. 337\u2013343. AAAI Press\/The MIT Press (1994). http:\/\/www.aaai.org\/Library\/AAAI\/1994\/aaai94-051.php"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-48159-1_5","volume-title":"Progress in Artificial Intelligence","author":"J Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.: The impact of branching heuristics in propositional satisfiability algorithms. In: Barahona, P., Alferes, J.J. (eds.) EPIA 1999. LNCS (LNAI), vol. 1695, pp. 62\u201374. Springer, Heidelberg (1999)"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Silver, D., Tesauro, G.: Monte-carlo simulation balancing. In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, NY, USA, pp. 945\u2013952 (2009). http:\/\/doi.acm.org\/10.1145\/1553374.1553495","DOI":"10.1145\/1553374.1553495"},{"key":"17_CR26","unstructured":"Silver, D., Veness, J.: Monte-Carlo planning in large POMDPS. In: Lafferty, J.D., Williams, C.K.I., Shawe-Taylor, J., Zemel, R.S., Culotta, A. (eds.) Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, Proceedings of a Meeting Held 6\u20139 December 2010, Vancouver, British Columbia, Canada, pp. 2164\u20132172. Curran Associates, Inc. (2010). http:\/\/papers.nips.cc\/paper\/4031-monte-carlo-planning-in-large-pomdps"},{"key":"17_CR27","volume-title":"Introduction to Reinforcement Learning","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Introduction to Reinforcement Learning, 1st edn. MIT Press, Cambridge (1998)","edition":"1"},{"key":"17_CR28","unstructured":"Tompkins, D.A.D., Hoos, H.H.: UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT & MAX-SAT. In: SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10\u201313 May 2004, Vancouver, BC, Canada, Online Proceedings (2004). http:\/\/www.satisfiability.org\/SAT04\/programme\/23.pdf"},{"key":"17_CR29","unstructured":"Zhang, W., Rangan, A., Looks, M.: Backbone guided local search for maximum satisfiability. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, IJCAI 2003, pp. 1179\u20131184. Morgan Kaufmann Publishers Inc., San Francisco (2003)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:07:51Z","timestamp":1498324071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}