| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A depth-first search algorithm for computing pseudo-closed sets
|
Bazin, Alexandre
|
|
2018
|
249 |
C |
p. 28-35
|
article
|
| 2 |
Algorithms for computing the Shapley value of cooperative games on lattices
|
Maafa, Khaled
|
|
2018
|
249 |
C |
p. 91-105
|
article
|
| 3 |
A new algorithm for Boolean matrix factorization which admits overcovering
|
Belohlavek, Radim
|
|
2018
|
249 |
C |
p. 36-52
|
article
|
| 4 |
A single axiom for Boolean algebras
|
Kwuida, Léonard
|
|
2018
|
249 |
C |
p. 85-90
|
article
|
| 5 |
Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
|
Baixeries, Jaume
|
|
2018
|
249 |
C |
p. 18-27
|
article
|
| 6 |
Direct-optimal basis computation by means of the fusion of simplification rules
|
Rodríguez-Lorenzo, Estrella
|
|
2018
|
249 |
C |
p. 106-119
|
article
|
| 7 |
Editorial Board
|
|
|
2018
|
249 |
C |
p. ii
|
article
|
| 8 |
Exploratory knowledge discovery over Web of Data
|
Alam, Mehwish
|
|
2018
|
249 |
C |
p. 2-17
|
article
|
| 9 |
Locally complete consistent F-augmented contexts: A category-theoretic representation of algebraic L-domains
|
Guo, Lankun
|
|
2018
|
249 |
C |
p. 53-63
|
article
|
| 10 |
On closure operators related to maximal tricliques in tripartite hypergraphs
|
Ignatov, Dmitry I.
|
|
2018
|
249 |
C |
p. 74-84
|
article
|
| 11 |
Parallel algorithms for enumerating closed patterns from multi-relational data
|
Seki, Hirohisa
|
|
2018
|
249 |
C |
p. 120-134
|
article
|
| 12 |
Preface: Concept Lattices and Applications: Recent Advances and New Opportunities
|
Bertet, Karell
|
|
2018
|
249 |
C |
p. 1
|
article
|
| 13 |
Representation of lattices via set-colored posets
|
Habib, Michel
|
|
2018
|
249 |
C |
p. 64-73
|
article
|
| 14 |
Using congruence relations to extract knowledge from concept lattices
|
Viaud, Jean-François
|
|
2018
|
249 |
C |
p. 135-150
|
article
|
Journal description