Login / Signup
Using Gate Recognition and Random Simulation for Under-Approximation and Optimized Branching in SAT Solvers.
Markus Iser
Felix Kutzner
Carsten Sinz
Published in:
ICTAI (2017)
Keyphrases
</>
sat solvers
search tree
max sat
orders of magnitude
search space
propositional satisfiability
sat solving
constraint satisfaction
boolean satisfiability
sat problem
sat instances
branch and bound
search strategies
boolean formula
weighted max sat
evolutionary algorithm
reinforcement learning