About the family of closure systems preserving non-unit implications in the Guigues-Duquenne base

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3874 LNAI, Issue , 2006, Pages 191-204

  Gély, Alain ^a   Nourine, Lhouari ^a  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

Closure system; Equivalence relation; Guigues Duquenne base

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER SCIENCE; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

CLOSURE SYSTEMS; EQUIVALENCE RELATION; GUIGUES-DUQUENNE BASE;

INFORMATION RETRIEVAL SYSTEMS;

EID: 33745564339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11671404_13     Document Type: Conference Paper

References (12)

1. Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24(6) (1995) 1278-1304
2. Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and ai. In: European Conference on Logics in Artificial Intelligence (JELIA'02). (2002) 549-564
3. Ibaraki, T., Kogan, A., Makino, K.: Inferring minimal functional dependencies in horn and q-horn theories. Technical report, Rutcor Research Report, RRR 35-2000 (2000)
4. Maier, D.: The theory of relational data bases. Computer Science Press, Rockville (1983)
5. Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms (1996) 618-628
6. Guigues, J., Duquenne, V.: Families minimales d'implications informatives résultant d'un tableau de données binaires. Math. Sci. hum 95 (1986) 5-18
7. Bordalo, G., Monjardet, B.: The lattice of strict completions of a finite poset. Algebra Universal 47 (2002) 183-200
8. Nation, J.B., Pogel, A.: The lattice of completions of an ordered set. Order 14 (1997) 1-7
9. Ganter, B.: Two basic algorithms in concept analysis. Technical report, No 831, Technische Hochschule Darmstadt (1984)
10. Beeri, C., Berstein, P.: Computational problems related to the design of normal form relational schemas. ACM Trans. on database systems 1 (1979) 30-59
11. Wild, M.: Implicational bases for finite closure systems. Technical report, No 1210, Technische Hochschule Darmstadt (1989)
12. Shock, R.C.: Computing the minimum cover of functional dependencies. Information Processing Letters 3 (1986) 157-159