On the complexity of enumerating pseudo-intents
From MaRDI portal
Publication:628340
DOI10.1016/j.dam.2010.12.004zbMath1214.68387MaRDI QIDQ628340
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.004
Related Items
Measuring the Implications of the D-Basis in Analysis of Data in Biomedical Studies, The joy of implications, aka pure Horn formulas: mainly a survey, Discovery of the \(D\)-basis in binary tables based on hypergraph dualization, Algorithms for \(k\)-meet-semidistributive lattices, On minimal sets of graded attribute implications, Minimal bases of temporal attribute implications, Interactive error correction in implicative theories, Computing sets of graded attribute implications with witnessed non-redundancy, Lattices, closures systems and implication bases: a survey of structural aspects and algorithms, A depth-first search algorithm for computing pseudo-closed sets, A general theory of concept lattice with tractable implication exploration, Optimizations in computing the Duquenne-Guigues basis of implications, Fast algorithms for implication bases and attribute exploration using proper premises, On implication bases in \(n\)-lattices, From equivalence queries to PAC learning: the case of implication theories, Computing the Duquenne–Guigues basis: an algorithm for choosing the order, Some Complexity Results about Essential Closed Sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum implicational basis for \(\wedge\)-semidistributive lattices
- Some decision and counting problems of the Duquenne-Guigues basis of implications
- Computational aspects of monotone dualization: a brief survey
- On generating all maximal independent sets
- The core of finite lattices
- Monotone Boolean dualization is in co-NP\([\log^{2}n\).]
- Attribute-incremental construction of the canonical implication basis
- Hardness of Enumerating Pseudo-intents in the Lectic Order
- Two Basic Algorithms in Concept Analysis
- New results on monotone dualization and generating hypergraph transversals
- Some Notes on Pseudo-closed Sets
- Some Computational Problems Related to Pseudo-intents
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- A New Algorithm for Generating All the Maximal Independent Sets
- Optimal implicational bases for finite modular lattices
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- About Keys of Formal Context and Conformal Hypergraph
- On the Complexity of Some Enumeration Problems for Matroids
- Formal Concept Analysis
- Formal Concept Analysis
- Formal Concept Analysis
