Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.
Takayuki SakaiKazuhisa SetoSuguru TamakiPublished in: Theory Comput. Syst. (2015)
Keyphrases
- weighted max sat
- max sat
- stochastic local search
- random sat instances
- search algorithm
- graph coloring
- np complete problems
- maximum satisfiability
- sat solvers
- sat problem
- sat instances
- max sat solver
- branch and bound algorithm
- finding optimal solutions
- branch and bound
- random sat
- tabu search
- propositional satisfiability
- satisfiability problem
- lower bound
- boolean satisfiability
- randomly generated
- constraint satisfaction
- boolean formula
- linear programming
- variable ordering
- exact algorithms
- cnf formula
- cost function
- constraint satisfaction problems
- search space
- heuristic search
- hill climbing
- optimal solution
- reinforcement learning