Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems.

Published in: Appl. Soft Comput. (2010)

Keyphrases

satisfiability problem
search algorithm
search algorithms for solving
np complete
phase transition
temporal logic
genetic algorithm
sat problem
heuristic search
branch and bound
mazurkiewicz traces
stochastic local search
sat instances
search space
search strategy
max sat
model checking
tabu search
lower bound