Contextual Attribute Logic of Many-Valued Attributes
Sometimes even the most elementary data type of Formal Concept Analysis, that of a formal context, can be difficult to handle. This is typically the case when the context under consideration is not fully available, because e.g. it is too large to be completely recorded. Then even the question “Which attribute combinations are possible?” cannot simply be answered by giving all concept intents, because such a list may be huge and therefore of little insight. In such a situation, the weaker information that certain attribute combinations are possible and others are not, may be of interest. A language to systematically address such information was introduced in  under the name of “Contextual Attribute Logic”. It activates (with an entirely different semantic in mind) basic notions of mathematical Propositional Logic for the investigations of Formal Concept Analysis.
KeywordsFormal Concept Stem Base Concept Lattice Object Intent Formal Context
Unable to display preview. Download preview PDF.
- 2.Eibl-Eibesfeldt, I.: Galapagos. Piper Verlag, München (1962)Google Scholar
- 4.Ganter, B.: Begriffe und ImplikationenGoogle Scholar
- 5.Ganter, B.: Attribute exploration with background knowledge. Theoretical Computer Science 217(2) (1999)Google Scholar
- 6.Ganter, B., Krauße, R.: Pseudo-Models and propositional Horn inference. In: Discrete Applied Mathematics 6133 (2004)Google Scholar
- 9.Jaenicke, J. (ed.): Materialienhandbuch Kursunterricht Biologie, Band 6: Evolution. Aulis Verlag Köln, (Refers to  as scientific source) (1997) ISBN 3-7614-1966-XGoogle Scholar