Some decision and counting problems of the Duquenne-Guigues basis of implications
DOI10.1016/j.dam.2007.04.014zbMath1160.68031OpenAlexW2099804491WikidataQ62046333 ScholiaQ62046333MaRDI QIDQ943835
Sergei Obiedkov, Sergei O. Kuznetsov
Publication date: 10 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.04.014
formal concept analysisfunctional dependencies\#P-completenessDuquenne-Guigues basisimplication basis
Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (15)
Cites Work
- Two Basic Algorithms in Concept Analysis
- The Complexity of Enumeration and Reliability Problems
- Comparing performance of algorithms for generating concept lattices
- On computing the size of a lattice and related decision problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some decision and counting problems of the Duquenne-Guigues basis of implications