Abstract is missing.
- Vertical Decomposition of a Lattice Using Clique SeparatorsAnne Berry, Romain Pogorelcnik, Alain Sigayret. 15-29 [doi]
- Building up Shared Knowledge with Logical Information SystemsMireille Ducassé, Sébastien Ferré, Peggy Cellier. 31-42 [doi]
- Comparing Performance of Algorithms for Generating the Duquenne-Guigues BasisKonstantin Bazhanov, Sergei A. Obiedkov. 43-57 [doi]
- Filtering Machine Translation Results with Automatically Constructed Concept LatticesYilmaz Kiliçaslan, Edip Serdar Güner. 59-73 [doi]
- Concept Lattices in Fuzzy Relation EquationsJuan Carlos Díaz, Jesús Medina. 75-86 [doi]
- Adaptation Knowledge Discovery for Cooking Using Closed Itemset ExtractionEmmanuelle Gaillard, Jean Lieber, Emmanuel Nauer. 87-99 [doi]
- Fast Computation of Proper PremisesUwe Ryssel, Felix Distel, Daniel Borchmann. 100-113 [doi]
- Block Relations in Fuzzy SettingJan Konecny, Michal Krupka. 115-130 [doi]
- A Closure Algorithm Using a Recursive Decomposition of the Set of Moore Co-familiesPierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud. 131-141 [doi]
- Iterative Software Design of Computer Games through FCADavid Llansó, Pedro Pablo Gómez-Martín, Marco Antonio Gómez-Martín, Pedro A. González-Calero. 143-158 [doi]
- Fuzzy-Valued Triadic ImplicationsCynthia Vera Glodeanu. 159-173 [doi]
- Mining Biclusters of Similar Values with Triadic Concept AnalysisMehdi Kaytoue, Sergei O. Kuznetsov, Juraj Macko, Wagner Meira Jr., Amedeo Napoli. 175-190 [doi]
- Fast Mining of Iceberg Lattices: A Modular Approach Using GeneratorsLaszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin, Alix Boc, Vladimir Makarenkov. 191-206 [doi]
- Boolean Factors as a Means of Clustering of Interestingness Measures of Association RulesRadim Belohlávek, Dhouha Grissa, Sylvie Guillaume, Engelbert Mephu Nguifo, Jan Outrata. 207-222 [doi]
- Combining Formal Concept Analysis and Translation to Assign Frames and Thematic Role Sets to French VerbsIngrid Falk, Claire Gardent. 223-238 [doi]
- Generation Algorithm of a Concept Lattice with Limited Object AccessChristophe Demko, Karell Bertet. 239-250 [doi]
- Homogeneity and Stability in Conceptual AnalysisPaula Brito, Géraldine Polaillon. 251-263 [doi]
- A Lattice-based Query System for Assessing the Quality of Hydro-ecosystemsAgnès Braud, Cristina Nica, Corinne Grac, Florence Le Ber. 265-277 [doi]
- The Word Problem in Semiconcept AlgebrasPhilippe Balbiani. 279-294 [doi]
- Looking for Analogical Proportions in a Formal Concept Analysis SettingLaurent Miclet, Henri Prade, David Guennec. 295-307 [doi]
- Random Extents and Random Closure SystemsBernhard Ganter. 309-318 [doi]
- Extracting Decision Trees from Interval Pattern Concept LatticesZainab Assaghir, Mehdi Kaytoue, Wagner Meira Jr., Jean Villerd. 319-332 [doi]
- A New Formal Context for Symmetric DependenciesJaume Baixeries. 333-348 [doi]
- Cheating to achieve Formal Concept Analysis over a Large Formal ContextVíctor Codocedo, Carla Taramasco, Hernán Astudillo. 349-362 [doi]
- A FCA-based Analysis of Sequential Care TrajectoriesElias Egho, Nicolas Jay, Chedy Raïssi, Amedeo Napoli. 363-376 [doi]
- Querying Relational Concept LatticesZeina Azmeh, Marianne Huchard, Amedeo Napoli, Mohamed Rouane Hacene, Petko Valtchev. 377-392 [doi]
- Links between Modular Decomposition of Concept Lattice and Bimodular Decomposition of a ContextAlain Gély. 393-403 [doi]
- Abduction in Description Logics using Formal Concept Analysis and Mathematical Morphology: Application to Image InterpretationJamal Atif, Céline Hudelot, Isabelle Bloch. 405-408 [doi]
- A Local Discretization of Continuous Data for Lattices: Technical AspectsNathalie Girard, Karell Bertet, Muriel Visani. 409-412 [doi]
- Formal Concept Analysis on Graphics HardwareWilliam B. Langdon, Shin Yoo, Mark Harman. 413-416 [doi]