default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDICFCA 2007: Clermont-Ferrand, France
- Sergei O. Kuznetsov, Stefan Schmidt:
Formal Concept Analysis, 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings. Lecture Notes in Computer Science 4390, Springer 2007, ISBN 3-540-70828-6 - Bernhard Ganter:
Relational Galois Connections. 1-17 - Peter W. Eklund
, Rudolf Wille:
Semantology as Basis for Conceptual Knowledge Processing. 18-38 - Marie Agier, Jean-Marc Petit:
A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets. 39-50 - Mohamed Rouane Hacene, Marianne Huchard, Amedeo Napoli, Petko Valtchev:
A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data. 51-65 - Carlo Meghini, Nicolas Spyratos:
Computing Intensions of Digital Library Collections. 66-81 - Ben Martin, Peter W. Eklund:
Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis. 82-97 - Sébastien Ferré:
The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees. 98-113 - Peggy Cellier, Sébastien Ferré, Olivier Ridoux, Mireille Ducassé:
A Parameterized Algorithm for Exploring Concept Lattices. 114-129 - Tarek Hamrouni, Petko Valtchev, Sadok Ben Yahia, Engelbert Mephu Nguifo:
About the Lossless Reduction of the Minimal Generator Family of a Context. 130-150 - Sebastian Rudolph:
Some Notes on Pseudo-closed Sets. 151-165 - Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret:
Performances of Galois Sub-hierarchy-building Algorithms. 166-180 - Francisco J. Valverde-Albacete, Carmen Peláez-Moreno:
Galois Connections Between Semimodules and Applications in Data Mining. 181-196 - Jesús Medina, Manuel Ojeda-Aciego, Jorge Ruiz-Calviño:
On Multi-adjoint Concept Lattices: Definition and Representation Theorem. 197-209 - Bernhard Ganter, Heiko Reppe:
Base Points, Non-unit Implications, and Convex Geometries. 210-220 - Dmitry E. Palchunov:
Lattices of Relatively Axiomatizable Classes. 221-239 - Björn Vormbrock:
A Solution of the Word Problem for Free Double Boolean Algebras. 240-270 - Léonard Kwuida, Branimir Seselja, Andreja Tepavcevic:
On the MacNeille Completion of Weakly Dicomplemented Lattices. 271-280 - Tim Becker:
Polynomial Embeddings and Representations. 281-302 - Rudolf Wille:
The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices. 303-312 - Christian Zschalig:
Bipartite Ferrers-Graphs and Planar Concept Lattices. 313-327
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-21 19:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
