Diversify Intensification Phases in Local Search for SAT with a New Probability Distribution.
Thach-Thao DuongDuc Nghia PhamAbdul SattarPublished in: Australasian Conference on Artificial Intelligence (2013)
Keyphrases
- probability distribution
- tabu search
- stochastic local search
- search strategies
- search algorithm
- propositional satisfiability
- max sat
- search procedure
- satisfiability testing
- search procedures
- sat solvers
- simulated annealing
- random variables
- memetic algorithm
- satisfiability problem
- search space
- sat solving
- sat problem
- bayesian networks
- metaheuristic
- search strategy
- propositional logic
- job shop scheduling problem
- hybrid algorithm
- genetic algorithm
- boolean satisfiability
- scheduling problem
- conditional independence
- posterior probability
- constraint programming
- vehicle routing problem
- random sat instances
- hybrid ga
- systematic search
- variable ordering
- sat instances
- combinatorial optimization
- global search
- phase transition
- evolutionary algorithm
- neighborhood search
- np complete
- branch and bound
- optimal solution
- heuristic search
- maximum satisfiability
- hill climbing