|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
This paper introduces an adaptive heuristic-based evolutionary algorithm for the Satisfiability problem (SAT). The algorithm uses information about the best solutions found in the recent past in order to dynamically adapt the search strategy. Extensive experiments on standard benchmark problems are performed in order to asses the effectiveness of the algorithm. The results of the experiments indicate that this technique is rather successful: it improves on previous approaches based on evolutionary computation and it is competitive with the best heuristic algorithms for SAT.
(*) Copyright notice - Permission to make digital or hard copies of
all or part of this work for personal or classroom use is granted without
fee provided that copies are not made or distributed for profit or commercial
advantage and that copies bear this notice and the full citation on the
first page. To copy other wise, to republish, to post on servers or to
redistribute to lists, requires prior specific permission and/or a fee.
SAC 2000 Como, Italy
Copyrigth 2000 ACM 0-89791-88-6/97/05 .. $5.00