Term partitions and minimal generalizations of clauses
Term occurrences of any clause C are determined by their positions. The set of all term partitions defined on subsets of term occurrences of C form a partially ordered set. This poset is isomorphic to the set of all generalizations of C. The structure of this poset can be inferred from the term occurrences in C alone. We can apply these constructions in this poset in machine learning.