Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT.
Zhendong LeiShaowei CaiPublished in: IJCAI (2018)
Keyphrases
- combinatorial optimization
- stochastic local search
- sat solvers
- sat solving
- search algorithm
- boolean optimization
- boolean satisfiability
- sat problem
- propositional satisfiability
- solving hard
- random sat instances
- satisfiability problem
- simulated annealing
- dynamic environments
- search space
- traveling salesman problem
- systematic search
- genetic algorithm
- maximum satisfiability
- satisfiability testing
- max sat
- search heuristics
- sat instances
- ant colony optimization
- boolean formula
- np complete problems
- sat encodings
- search procedures
- randomly generated
- branch and bound algorithm
- optimization problems
- evolutionary algorithm
- optimal solution