H. Dicky
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
H. Dicky has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Marianne Huchard
LIRMM Univ. Montpellier CNRS Montpellier France
1 shared publication
Latest Publications
- Open Access
- 1 November 2000
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 34 (6) , 521-548
Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
In the context of object-oriented systems, algorithms for building class hierarchies are currently receiving much attention. We present here a characterization of several global algorithms. A global algorithm is one which starts with only the set of classes (provided with all their properties) and directly builds the hierarchy. The algorithms scrutinized were developped each in a different framework. In this survey, they are explained in a single framework, which takes advantage of a substructure of the Galois lattice associated with the binary relation mapping the classes to their properties. Their characterization allows to figure the results of the algorithms without running them in simple cases. This study once again highlights the Galois lattice as a main and intuitive model for class hierarchies.
- 1 November 2000
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 34 (6) , 521-548
Open AccessGalois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
In the context of object-oriented systems, algorithms for building class hierarchies are currently receiving much attention. We present here a characterization of several global algorithms. A global algorithm is one which starts with only the set of classes (provided with all their properties) and directly builds the hierarchy. The algorithms scrutinized were developped each in a different framework. In this survey, they are explained in a single framework, which takes advantage of a substructure of the Galois lattice associated with the binary relation mapping the classes to their properties. Their characterization allows to figure the results of the algorithms without running them in simple cases. This study once again highlights the Galois lattice as a main and intuitive model for class hierarchies.