Computing the Duquenne–Guigues basis: an algorithm for choosing the order
From MaRDI portal
Publication:2817077
DOI10.1080/03081079.2015.1072922zbMath1365.68410OpenAlexW2232010231MaRDI QIDQ2817077
Jean-Gabriel Ganascia, Alexandre Bazin
Publication date: 29 August 2016
Published in: International Journal of General Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081079.2015.1072922
Related Items (2)
A depth-first search algorithm for computing pseudo-closed sets ⋮ Steps towards causal Formal Concept Analysis
Cites Work
- On the complexity of enumerating pseudo-intents
- Some decision and counting problems of the Duquenne-Guigues basis of implications
- Computing premises of a minimal cover of functional dependencies is intractable
- Attribute-incremental construction of the canonical implication basis
- Two Basic Algorithms in Concept Analysis
- On the Merge of Factor Canonical Bases
This page was built for publication: Computing the Duquenne–Guigues basis: an algorithm for choosing the order
