Towards a Complexity-theoretic Understanding of Restarts in SAT solvers.

Chunxiao Li Noah Fleming Marc Vinyals Toniann Pitassi Vijay Ganesh

Published in: CoRR (2020)

Keyphrases

sat solvers
clause learning
complexity theoretic
propositional satisfiability
orders of magnitude
search space
max sat
sat problem
search strategies
sat instances
constraint satisfaction
consistent query answering
prime implicates
constraint programming
objective function
boolean formula
search algorithm