Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers.
Jiongzhi ZhengZhuo ChenChu-Min LiKun HePublished in: CoRR (2024)
Keyphrases
- pseudo boolean
- propositional satisfiability
- combinatorial problems
- sat solvers
- hard constraints
- integer linear programming
- combinatorial optimization
- constraint satisfaction problems
- pseudo boolean constraints
- symmetry breaking
- global constraints
- constraint satisfaction
- propositional logic
- constraint programming
- exact solution
- automated reasoning
- soft constraints
- industrial applications
- orders of magnitude
- unconstrained optimization
- penalty function
- search space
- boolean optimization
- metaheuristic
- traveling salesman problem
- boolean satisfiability
- sat problem
- graph coloring
- clause learning
- max sat
- stochastic local search
- sat solving
- optimal solution
- constraint propagation
- tabu search
- simulated annealing
- cost function
- search tree
- phase transition
- search algorithm
- genetic algorithm
- constrained optimization
- search heuristics
- knapsack problem
- branch and bound algorithm
- branch and bound
- heuristic search
- linear programming
- maximum satisfiability