Table of Contents

Methods of conceptual knowledge processing / Rudolf Wille.
An enumeration problem in ordered sets leads to possible benchmarks for run-time prediction algorithms / Tushar S. Kulkarni, Bernd S.W. Schröder.
Attribute implications in a fuzzy setting / Radim Bĕlohlávek, Vilém Vychodil.
The assessment of knowledge, in theory and in practice / Jean-Claude Falmagne, Eric Cosyn, Jean-Paul Doignon, Nicolas Thiéry.
The basic theorem on preconcept lattices / Christian Burgmann, Rudolf Wille.
The tensor product as a lattice of regular Galois connections / Markus Krötzsch, Grit Malik.
Two instances of Peirce's reduction thesis / Frithjof Dau, Joachim Hereth Correia.
Very fast instances for concept generation / Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad.
Negation, opposition, and possibility in logical concept analysis / Sébastien Ferré.
A note on negation : a PCS-completion of semilattices / Léonard Kwuida.
Towards a generalisation of formal concept analysis for data mining purposes / Francisco J. Valverde-Albacete, Carmen Peláez-Moreno.
Interactive association rules discovery / Raoul Medina, Lhouari Nourine, Olivier Raynaud.
About the family of closure systems preserving non-unit implications in the Guigues-Duquenne Base / Alain Gély, Lhouari Nourine.
Spatial indexing for scalability in FCA / Ben Martin, Peter Eklund.
Homograph disambiguation using formal concept analysis / L. John Old.
Using concept lattices to uncover causal dependencies in software / John L. Pfaltz.
An FCA interpretation of relation algebra / Uta Priss.
Spring-based lattice drawing highlighting conceptual similarity / Tim Hannan, Alex Pogel.
Characterizing planar lattices using left-relations / Christian Zschalig.
Automated layout of small lattices using layer diagrams / Richard Cole, Jon Ducrou, Peter Eklund.
Counting pseudo-intents and #P-completeness / Sergei O. Kuznetsov, Sergei Obiedkov.