Abstract
In this paper we perform a preliminary investigation into the application of sampling-based search algorithms to satisfiability testing of propositional formulas in Conjunctive Normal Form (CNF). In particular, we adapt the Upper Confidence bounds applied to Trees (UCT) algorithm [5] which has been successfully used in many game playing programs including MoGo, one of the strongest computer Go players [3]. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Previti, A., Ramanujan, R., Schaerf, M., & Selman, B. (2011). Applying UCT to Boolean satisfiability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6695 LNCS, pp. 373–374). https://doi.org/10.1007/978-3-642-21581-0_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
