In this paper we investigate the use of Artificial Immune Systems' principles to cope with the
satisfiability problem. We describe ClonSAT, a new iterative approach for solving the well …

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 …

This paper introduces an adaptive heuristic-based evolutionary algorithm for the
Satisfiability problem (SAT). The algorithm uses information about the best solutions found in …

We present in this paper a new memetic algorithm to deal with the Max Sat problem. The
objective is to find the best assignment for a set of Boolean variables, which gives the …

This paper introduces a hybrid genetic algorithm for the satisfiability problem (SAT). This
algorithm, called GASAT, incorporates local search within the genetic framework. GASAT …

This paper introduces the ant colonies approach for the maximum weighted satisfiability
problem, namely MAX-W-SAT. We describe an ant colonies algorithm for MAX-W-SAT called …

The recent evolutionary approach called scatter search is studied for solving the satisfiability
problem designated by SAT and its weighted version MAX-W-SAT. It is a population-based …

This paper presents GASAT, a hybrid evolutionary algorithm for the satisfiability problem
(SAT). A specific crossover operator generates new solutions, that are improved by a tabu …

Solving NP-complete problems is one of the most important research areas nowadays.
Several studies have been held to shed the light on these complex problems and on the …

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