Applying UCT to Boolean satisfiability

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

Volumn 6695 LNCS, Issue , 2011, Pages 373-374

  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; COMPUTER GO; CONJUNCTIVE NORMAL FORMS; GAME-PLAYING PROGRAMS; PROPOSITIONAL FORMULAS; SAMPLING-BASED; SATISFIABILITY TESTING; SEARCH ALGORITHMS; UPPER CONFIDENCE BOUND;

BOOLEAN FUNCTIONS; TREES (MATHEMATICS);

ALGORITHMS;

EID: 79959454573     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21581-0_35     Document Type: Conference Paper

References (6)

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)
2. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7), 394-397 (1962)
3. Gelly, S., Silver, D.: Achieving master level play in 9 x 9 computer go. In: Fox, D., Gomes, C.P. (eds.) AAAI, pp. 1537-1540. AAAI Press, Menlo Park (2008)
4. Hoos, H.H., Stützle, T.: SATLIB: An Online Resource for Research on SAT 2000: Highlights of Satisfiability Research in the year 2000. In: Frontiers in Artificial Intelligence and Applications, pp. 283-292. Kluwer Academic, Dordrecht (2000), http://www.cs.ubc.ca/~hoos/SATLIB/index-ubc.html
5. 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)
6. 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)