On the complexity of enumerating pseudo-intents
From MaRDI portal
Publication:628340
Recommendations
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 3771669 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1354130 (Why is no real title available?)
- scientific article; zbMATH DE number 1931696 (Why is no real title available?)
- scientific article; zbMATH DE number 7635224 (Why is no real title available?)
- A New Algorithm for Generating All the Maximal Independent Sets
- About Keys of Formal Context and Conformal Hypergraph
- Attribute-incremental construction of the canonical implication basis
- Computational aspects of monotone dualization: a brief survey
- Formal Concept Analysis
- Formal Concept Analysis
- Formal Concept Analysis
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Hardness of enumerating pseudo-intents in the lectic order
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Minimum implicational basis for \(\wedge\)-semidistributive lattices
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- New results on monotone dualization and generating hypergraph transversals
- On generating all maximal independent sets
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the Complexity of Some Enumeration Problems for Matroids
- On the intractability of computing the Duquenne-Guigues base
- Optimal implicational bases for finite modular lattices
- Some Computational Problems Related to Pseudo-intents
- Some Notes on Pseudo-closed Sets
- Some decision and counting problems of the Duquenne-Guigues basis of implications
- The core of finite lattices
- Two basic algorithms in concept analysis
Cited in
(29)- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Optimizations in computing the Duquenne-Guigues basis of implications
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- On implication bases in \(n\)-lattices
- Self-adhesivity in lattices of abstract conditional independence models
- Some complexity results about essential closed sets
- Steps towards causal Formal Concept Analysis
- Some Computational Problems Related to Pseudo-intents
- Computing the Duquenne-Guigues basis: an algorithm for choosing the order
- From equivalence queries to PAC learning: the case of implication theories
- Hardness of enumerating pseudo-intents in the lectic order
- Computing sets of graded attribute implications with witnessed non-redundancy
- A depth-first search algorithm for computing pseudo-closed sets
- Interactive error correction in implicative theories
- Minimal bases of temporal attribute implications
- Measuring the implications of the \(D\)-basis in analysis of data in biomedical studies
- Ordinal motifs in lattices
- A general theory of concept lattice with tractable implication exploration
- Mining ℰℒ⊥ Bases with Adaptable Role Depth
- Formal concept analysis: from knowledge discovery to knowledge processing
- On minimal sets of graded attribute implications
- Algorithms for \(k\)-meet-semidistributive lattices
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
- The joy of implications, aka pure Horn formulas: mainly a survey
- Formal Concept Analysis
- Fast algorithms for implication bases and attribute exploration using proper premises
- Knowledge cores in large formal contexts
- Formal Methods in FCA and Big Data
- Pruning techniques in lincbo for the computation of the duquenne-guigues basis
This page was built for publication: On the complexity of enumerating pseudo-intents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628340)
