Login / Signup
Applying UCT to Boolean Satisfiability.
Alessandro Previti
Raghuram Ramanujan
Marco Schaerf
Bart Selman
Published in:
SAT (2011)
Keyphrases
</>
boolean satisfiability
sat solvers
boolean optimization
probabilistic planning
branch and bound algorithm
sat solving
monte carlo
integer linear programming
maximum satisfiability
combinatorial problems
symmetry breaking
randomly generated
sat problem
max sat
sat instances
search tree
heuristic search
special case