Extracting and re-using design patterns from genetic algorithms using case-based reasoning

This paper proposes a scheme in which case-based reasoning techniques are employed to extract design patterns from a genetic algorithm used to optimize combinational circuits at the gate level. The approach seems to be able to (implicitly) rediscover several of the traditional Boolean rules used for circuit simplification and it also (implicitly) finds new simplification rules. Also, the paper illustrates how the approach can be used to reduce convergence times of a genetic algorithm using previously found solutions as cases to solve similar problems.