Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT.
Dave A. D. TompkinsHolger H. HoosPublished in: Canadian Conference on AI (2003)
Keyphrases
- max sat
- tabu search
- search algorithm
- stochastic local search
- lower bound
- branch and bound algorithm
- weighted max sat
- guided local search
- sat solvers
- random sat instances
- satisfiability problem
- branch and bound
- sat problem
- propositional satisfiability
- bayesian networks
- simulated annealing
- maximum satisfiability
- metaheuristic
- search space
- boolean satisfiability
- unsatisfiable cores
- max sat solver
- search procedure
- search strategies
- constraint satisfaction
- orders of magnitude
- upper bound
- constraint satisfaction problems
- probabilistic model
- optimal solution
- genetic algorithm
- conditional probabilities
- state space