Monte-Carlo Style UCT Search for Boolean Satisfiability


In this paper, we investigate the feasibility of applying algorithms based on the Uniform Confidence bounds applied to Trees [12] to the satisfiability of CNF formulas. We develop a new family of algorithms based on the idea of balancing exploitation (depth-first search) and exploration (breadth-first search), that can be combined with two different… (More)
DOI: 10.1007/978-3-642-23954-0_18

3 Figures and Tables


  • Presentations referencing similar topics