Formal Concept Analysis

DOI10.1007/11671404zbMath1177.68207OpenAlexW383789997MaRDI QIDQ5898497

Lhouari Nourine, Alain Gély

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11671404

zbMATH Keywords

Closure systemEquivalence relationGuigues-Duquenne base

Mathematics Subject Classification ID

Knowledge representation (68T30) Information storage and retrieval of data (68P20) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (3)

Representations for the largest extension of a closure system ⋮ On the complexity of enumerating pseudo-intents ⋮ A depth-first search algorithm for computing pseudo-closed sets

This page was built for publication: Formal Concept Analysis