Pages that link to "Item:Q628340"

The following pages link to On the complexity of enumerating pseudo-intents (Q628340):

Displaying 24 items.

• The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
• Discovery of the \(D\)-basis in binary tables based on hypergraph dualization (Q507518) (← links)
• Algorithms for \(k\)-meet-semidistributive lattices (Q507534) (← links)
• On minimal sets of graded attribute implications (Q526697) (← links)
• Minimal bases of temporal attribute implications (Q722104) (← links)
• Interactive error correction in implicative theories (Q899138) (← links)
• Computing sets of graded attribute implications with witnessed non-redundancy (Q1615669) (← links)
• Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991) (← links)
• A depth-first search algorithm for computing pseudo-closed sets (Q1800382) (← links)
• Steps towards causal Formal Concept Analysis (Q2076995) (← links)
• Knowledge cores in large formal contexts (Q2149803) (← links)
• A general theory of concept lattice with tractable implication exploration (Q2193284) (← links)
• Optimizations in computing the Duquenne-Guigues basis of implications (Q2248528) (← links)
• Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531) (← links)
• On implication bases in \(n\)-lattices (Q2286379) (← links)
• From equivalence queries to PAC learning: the case of implication theories (Q2658016) (← links)
• Computing the Duquenne–Guigues basis: an algorithm for choosing the order (Q2817077) (← links)
• Some Complexity Results about Essential Closed Sets (Q3003410) (← links)
• Formal Methods in FCA and Big Data (Q5054986) (← links)
• Measuring the Implications of the D-Basis in Analysis of Data in Biomedical Studies (Q5255648) (← links)
• Pruning techniques in lincbo for the computation of the duquenne-guigues basis (Q6125182) (← links)
• Mining ℰℒ⊥ Bases with Adaptable Role Depth (Q6135964) (← links)
• Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements (Q6165553) (← links)
• Ordinal motifs in lattices (Q6197178) (← links)