Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper).
Shaowei CaiChuan LuoXindi ZhangJian ZhangPublished in: CP (2021)
Keyphrases
- unit propagation
- conjunctive normal form
- propositional satisfiability
- sat solvers
- max sat
- search algorithm
- search tree
- satisfiability problem
- stochastic local search
- sat problem
- davis putnam
- cnf formula
- clause learning
- sat encodings
- boolean formula
- search space
- propositional formulas
- tabu search
- truth values
- industrial applications
- constraint programming
- automated reasoning
- search strategies
- constraint satisfaction
- variable ordering
- polynomial size
- orders of magnitude
- boolean satisfiability
- optimal solution
- branch and bound algorithm
- np complete
- simulated annealing
- genetic algorithm
- job shop scheduling problem
- memetic algorithm
- phase transition
- domain independent
- lower bound