ICFCA 2005: Lens, France

• Mohammed Javeed Zaki, Nagender Parimi, Nilanjana De, Feng Gao, Benjarath Phoophakdee, Joe Urban, Vineet Chaoji, Mohammad Al Hasan, Saeed Salem:
  Towards Generic Pattern Mining. 1-20
  
• Uta Priss, L. John Old:
  Conceptual Exploration of Semantic Mirrors. 21-32
  
• Jayson E. Rome, Robert M. Haralick:
  Towards a Formal Concept Analysis Approach to Exploring Communities on the World Wide Web. 33-48
  
• Juan M. Cigarrán, Anselmo Peñas, Julio Gonzalo, Felisa Verdejo:
  Automatic Selection of Noun Phrases as Document Descriptors in an FCA-Based Information Retrieval System. 49-63
  
• Jon Ducrou, Peter W. Eklund:
  Combining Spatial and Lattice-Based Information Landscapes. 64-78
  
• Francisco J. Valverde-Albacete:
  Explaining the Structure of FrameNet with Concept Lattices. 79-94
  
• Gabriela Arévalo, Stéphane Ducasse, Oscar Nierstrasz:
  Lessons Learned in Applying Formal Concept Analysis to Reverse Engineering. 95-112
  
• Richard Cole, Peter Becker:
  Navigation Spaces for the Conceptual Analysis of Software Structure. 113-128
  
• Peter W. Eklund, Bastian Wormuth:
  Restructuring Help Systems Using Formal Concept Analysis. 129-144
  
• Nicolas Maille, Irving C. Statler, Laurent Chaudron:
  An Application of FCA to the Analysis of Aeronautical Incidents. 145-161
  
• Jaume Baixeries, José L. Balcázar:
  Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis. 162-175
  
• Radim Belohlávek, Vladimir Sklenar:
  Formal Concept Analysis Constrained by Attribute-Dependency Formulas. 176-191
  
• Kamal Nehmé, Petko Valtchev, Mohamed Rouane Hacene, Robert Godin:
  On Computing the Minimal Generator Family for Concept Lattices and Icebergs. 192-207
  
• Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad:
  Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. 208-222
  
• Alain Gély:
  A Generic Algorithm for Generating Closed Sets of a Binary Relation. 223-234
  
• Alain Gély, Raoul Medina, Lhouari Nourine, Yoan Renaud:
  Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases. 235-248
  
• Jean François Djoufak Kengue, Petko Valtchev, Clémentin Tayou Djamégni:
  A Parallel Algorithm for Lattice Construction. 249-264
  
• Peter Becker:
  Using Intermediate Representation Systems to Interact with Concept Lattices. 265-268
  
• Radim Belohlávek, Vladimir Sklenar, Jiri Zacpal:
  Crisply Generated Fuzzy Concepts. 269-284
  
• Lars Schoolmann:
  Triadic Concept Graphs and Their Conceptual Contents. 285-298
  
• Véronique Ventos, Henry Soldano:
  Alpha Galois Lattices: An Overview. 299-314
  
• Gerd Stumme:
  A Finite State Model for On-Line Analytical Processing in Triadic Contexts. 315-328
  
• Björn Vormbrock:
  Complete Subalgebras of Semiconcept Algebras and Protoconcept Algebras. 329-343
  
• Sascha Karl Dörflein, Rudolf Wille:
  Coherence Networks of Concept Lattices: The Basic Theorem. 344-359
  
• Karl Erich Wolff, Wendsomde Yameogo:
  Turing Machine Representation in Temporal Concept Analysis. 360-374
  
• Joachim Hereth Correia, Julia Klinger:
  Protoconceptual Contents and Implications. 375-390
  
• Christian Zschalig:
  Planarity of Lattices. 391-402
  
• Jürg Schmid:
  Bialgebraic Contexts for Distributive Lattices - Revisited. 403-407
  
• Bernhard Ganter, Léonard Kwuida:
  Which Concept Lattices Are Pseudocomplemented?. 408-416