The combination of evolutionary algorithms with local search was named" memetic
algorithms"(MAs)(Moscato, 1989). These methods are inspired by models of natural systems …

Several evolutionary algorithms have been proposed for the satisfiability problem. We
review the solution representations suggested in literature and choose the most promising …

Boolean satisfiability from theoretical hardness to practical success Page 1 76
communIcATIons of The Acm | auGuST 2009 | voL. 52 | no. 8 review articles DoI:10.1145/1536616.1536637 …

The development of successful metaheuristic algorithms such as local search for a difficult
problem such as satisfiability testing (SAT) is a challenging task. We investigate an …

The performance of an evolutionary algorithm strongly depends on the design of its
operators and on the management of these operators along the search; that is, on the ability …

We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP.
The aim is to obtain “disposable” heuristics which are evolved and used for a specific subset …

This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main
feature of GASAT is that it includes a recombination stage based on a specific crossover and …

Satisfiability (SAT) problem in engineering and computer science is to find the set of
assignment values of input variables for the given Boolean function that evaluate this …

Given a propositional Boolean formula, the problem of determining whether it can evaluate
to the value true is called the Boolean Satisfiability Problem, or SAT. SAT is one of the most …

A parallel hybrid method for solving the satisfiability (SAT) problem that combines cellular
genetic algorithms (GAs) and the random walk SAT (WSAT) strategy of greedy SAT (GSAT) …