Genetic algorithms in logic tree decision modeling

An important approach to decision modeling is the induction of knowledge structures – such as rules, trees, and graphs – from empirical data describing previous conditions and the resulting decisions. We examine here a specific knowledge structure, a logic tree, in which the conditions are leaves, the decision is the root, and the intermediate nodes are logical operators. We then use genetic algorithms (GAs) to construct logic trees that best represent the correspondence between conditions and decisions described by the empirical data. We also investigate an important characteristic of the GA search, the fitness distance correlation. Finally, we comment on the usefulness of GAs in knowledge modeling.