Attribute exploration with background knowledge

Theoretical Computer Science

Volumn 217, Issue 2, 1999, Pages 215-233

  Ganter, Bernhard ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Clause; Closure system; Formal concept analysis; Knowledge acquisition

Indexed keywords

EID: 0346876953     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00271-0     Document Type: Article

References (11)

1. F. Baader, Computing a minimal representation of the subsumption lattice of all conjunctions of concepts defined in a terminology, Proc. Int. Symp. on Knowledge Retrieval, Use, and Storage for Efficiency, KRUSE 95, Santa Cruz, USA, 1995, pp. 168-178.
2. P. Burmeister, Merkmalimplikationen bei unvollständigem Wissen, in: Wilfried Lex (Ed.), Arbeitstagung Begriffsanalyse und Künstliche Intelligenz. Informatik-Bericht 89/3, TU Clausthal, 1991, pp. 15-46.
3. B. Ganter, R. Wille, Formal Concept Analysis - Mathematical Foundations, Springer, Berlin, 1998.
4. T. Hahn (Ed.), International Tables for Crystallography, Reidel, Dordrecht/Boston, 1983.
5. J.-L. Guigues, V. Duquenne, Familles minimales d'implications informatives resultant d'un tableau de données binaires, Math. Sci. Humaines 95 (1986) 5-18.
6. D. Maier, The Theory of Relational Data Bases, Computer Science Press, Rockville, 1983.
7. S. Reeg, W. Weiß, Properties of Finite Lattices, Diplomarbeit, TH Darmstadt, 1990.
8. G. Stumme, Attribute exploration with background implications and exceptions, in: H.-H. Bock, W. Polasek (Ed.), Data analysis and Information Systems, Springer, Berlin, 1996, pp. 457ff.
9. M. Wild, A theory of finite closure spaces based on implications, Adv. Math. 108.1 (1994) 118-134.
10. R. Wille, Bedeutungen von Begriffsverbänden, in: Bernhard Ganter, R. Wille, K. Erich Wolff (Eds.), Beiträge zur Begriffsanalyse. B. I.-Wissenschaftsverlag, Mannheim, 1987, pp. 161-211.
11. M. Zickwolff, Rule exploration: first order logic in formal concept analysis, Dissertation, TH Darmstadt, 1991.