Extraction of Design Patterns from Evolutionary Algorithms Using Case-Based Reasoning

In this paper we show a scheme based on case-based reasoning to extract design patterns from a genetic algorithm used to optimize combinational circuits at the gate-level. The approach is able to rediscover several of the traditional Boolean rules used for circuit simplification and it also finds new simplification rules. Also, we illustrate how the approach can be used to reduce convergence times of a genetic algorithm using previously found solutions as cases to solve similar problems.