Robert Godin
- Bergstein91a P. Bergstein and K. J. Lieberherr, "Incremental class dictionary learning and optimization," in Proceedings of ECOOP'91, ed. Springer Verlag, pp. 377-395, Geneva, Swi~erland, 1991. Google Scholar
Digital Library
- Brachman85a Ronald J. Brachman and James G. Schmolze, "An Overview of the KL-ONE Knowledge Representation System," Cognitive Science, vol. 9, pp. 171-216, 1985.Google ScholarCross Ref
- Coad91a Peter Coad and Edward Yourdon, in Object- Oriented Analysis, Prentice Hall, 1991. second edition Google ScholarDigital Library
- Cook92a William R. Cook, "Interfaces and Specifications for the Smalltalk-80 Collection Classes," in Proceedings of OOPSLA'92, pp. 1-15, ACM Press, Vancouver, B.C., Canada, October 18-22, 1992. Google ScholarDigital Library
- Cox90a Brad J. Cox, "Planning the Software Revolution," IEEE Software, vol. 7(6), pp. 25-35, November 1990. Google ScholarDigital Library
- Ganter86a B. Ganter, J. Stahl, and R. Witle, "Conceptual Measurement and Many-Valued Contexts," in Classification as a Tool of Research, ed. M. Schader, pp. 169-176, North-Holland, Amsterdam, 1986.Google Scholar
- Gennari90a J. H. Gennari, P. Langley, and D. Fisher, "Models of Incremental Concept Formation," in Machine Learning: Paradigms and Methods, ed. J. Carbonell, pp. 11-62, MIT Press, Amsterdam, the Netherlands, 1990. Google ScholarDigital Library
- Gibbs90a S. Gibbs, D Tsichritzis, E. Casais, O. Nierstrasz, and X. Pintado, "Class Management for Software Communities," Communications of the ACM, vol. 33, no. 9, pp. 90-103, 1990. Google ScholarDigital Library
- Godin93a Robert Godin, Rokia Missaoui, and Alain April, "Experimental Comparison of Navigation in a Galois Lattice with Conventional Information Retrieval Methods," International Journal of Man-Machine Studies, 1993. To appear. Google ScholarDigital Library
- Godin86a R. Godin, E. Saunders, and J. Gecsei, "Lattice Models of Browsable Data Spaces," Journal of Information Sciences, vol. 40, pp. 89-116, 1986. Google ScholarDigital Library
- Godin91a R. Godin, R. Missaoui, and H. Alaoui, "Leaming Algorithms Using a Galois Lattice Structure," in Proceedings of the Third International Conference on Tools for Artificial Intelligence, pp. 22-29, IEEE Computer Society Press, San Jose, CA, 1991.Google Scholar
- Li89a Q. Li and D. McLeod, "Object Flavor Evolution in an Object-Oriented Database System," in Proceedings of the Second International Conference on Expert Database Systems, ed. L.Kershberg pp.469-495, Benjamin/Cummings, 1989.Google Scholar
- Lipkis82a Thomas A. Lipkis, "A KL-ONE Classifier," in Proceedings of the 1981 KL-ONE Workshop, ed. J.G. Schmolze & R. J. Brachman, pp. 128-145, Bolt Beraneck and Newman, Inc., June, 1982.Google Scholar
- Meyer88a Bertrand Meyer, in Object-Oriented Software Construction, ed. Prentice-Hall Intemational, 1988. Google ScholarDigital Library
- Mili92b Ali Mili, Noureddine Boudrigua, and Fathi Elloumi, "The Lattice of Specifications: Applications to a Specification Methodology," Formal Aspects of Computing, Springer-Verlag, 1992. to appearGoogle Scholar
- Mili90a Hafedh Mili, John Sibert, and Yoav Intrator, "An Object-Oriented Model Based on Relations," Journal of Systems and Software, vol. 12, pp. 139-155, 1990. Google ScholarDigital Library
- Mili92a Hafedh Mili and Roy Rada, "A Model of Hierarchies Based on Graph Homomorphisms," Computers and Mathematics with Applications, vol. 23, no. 2-5, pp. 343-361, Winter 1992.Google ScholarCross Ref
- Mili92c Hafedh Mili and Robert Godin, Software Reuse Research Plan for the SYNERGIE Project, p. 16, Department of Maths and Computer Science, Univ. of Quebec at Montreal, November 17, 1992.Google Scholar
- Mineau90a G. Mineau, J. Gecsei, and R. Godin, "Structuring Knowledge Bases using Automatic Learning Processes," in Proceedings of the Sixth International Conference on Data Engineering, pp. 274-280, IEEE Computer Society Press, Los Angeles, CA, 1990. Google ScholarDigital Library
- Ossher92a Harold Ossher and William Harrison, "Combination of Inheritance Hierarchies," SIGPLAN Notices, vol. 27, no. 10, pp. 25-40, Vancouver, B.C. (Canada), October 18-22, 1992. Proceedings of OOPSLA'92. Google ScholarDigital Library
- Pedersen89a Claus H. Pedersen, "Extending Ordinary Inheritance Schemes To Include Generalization," SIGPLAN Notices, vol. 24, no. 10, pp. 407-418, New Orleans, Louisiana, October 1-6, 1989. Proceedings of OOPSLA'89. Google ScholarDigital Library
- Prieto-Diaz87a Ruben Prieto-Diaz and Peter Freeman, "Classifying Software for Reusability," IEEE Software, pp. 6-16, January 1987.Google Scholar
- Rumbaugh91a James Rumbaugh, Michael Blaha, William Premerlani, Frederick Eddy, and William Lorensen, in Object-Oriented Modeling and Design, Prentice Hall, 1991. Google ScholarDigital Library
- Wille82a R. Wille, "Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts," in Ordered Sets, ed. I. Rival, pp. 445-470, Reidel, Dordrecht-Boston, 1982.Google Scholar
- Wirfs-Brock90a Rebecca Wirfs-Brock, Brian Wilkerson, and Lauren Wiener, in Designing Object-Oriented Software, Prentice-Hall, 1990. Google ScholarDigital Library
Index Terms
- Building and maintaining analysis-level class hierarchies using Galois Lattices
Recommendations
Lattice-theoretic contexts and their concept lattices via Galois ideals
This paper introduces a concept of lattice-theoretic contexts as well as their concept lattices. A lattice-theoretic context is a triple (G, M, I) with two complete lattices G, M and their Galois ideal I. A lattice-theoretic context and its concept ...
Maximal and stochastic Galois lattices
Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)We present a general formula for the intent-extent mappings of a Galois lattice generated by individual descriptions which lie in any arbitrary lattice.The formulation is unique if a natural maximality condition is required. This formulation yields, as ...
Integrally Closed Residuated Lattices
AbstractA residuated lattice is said to be integrally closed if it satisfies the quasiequations and , or equivalently, the equations and . Every integral, cancellative, or divisible residuated lattice is integrally closed,...
Comments