Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.
Takayuki SakaiKazuhisa SetoSuguru TamakiPublished in: SAT (2014)
Keyphrases
- weighted max sat
- max sat
- stochastic local search
- random sat instances
- search algorithm
- maximum satisfiability
- sat solvers
- graph coloring
- sat instances
- sat problem
- max sat solver
- lower bound
- np complete problems
- variable ordering
- finding optimal solutions
- tabu search
- branch and bound
- boolean formula
- random sat
- boolean satisfiability
- propositional satisfiability
- satisfiability problem
- exact algorithms
- branch and bound algorithm
- np complete
- genetic algorithm
- constraint satisfaction
- cnf formula
- unsatisfiable cores
- orders of magnitude
- search space
- np hard
- randomly generated
- inference rules
- constraint satisfaction problems