PASQUIER, N, BASTIDE, Y, TAOUIL, R and LAKHAL, L(1999): Closed se based discovery of small covers for association rules. In: Actes des 15mes younes Bases de Donnes Avances(BDA 99), pp. 361-38 STAAB, S, SANTINI, S, NACK, F, STEELS, L and MAEDCHE, A(2002): Emer- gent semantics. Intelligent Systems, IEEE, 17(1): 78 STEELS, L(1998): The Origins of Ontologies and Communication Conventions in Multi-Agent Systems. Autonomous Agents and Multi-Agent Systems, 1(2): 169 STUMME, G(1999 ) Conceptual Knowledge Discovery with Frequent Concept La tices. FB4-Preprint 2043, TU Darmstadt STUMME, G.(2002 ): Efficient Data Mining Based on Formal Concept Analysis. In A. Hameurlain, R. Cicchetti and R. Traunmller(Eds ) Proc. DEXA 2002, vol 2453 of LNCS, pp. 534-546. Springer, Heidelberg STUMME, G.(2005): A Finite State Model for On-Line Analytical Processing in Triadic Contexts. In: B. Ganter and R. Godin(Eds ) ICFCA, vol. 3403 of Lecture Notes in Computer Science, pp. 315-328. Springer. ISBN 3-540-24525-1 WILLE, R(1982): Restructuring lattices theory: An approach based on hierarchies of concepts. In: I. Rival(Ed ) Ordered Sets, pp. 445-470. Reidel, Dordrecht- ZAKI, M. J and HSIAO, C - J.(1999 ) ChARM: An efficient algorithm for closed association rule mining. Technical Report 99-10. Tech. rep Computer Science Dept, Rensselaer Polytechnic 9PASQUIER, N., BASTIDE, Y., TAOUIL, R. and LAKHAL, L. (1999): Closed set based discovery of small covers for association rules. In: Actes des 15mes journes Bases de Donnes Avances (BDA’99), pp. 361–381. STAAB, S., SANTINI, S., NACK, F., STEELS, L. and MAEDCHE, A. (2002): Emer￾gent semantics. Intelligent Systems, IEEE, 17 (1):78. STEELS, L. (1998): The Origins of Ontologies and Communication Conventions in Multi-Agent Systems. Autonomous Agents and Multi-Agent Systems, 1 (2):169. STUMME, G. (1999): Conceptual Knowledge Discovery with Frequent Concept Lat￾tices. FB4-Preprint 2043, TU Darmstadt. STUMME, G. (2002): Efficient Data Mining Based on Formal Concept Analysis. In: A. Hameurlain, R. Cicchetti and R. Traunmller (Eds.), Proc. DEXA 2002, vol. 2453 of LNCS, pp. 534–546. Springer, Heidelberg. STUMME, G. (2005): A Finite State Model for On-Line Analytical Processing in Triadic Contexts. In: B. Ganter and R. Godin (Eds.), ICFCA, vol. 3403 of Lecture Notes in Computer Science, pp. 315–328. Springer. ISBN 3-540-24525-1. WILLE, R. (1982): Restructuring lattices theory : An approach based on hierarchies of concepts. In: I. Rival (Ed.), Ordered Sets, pp. 445–470. Reidel, Dordrecht￾Boston. ZAKI, M. J. and HSIAO, C.-J. (1999): ChARM: An efficient algorithm for closed association rule mining. Technical Report 99–10. Tech. rep., Computer Science Dept., Rensselaer Polytechnic. 9