ICFCA 2006: Dresden, Germany

Invited Lectures

• Rudolf Wille:
  Methods of Conceptual Knowledge Processing. 1-29
  
• Tushar S. Kulkarni, Bernd S. W. Schröder:
  An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms. 30-44
  
• Radim Belohlávek, Vilém Vychodil:
  Attribute Implications in a Fuzzy Setting. 45-60
  
• Jean-Claude Falmagne, Eric Cosyn, Jean-Paul Doignon, Nicolas Thiéry:
  The Assessment of Knowledge, in Theory and in Practice. 61-79
  

Regular Papers

• Christian Burgmann, Rudolf Wille:
  The Basic Theorem on Preconcept Lattices. 80-88
  
• Markus Krötzsch, Grit Malik:
  The Tensor Product as a Lattice of Regular Galois Connections. 89-104
  
• Frithjof Dau, Joachim Hereth Correia:
  Two Instances of Peirce's Reduction Thesis. 105-118
  
• Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad:
  Very Fast Instances for Concept Generation. 119-129
  
• Sébastien Ferré:
  Negation, Opposition, and Possibility in Logical Concept Analysis. 130-145
  
• Léonard Kwuida:
  A Note on Negation: A PCS-Completion of Semilattices. 146-160
  
• Francisco J. Valverde-Albacete, Carmen Peláez-Moreno:
  Towards a Generalisation of Formal Concept Analysis for Data Mining Purposes. 161-176
  
• Raoul Medina, Lhouari Nourine, Olivier Raynaud:
  Interactive Association Rules Discovery. 177-190
  
• Alain Gély, Lhouari Nourine:
  About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base. 191-204
  
• Ben Martin, Peter W. Eklund:
  Spatial Indexing for Scalability in FCA. 205-220
  
• L. John Old:
  Homograph Disambiguation Using Formal Concept Analysis. 221-232
  
• John L. Pfaltz:
  Using Concept Lattices to Uncover Causal Dependencies in Software. 233-247
  
• Uta Priss:
  An FCA Interpretation of Relation Algebra. 248-263
  
• Tim Hannan, Alex Pogel:
  Spring-Based Lattice Drawing Highlighting Conceptual Similarity. 264-279
  
• Christian Zschalig:
  Characterizing Planar Lattices Using Left-Relations. 280-290
  
• Richard Cole, Jon Ducrou, Peter W. Eklund:
  Automated Layout of Small Lattices Using Layer Diagrams. 291-305
  
• Sergei O. Kuznetsov, Sergei A. Obiedkov:
  Counting Pseudo-intents and #P-completeness. 306-308
  

Last update Mon Feb 13 04:30:07 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page