Monte-Carlo style UCT search for boolean satisfiability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6934 LNAI, Issue , 2011, Pages 177-188

  Previti, Alessandro ^a   Ramanujan, Raghuram ^b   Schaerf, Marco ^a   Selman, Bart ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN SATISFIABILITY; BREADTH-FIRST SEARCH; CNF FORMULAS; CONFIDENCE BOUNDS; DEPTH FIRST SEARCH; DPLL-BASED ALGORITHMS; EVALUATION FUNCTION; MONTE CARLO; PERFORMANCE MEASURE; SATISFIABILITY;

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; PLANT EXTRACTS; TREES (MATHEMATICS); FORESTRY; ITERATIVE METHODS;

ALGORITHMS;

EID: 80053029171     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23954-0_18     Document Type: Conference Paper

References (17)

1. Aguirre, A., Vardi, M.Y.: Random 3-SAT and BDDs: The plot thickens further. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 121-136. Springer, Heidelberg (2001) (Pubitemid 33371071)
2. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2), 235-256 (2002) (Pubitemid 34126111)
3. Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM Journal on Computing 32(1), 48-77 (2003)
4. Auer, P., Ortner, R.: UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem. Periodica Mathematica Hungarica 61(1), 55-65 (2010)
5. 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-267 (1998)
6. Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M.: An algorithm to evaluate quantified boolean formulae and its experimental evaluation. Journal of Automated Reasoning 28(2), 101-142 (2002) (Pubitemid 34459695)
7. Coarfa, C., Demopoulos, D.D., San Miguel Aguirre, A., Subramanian, D., Vardi, M.Y.: Random 3-SAT: The plot thickens. Constraints 8(3), 243-261 (2003)
8. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7), 394-397 (1962)
9. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201-215 (1960)
10. Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: Proceedings of the 24th International Conference on Machine Learning, pp. 273-280. ACM, New York (2007)
11. Hoos, H.H., Stützle, 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-292. Kluwer Academic, Dordrecht (2000), Web site available at: http://www.cs.ubc.ca/ ~hoos/SATLIB/index-ubc.html
12. Kocsis, L., Szepesvári, C.: Bandit based monte-carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282-293. Springer, Heidelberg (2006) (Pubitemid 44618839)
13. *IA 2009. LNCS, vol. 5883, pp. 82-91. Springer, Heidelberg (2009)
14. 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-374. Springer, Heidelberg (2011)
15. 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)
16. Wang, Y., Gelly, S.: Modifications of UCT and sequence-like simulations for MonteCarlo Go. In: IEEE Symposium on Computational Intelligence and Games, Honolulu, Hawaii, pp. 175-182 (2007) (Pubitemid 47431300)
17. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research 32(1), 565-606 (2008)