Advertisement

Contextual Attribute Logic of Many-Valued Attributes

  • Bernhard Ganter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3626)

Abstract

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 [8] 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.

Keywords

Formal Concept Stem Base Concept Lattice Object Intent Formal Context 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Burmeister, P., Holzer, R.: Treating incomplete knowledge in Formal Concept Analysis. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3626, pp. 114–126. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Eibl-Eibesfeldt, I.: Galapagos. Piper Verlag, München (1962)Google Scholar
  3. 3.
    Guigues, J.-L., Duquenne, V.: Familles minimales d’implications informatives resultant d’un tableau de données binaires. Math. Sci. Humaines 95, 5–18 (1986)MathSciNetGoogle Scholar
  4. 4.
    Ganter, B.: Begriffe und ImplikationenGoogle Scholar
  5. 5.
    Ganter, B.: Attribute exploration with background knowledge. Theoretical Computer Science 217(2) (1999)Google Scholar
  6. 6.
    Ganter, B., Krauße, R.: Pseudo-Models and propositional Horn inference. In: Discrete Applied Mathematics 6133 (2004)Google Scholar
  7. 7.
    Ganter, B., Wille, R.: Formal Concept Analysis – Mathematical Foundations. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  8. 8.
    Ganter, B., Wille, R.: Contextual Attribute Logic. In: Tepfenhart, W.M. (ed.) ICCS 1999. LNCS, vol. 1640, pp. 377–388. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  9. 9.
    Jaenicke, J. (ed.): Materialienhandbuch Kursunterricht Biologie, Band 6: Evolution. Aulis Verlag Köln, (Refers to [2] as scientific source) (1997) ISBN 3-7614-1966-XGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Bernhard Ganter
    • 1
  1. 1.Institut für AlgebraTechnische Universität Dresden 

Personalised recommendations