Pages that link to "Item:Q2248531"
From MaRDI portal
The following pages link to Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531):
Displaying 10 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)
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991) (← links)
- Compressed representation of learning spaces (Q1679036) (← links)
- Direct-optimal basis computation by means of the fusion of simplification rules (Q1800392) (← links)
- Steps towards causal Formal Concept Analysis (Q2076995) (← links)
- On implication bases in \(n\)-lattices (Q2286379) (← links)
- A methodology for analysis of concept lattice reduction (Q2293159) (← links)
- Measuring the Implications of the D-Basis in Analysis of Data in Biomedical Studies (Q5255648) (← links)
