Pages that link to "Item:Q1946215"
From MaRDI portal
The following pages link to Computing premises of a minimal cover of functional dependencies is intractable (Q1946215):
Displaying 17 items.
- A comprehensive survey on formal concept analysis, its research trends and applications (Q326255) (← links)
- 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)
- RQL: a query language for rule discovery in databases (Q507529) (← links)
- Algorithms for \(k\)-meet-semidistributive lattices (Q507534) (← links)
- Decision implication canonical basis: a logical perspective (Q743121) (← links)
- Interactive error correction in implicative theories (Q899138) (← links)
- A depth-first search algorithm for computing pseudo-closed sets (Q1800382) (← links)
- Translating between the representations of a ranked convex geometry (Q2032718) (← links)
- A general theory of concept lattice with tractable implication exploration (Q2193284) (← links)
- Characterizing functional dependencies in formal concept analysis with pattern structures (Q2254619) (← links)
- On implication bases in \(n\)-lattices (Q2286379) (← links)
- Computing the Duquenne–Guigues basis: an algorithm for choosing the order (Q2817077) (← 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)
- Mining ℰℒ⊥ Bases with Adaptable Role Depth (Q6135964) (← links)
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements (Q6165553) (← links)
