OEA_SAT: An Organizational Evolutionary Algorithm for solving SATisfiability problems.
Jing LiuWenrong JiangWeicai ZhongLicheng JiaoPublished in: IEEE Congress on Evolutionary Computation (2009)
Keyphrases
- satisfiability problem
- evolutionary algorithm
- solving hard
- stochastic local search
- sat instances
- np complete
- sat problem
- davis putnam logemann loveland
- phase transition
- temporal logic
- search algorithm
- finite domain
- stochastic local search algorithms
- random sat
- pspace complete
- graph coloring problems
- davis putnam
- max sat
- optimization problems
- search problems
- weighted max sat
- propositional satisfiability
- search procedures
- genetic algorithm
- sat solvers
- simulated annealing
- graph coloring
- conjunctive normal form
- np hard
- lower bound
- optimal solution