Finding hardness reductions automatically using SAT solvers.
Helena BergoldManfred ScheucherFelix SchröderPublished in: CoRR (2024)
Keyphrases
- sat solvers
- orders of magnitude
- sat solving
- constraint satisfaction
- sat problem
- propositional satisfiability
- max sat
- sat instances
- search space
- search strategies
- clause learning
- boolean satisfiability
- search tree
- np complete
- phase transition
- weighted max sat
- clause learning sat solvers
- randomly generated
- stochastic local search
- information retrieval
- constraint satisfaction problems
- reinforcement learning