Conferences in DBLP

International Conference on Formal Concept Analysis (icfca)
2007 (conf/icfca/2007)

1. Bernhard Ganter
   Relational Galois Connections. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2007, pp:1-17 [Conf]
   
2. Peter W. Eklund, Rudolf Wille
   Semantology as Basis for Conceptual Knowledge Processing. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2007, pp:18-38 [Conf]
   
3. Marie Agier, Jean-Marc Petit
   A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2007, pp:39-50 [Conf]
   
4. Mohamed Rouane Hacene, Marianne Huchard, Amedeo Napoli, Petko Valtchev
   A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2007, pp:51-65 [Conf]
   
5. Carlo Meghini, Nicolas Spyratos
   Computing Intensions of Digital Library Collections. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2007, pp:66-81 [Conf]
   
6. Ben Martin, Peter W. Eklund
   Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2007, pp:82-97 [Conf]
   
7. Sébastien Ferré
   The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2007, pp:98-113 [Conf]
   
8. Peggy Cellier, Sébastien Ferré, Olivier Ridoux, Mireille Ducassé
   A Parameterized Algorithm for Exploring Concept Lattices. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2007, pp:114-129 [Conf]
   
9. Tarek Hamrouni, Petko Valtchev, Sadok Ben Yahia, Engelbert Mephu Nguifo
   About the Lossless Reduction of the Minimal Generator Family of a Context. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2007, pp:130-150 [Conf]
   
10. Sebastian Rudolph
    Some Notes on Pseudo-closed Sets. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2007, pp:151-165 [Conf]
    
11. Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret
    Performances of Galois Sub-hierarchy-building Algorithms. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2007, pp:166-180 [Conf]
    
12. Francisco J. Valverde-Albacete, Carmen Peláez-Moreno
    Galois Connections Between Semimodules and Applications in Data Mining. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2007, pp:181-196 [Conf]
    
13. Jesús Medina, Manuel Ojeda-Aciego, Jorge Ruiz-Calviño
    On Multi-adjoint Concept Lattices: Definition and Representation Theorem. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2007, pp:197-209 [Conf]
    
14. Bernhard Ganter, Heiko Reppe
    Base Points, Non-unit Implications, and Convex Geometries. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2007, pp:210-220 [Conf]
    
15. Dmitry E. Pal'chunov
    Lattices of Relatively Axiomatizable Classes. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2007, pp:221-239 [Conf]
    
16. Björn Vormbrock
    A Solution of the Word Problem for Free Double Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2007, pp:240-270 [Conf]
    
17. Léonard Kwuida, Branimir Seselja, Andreja Tepavcevic
    On the MacNeille Completion of Weakly Dicomplemented Lattices. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2007, pp:271-280 [Conf]
    
18. Tim Becker
    Polynomial Embeddings and Representations. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2007, pp:281-302 [Conf]
    
19. Rudolf Wille
    The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2007, pp:303-312 [Conf]
    
20. Christian Zschalig
    Bipartite Ferrers-Graphs and Planar Concept Lattices. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2007, pp:313-327 [Conf]