Abstract is missing.
- Approximating Fuzzy Relation Equations Through Concept LatticesDavid Lobo, Víctor López-Marchante, Jesús Medina 0001. 3-16 [doi]
- Doubly-Lexical Order Supports Standardisation and Recursive Partitioning of Formal ContextTim Pattison, Aryan Nataraja. 17-32 [doi]
- Graph-FCA Meets Pattern StructuresSébastien Ferré. 33-48 [doi]
- On the Commutative Diagrams Among Galois Connections Involved in Closure StructuresManuel Ojeda-Hernández, Inma P. Cabrera, Pablo Cordero, Emilio Muñoz-Velasco. 49-63 [doi]
- Scaling DimensionBernhard Ganter, Tom Hanika, Johannes Hirth. 64-77 [doi]
- Three Views on Dependency Covers from an FCA PerspectiveJaume Baixeries, Víctor Codocedo, Mehdi Kaytoue, Amedeo Napoli. 78-94 [doi]
- A Triadic Generalisation of the Boolean Concept LatticeAlexandre Bazin. 95-105 [doi]
- Computing Witnesses for Centralising Monoids on a Three-Element SetMike Behrisch, Leon Renkin. 109-126 [doi]
- Description Quivers for Compact Representation of Concept Lattices and Ensembles of Decision TreesEgor Dudyrev, Sergei O. Kuznetsov, Amedeo Napoli. 127-142 [doi]
- Examples of Clique Closure SystemsElias Dahlhaus, Bernhard Ganter. 143-151 [doi]
- On the Maximal Independence Polynomial of the Covering Graph of the Hypercube up to n=6Dmitry I. Ignatov. 152-165 [doi]
- Relational Concept Analysis in Practice: Capitalizing on Data Modeling Using Design PatternsAgnès Braud, Xavier Dolques, Marianne Huchard, Florence Le Ber, Pierre Martin 0001. 166-182 [doi]
- Representing Concept Lattices with Euler DiagramsUta Priss. 183-197 [doi]