Conferences in DBLP

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

1. Rudolf Wille
   Methods of Conceptual Knowledge Processing. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2006, pp:1-29 [Conf]
   
2. Tushar S. Kulkarni, Bernd S. W. Schröder
   An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2006, pp:30-44 [Conf]
   
3. Radim Belohlávek, Vilém Vychodil
   Attribute Implications in a Fuzzy Setting. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2006, pp:45-60 [Conf]
   
4. Jean-Claude Falmagne, Eric Cosyn, Jean-Paul Doignon, Nicolas Thiéry
   The Assessment of Knowledge, in Theory and in Practice. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2006, pp:61-79 [Conf]
   
5. Christian Burgmann, Rudolf Wille
   The Basic Theorem on Preconcept Lattices. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2006, pp:80-88 [Conf]
   
6. Markus Krötzsch, Grit Malik
   The Tensor Product as a Lattice of Regular Galois Connections. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2006, pp:89-104 [Conf]
   
7. Frithjof Dau, Joachim Hereth Correia
   Two Instances of Peirce's Reduction Thesis. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2006, pp:105-118 [Conf]
   
8. Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad
   Very Fast Instances for Concept Generation. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2006, pp:119-129 [Conf]
   
9. Sébastien Ferré
   Negation, Opposition, and Possibility in Logical Concept Analysis. [Citation Graph (0, 0)][DBLP]
   ICFCA, 2006, pp:130-145 [Conf]
   
10. Léonard Kwuida
    A Note on Negation: A PCS-Completion of Semilattices. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:146-160 [Conf]
    
11. Francisco J. Valverde-Albacete, Carmen Peláez-Moreno
    Towards a Generalisation of Formal Concept Analysis for Data Mining Purposes. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:161-176 [Conf]
    
12. Raoul Medina, Lhouari Nourine, Olivier Raynaud
    Interactive Association Rules Discovery. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:177-190 [Conf]
    
13. Alain Gély, Lhouari Nourine
    About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:191-204 [Conf]
    
14. Ben Martin, Peter W. Eklund
    Spatial Indexing for Scalability in FCA. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:205-220 [Conf]
    
15. L. John Old
    Homograph Disambiguation Using Formal Concept Analysis. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:221-232 [Conf]
    
16. John L. Pfaltz
    Using Concept Lattices to Uncover Causal Dependencies in Software. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:233-247 [Conf]
    
17. Uta Priss
    An FCA Interpretation of Relation Algebra. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:248-263 [Conf]
    
18. Tim Hannan, Alex Pogel
    Spring-Based Lattice Drawing Highlighting Conceptual Similarity. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:264-279 [Conf]
    
19. Christian Zschalig
    Characterizing Planar Lattices Using Left-Relations. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:280-290 [Conf]
    
20. Richard Cole, Jon Ducrou, Peter W. Eklund
    Automated Layout of Small Lattices Using Layer Diagrams. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:291-305 [Conf]
    
21. Sergei O. Kuznetsov, Sergei A. Obiedkov
    Counting Pseudo-intents and #P-completeness. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:306-308 [Conf]