| 2007 | A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets. Marie Agier, Jean-Marc Petit |
| 2007 | A Parameterized Algorithm for Exploring Concept Lattices. Peggy Cellier, Sébastien Ferré, Olivier Ridoux, Mireille Ducassé |
| 2007 | A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data. Mohamed Rouane Hacene, Marianne Huchard, Amedeo Napoli, Petko Valtchev |
| 2007 | A Solution of the Word Problem for Free Double Boolean Algebras. Björn Vormbrock |
| 2007 | About the Lossless Reduction of the Minimal Generator Family of a Context. Tarek Hamrouni, Petko Valtchev, Sadok Ben Yahia, Engelbert Mephu Nguifo |
| 2007 | Base Points, Non-unit Implications, and Convex Geometries. Bernhard Ganter, Heiko Reppe |
| 2007 | Bipartite Ferrers-Graphs and Planar Concept Lattices. Christian Zschalig |
| 2007 | Computing Intensions of Digital Library Collections. Carlo Meghini, Nicolas Spyratos |
| 2007 | Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis. Ben Martin, Peter W. Eklund |
| 2007 | Formal Concept Analysis, 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings Sergei O. Kuznetsov, Stefan Schmidt |
| 2007 | Galois Connections Between Semimodules and Applications in Data Mining. Francisco J. Valverde-Albacete, Carmen Peláez-Moreno |
| 2007 | Lattices of Relatively Axiomatizable Classes. Dmitry E. Palchunov |
| 2007 | On Multi-adjoint Concept Lattices: Definition and Representation Theorem. Jesús Medina, Manuel Ojeda-Aciego, Jorge Ruiz-Calviño |
| 2007 | On the MacNeille Completion of Weakly Dicomplemented Lattices. Léonard Kwuida, Branimir Seselja, Andreja Tepavcevic |
| 2007 | Performances of Galois Sub-hierarchy-building Algorithms. Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret |
| 2007 | Polynomial Embeddings and Representations. Tim Becker |
| 2007 | Relational Galois Connections. Bernhard Ganter |
| 2007 | Semantology as Basis for Conceptual Knowledge Processing. Peter W. Eklund, Rudolf Wille |
| 2007 | Some Notes on Pseudo-closed Sets. Sebastian Rudolph |
| 2007 | The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices. Rudolf Wille |
| 2007 | The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees. Sébastien Ferré |