Abstract is missing.
- Relational Galois ConnectionsBernhard Ganter. 1-17 [doi]
- Semantology as Basis for Conceptual Knowledge ProcessingPeter W. Eklund, Rudolf Wille. 18-38 [doi]
- A New and Useful Syntactic Restriction on Rule Semantics for Tabular DatasetsMarie Agier, Jean-Marc Petit. 39-50 [doi]
- A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational DataMohamed Rouane Hacene, Marianne Huchard, Amedeo Napoli, Petko Valtchev. 51-65 [doi]
- Computing Intensions of Digital Library CollectionsCarlo Meghini, Nicolas Spyratos. 66-81 [doi]
- Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept AnalysisBen Martin, Peter W. Eklund. 82-97 [doi]
- The Efficient Computation of Complete and Concise Substring Scales with Suffix TreesSébastien Ferré. 98-113 [doi]
- A Parameterized Algorithm for Exploring Concept LatticesPeggy Cellier, Sébastien Ferré, Olivier Ridoux, Mireille Ducassé. 114-129 [doi]
- About the Lossless Reduction of the Minimal Generator Family of a ContextTarek Hamrouni, Petko Valtchev, Sadok Ben Yahia, Engelbert Mephu Nguifo. 130-150 [doi]
- Some Notes on Pseudo-closed SetsSebastian Rudolph. 151-165 [doi]
- Performances of Galois Sub-hierarchy-building AlgorithmsGabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret. 166-180 [doi]
- Galois Connections Between Semimodules and Applications in Data MiningFrancisco J. Valverde-Albacete, Carmen Peláez-Moreno. 181-196 [doi]
- On Multi-adjoint Concept Lattices: Definition and Representation TheoremJesús Medina, Manuel Ojeda-Aciego, Jorge Ruiz-Calviño. 197-209 [doi]
- Base Points, Non-unit Implications, and Convex GeometriesBernhard Ganter, Heiko Reppe. 210-220 [doi]
- Lattices of Relatively Axiomatizable ClassesDmitry E. Pal chunov. 221-239 [doi]
- A Solution of the Word Problem for Free Double Boolean AlgebrasBjörn Vormbrock. 240-270 [doi]
- On the MacNeille Completion of Weakly Dicomplemented LatticesLéonard Kwuida, Branimir Seselja, Andreja Tepavcevic. 271-280 [doi]
- Polynomial Embeddings and RepresentationsTim Becker. 281-302 [doi]
- The Basic Theorem on Labelled Line Diagrams of Finite Concept LatticesRudolf Wille. 303-312 [doi]
- Bipartite Ferrers-Graphs and Planar Concept LatticesChristian Zschalig. 313-327 [doi]