Formal Concept Analysis

DOI10.1007/11671404MaRDI QIDQ5898505zbMATH OpenOpenAlexFDO

Authors Sergei O. Kuznetsov, Sergei Obiedkov

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30)

Recommendations

• Some decision and counting problems of the Duquenne-Guigues basis of implications
• On the intractability of computing the Duquenne-Guigues base
• Some Computational Problems Related to Pseudo-intents
• On the complexity of enumerating pseudo-intents
• Hardness of enumerating pseudo-intents in the lectic order

Cited in

(16)

• Decision implication canonical basis: a logical perspective
• Hardness of enumerating pseudo-intents in the lectic order
• On the intractability of computing the Duquenne-Guigues base
• On computing the size of a lattice and related decision problems
• On the Complexity of Computing Generators of Closed Sets
• Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods
• Some Computational Problems Related to Pseudo-intents
• Formal Concept Analysis
• Direct-optimal basis computation by means of the fusion of simplification rules
• Some complexity results about essential closed sets
• Steps towards causal Formal Concept Analysis
• A depth-first search algorithm for computing pseudo-closed sets
• Succinctness and tractability of closure operator representations
• On the complexity of enumerating pseudo-intents
• Some decision and counting problems of the Duquenne-Guigues basis of implications
• Pruning techniques in lincbo for the computation of the duquenne-guigues basis

This page was built for publication: Formal Concept Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898505)