Uncovering and reducing hidden combinatorics in Guigues-Duquenne bases

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3403, Issue , 2005, Pages 235-248

  Gely A ^a   Medina, R ^a   Nourine, L ^a   Renaud, Y ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

Clone attributes; Closure systems; Guigues Duquenne base

Indexed keywords

COMBINATORIAL MATHEMATICS;

CLONE ATTRIBUTES; CLOSURE SYSTEMS; GUIGUES-DUQUENNE BASES;

FORMAL LOGIC;

EID: 26844438133     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32262-7_16     Document Type: Conference Paper

References (6)

1. J.-L. Guigues and V. Duquenne: Famille minimale d'implications informatives résultant d'un tableau de données binaires, Mathématiques et sciences humaines,24, 1986.
2. T. Eiter and G. Gottlob: Hypergraph transversal computation and related problems in logic and AI. In European Conference on Logics in Artificial Intelligence (JELIA'02), pages 549-564, 2002.
3. B. Ganter: Finding closed sets under symmetry, FB4-Preprint 1307, TH Darmstadt, 1990.
4. B. Ganter and R. Wille: Formal Concept Analysis, Mathematical Foundations. Springler, 1999.
5. H. Mannila and K.J. Räihä: On the complexity of inferring functional dependencies. Discrete Applied Mathematics, 40(2):237-243, 1992.
6. R. Medina and L. Nourine: Clone items: a pre-processing information for knowledge discovery, Submitted.