A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers.
Shuolin LiChu-Min LiMao LuoJordi CollDjamal HabetFelip ManyàPublished in: IJCAI (2023)
Keyphrases
- variable ordering
- sat solvers
- max sat
- propositional satisfiability
- variable elimination
- orders of magnitude
- constraint satisfaction
- sat problem
- branch and bound algorithm
- sat instances
- probabilistic inference
- lower bound
- propositional logic
- inference in bayesian networks
- industrial applications
- bayesian networks
- search space
- tabu search
- search strategies
- satisfiability problem
- search algorithm
- branch and bound
- automated reasoning
- constraint programming
- search tree
- belief networks
- linear programming
- stochastic local search
- clause learning
- data structure