Pages that link to "Item:Q1659991"
From MaRDI portal
The following pages link to Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991):
Displaying 16 items.
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- Direct-optimal basis computation by means of the fusion of simplification rules (Q1800392) (← links)
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey (Q1874537) (← links)
- Translating between the representations of a ranked convex geometry (Q2032718) (← links)
- Quasi-closed elements in fuzzy posets (Q2059596) (← links)
- Enumerating maximal consistent closed sets in closure systems (Q2117117) (← links)
- A general theory of concept lattice with tractable implication exploration (Q2193284) (← links)
- \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data (Q2207493) (← links)
- On implication bases in \(n\)-lattices (Q2286379) (← links)
- Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates (Q5054978) (← links)
- Dualization in lattices given by implicational bases (Q5919405) (← links)
- On Dualization over Distributive Lattices (Q6045449) (← links)
- On the relation between the subadditivity cone and the quantum entropy cone (Q6050311) (← links)
- Lattice point of view for argumentation framework (Q6059223) (← links)
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements (Q6165553) (← links)
- Comparing machine learning algorithms by union-free generic depth (Q6570318) (← links)
