Formal Concept Analysis
From MaRDI portal
Publication:5898505
DOI10.1007/11671404zbMath1177.68209OpenAlexW383789997MaRDI QIDQ5898505
Sergei Obiedkov, Sergei O. Kuznetsov
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
Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ On the complexity of enumerating pseudo-intents ⋮ Some Complexity Results about Essential Closed Sets ⋮ Succinctness and tractability of closure operator representations ⋮ Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods ⋮ On the Complexity of Computing Generators of Closed Sets ⋮ A depth-first search algorithm for computing pseudo-closed sets ⋮ Direct-optimal basis computation by means of the fusion of simplification rules ⋮ Decision implication canonical basis: a logical perspective ⋮ Steps towards causal Formal Concept Analysis
This page was built for publication: Formal Concept Analysis