Term partitions and minimal generalizations of clauses
January 1991
Research Paper
| Related Files |
|---|
View PDF Version
(eur-few-cs-91-01.pdf, 0.1MB) |
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.
Keywords
Automatically Extracted Terms
- partition
- clause
- occurrence
- block
- substitution
- position
- theorem
- clause c
- subset
- term occurrences
- subterm
- subset t
- generalization
- subterm occurrence
- notice
- domain
- condition
- term partitions
- subterm occurrences
- mapping
