{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:14:29Z","timestamp":1759032869265,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642239533"},{"type":"electronic","value":"9783642239540"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23954-0_18","type":"book-chapter","created":{"date-parts":[[2011,9,11]],"date-time":"2011-09-11T00:30:34Z","timestamp":1315701034000},"page":"177-188","source":"Crossref","is-referenced-by-count":8,"title":["Monte-Carlo Style UCT Search for Boolean Satisfiability"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Previti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghuram","family":"Ramanujan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Selman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-45578-7_9","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"A. Aguirre","year":"2001","unstructured":"Aguirre, A., Vardi, M.Y.: Random 3-SAT and BDDs: The plot thickens further. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 121\u2013136. Springer, Heidelberg (2001)"},{"issue":"2","key":"18_CR2","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. Machine Learning\u00a047(2), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2003","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM Journal on Computing\u00a032(1), 48\u201377 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10998-010-3055-6","volume":"61","author":"P. Auer","year":"2010","unstructured":"Auer, P., Ortner, R.: UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem. Periodica Mathematica Hungarica\u00a061(1), 55\u201365 (2010)","journal-title":"Periodica Mathematica Hungarica"},{"key":"18_CR5","unstructured":"Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified boolean formulae. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI 1998), pp. 263\u2013267 (1998)"},{"issue":"2","key":"18_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1015019416843","volume":"28","author":"M. Cadoli","year":"2002","unstructured":"Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M.: An algorithm to evaluate quantified boolean formulae and its experimental evaluation. Journal of Automated Reasoning\u00a028(2), 101\u2013142 (2002)","journal-title":"Journal of Automated Reasoning"},{"issue":"3","key":"18_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1025671026963","volume":"8","author":"C. Coarfa","year":"2003","unstructured":"Coarfa, C., Demopoulos, D.D., San Miguel Aguirre, A., Subramanian, D., Vardi, M.Y.: Random 3-SAT: The plot thickens. Constraints\u00a08(3), 243\u2013261 (2003)","journal-title":"Constraints"},{"issue":"7","key":"18_CR8","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. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/1273496.1273531","volume-title":"Proceedings of the 24th International Conference on Machine Learning","author":"S. Gelly","year":"2007","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: Proceedings of the 24th International Conference on Machine Learning, pp. 273\u2013280. ACM, New York (2007)"},{"key":"18_CR11","first-page":"283","volume-title":"Frontiers in Artificial Intelligence and Applications","author":"H.H. Hoos","year":"2000","unstructured":"Hoos, H.H., St\u00fctzle, T.: SAT20000: Highlights of Satisfiability Research in the year 2000, chapter SATLIB: An Online Resource for Research on SAT. In: Frontiers in Artificial Intelligence and Applications, pp. 283\u2013292. Kluwer Academic, Dordrecht (2000), Web site available at: http:\/\/www.cs.ubc.ca\/~hoos\/SATLIB\/index-ubc.html"},{"key":"18_CR12","series-title":"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.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-10291-2_9","volume-title":"AI*IA 2009: Emergent Perspectives in Artificial Intelligence","author":"M. Lombardi","year":"2009","unstructured":"Lombardi, M., Milano, M., Roli, A., Zanarini, A.: Deriving information from sampling and diving. In: Serra, R., Cucchiara, R. (eds.) AI*IA 2009. LNCS, vol.\u00a05883, pp. 82\u201391. Springer, Heidelberg (2009)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a06695, pp. 373\u2013374. Springer, Heidelberg (2011)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Local search strategies for satisfiability testing. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Citeseer (1996)","DOI":"10.1090\/dimacs\/026\/25"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Y., Gelly, S.: Modifications of UCT and sequence-like simulations for Monte-Carlo Go. In: IEEE Symposium on Computational Intelligence and Games, Honolulu, Hawaii, pp. 175\u2013182 (2007)","DOI":"10.1109\/CIG.2007.368095"},{"issue":"1","key":"18_CR17","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L. Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research\u00a032(1), 565\u2013606 (2008)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2011: Artificial Intelligence Around Man and Beyond"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23954-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,4]],"date-time":"2021-12-04T09:05:14Z","timestamp":1638608714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23954-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239533","9783642239540"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23954-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}