Flattening and Saturation: Two Representation Changes for Generalization

摘要

Two representation changes are presented: the first one, called flattening, transforms a first-order logic program with function symbols into an equivalent logic program without function symbols; the second one, called saturation, completes an example description with relevant information with respect to both the example and available background knowledge. The properties of these two represenlation changes are analyzed as well as their influence on a generalization algorithm that takes a single example as input.