Using deep learning to construct stochastic local search SAT solvers with performance bounds.
Maximilian KramerPaul BoesPublished in: CoRR (2023)
Keyphrases
- deep learning
- stochastic local search
- sat solvers
- max sat
- sat instances
- sat problem
- propositional satisfiability
- lower bound
- random sat instances
- orders of magnitude
- boolean satisfiability
- upper bound
- solving hard
- unsupervised learning
- constraint satisfaction
- satisfiability problem
- machine learning
- search strategies
- search space
- search tree
- mental models
- randomly generated
- davis putnam
- search algorithm
- tabu search
- np complete
- boolean formula
- knowledge representation
- language model
- linear programming
- cnf formula
- branch and bound
- knowledge base
- bayesian networks
- reinforcement learning
- clause learning
- automated reasoning
- phase transition