Breeding Algebraic Structures – An Evolutionary Approach to Inductive Equational Logic Programming

Concept learning is the induction of a de-scription from a set of examples. Inductive logic programming can be considered a spe-cial case of the general notion of concept learning specifically referring to the induction of first-order theories. Both concept learn-ing and inductive logic programming can be seen as a search over all possible sentences in some representation language for sentences that correctly explain the examples and also generalize to other sentences that are part of that concept. In this paper we explore in-ductive logic programming with equational logic as the representation language and ge-netic programming as the underlying search paradigm. Equational logic is the logic of substituting equals for equals with algebras as models and term rewriting as operational semantics.