On the complexity of enumerating pseudo-intents

From MaRDI portal
Publication:628340

DOI10.1016/j.dam.2010.12.004zbMath1214.68387OpenAlexW2005650770MaRDI QIDQ628340

Barış Sertkaya, Felix Distel

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

Computing sets of graded attribute implications with witnessed non-redundancyFormal Methods in FCA and Big DataKnowledge cores in large formal contextsLattices, closures systems and implication bases: a survey of structural aspects and algorithmsFrom equivalence queries to PAC learning: the case of implication theoriesA general theory of concept lattice with tractable implication explorationPruning techniques in lincbo for the computation of the duquenne-guigues basisMining ℰℒ⊥ Bases with Adaptable Role DepthInteractive error correction in implicative theoriesHierarchical decompositions of implicational bases for the enumeration of meet-irreducible elementsOrdinal motifs in latticesSome Complexity Results about Essential Closed SetsThe joy of implications, aka pure Horn formulas: mainly a surveyDiscovery of the \(D\)-basis in binary tables based on hypergraph dualizationAlgorithms for \(k\)-meet-semidistributive latticesOptimizations in computing the Duquenne-Guigues basis of implicationsFast algorithms for implication bases and attribute exploration using proper premisesOn minimal sets of graded attribute implicationsMinimal bases of temporal attribute implicationsOn implication bases in \(n\)-latticesA depth-first search algorithm for computing pseudo-closed setsComputing the Duquenne–Guigues basis: an algorithm for choosing the orderSteps towards causal Formal Concept AnalysisMeasuring the Implications of the D-Basis in Analysis of Data in Biomedical Studies



Cites Work