Logical evolution method for learning Boolean functions

In this paper, we present a new learning algorithm, referred to as the logical evolution (LE) method. To learn a Boolean function, the LE method uses not only new information in the given training examples but also old information learned in the past. By using only one network to learn many functions, old information can be re-used for learning new problems efficiently. In this paper, we present the network structure and the learning algorithm of LE and analyse its properties. Its learning capability is also shown by means of two experiments