Galois lattice as a framework to specify building class hierarchies algorithms

In the context of object-oriented systems, algorithms for building class hi erarchies are currently receiving much attention. We present here a charact erization of several global algorithms. A global algorithm is one which sta rts with only the set of classes (provided with all their properties) and d irectly builds the hierarchy. The algorithms scrutinized were developed eac h in a different framework. In this survey, they are explained in a single framework, which takes advantage of a substructure of the Galois lattice as sociated with the binary relation mapping the classes to their properties. Their characterization allows to figure the results of the algorithms witho ut running them in simple cases. This study once again highlights the Galoi s lattice as a main and intuitive model for class hierarchies.