A Set-Theoretical Approach for the Induction of Inheritance Hierarchies
Wiebke Petersen · Electronic Notes in Theoretical Computer Science · 2004
An approach for the automatic construction of inheritance hierarchies is presented. It is based on the strict set-theoretical point of view in the mathematical theory of Formal Concept Analysis. The resulting hierarchies are concept lattices. An extension of the approach to the induction of nonmonotonic inheritance networks is also discussed. It turns out that the main ideas of Formal Concept Analysis, i.e. the formal context, the concept lattice and the set of implications, provide three different ways of looking at the data to be represented, each of which provides a different way to solve problems of knowledge representation.