Skip to main content

Contextual Attribute Logic of Many-Valued Attributes

  • Chapter
Formal Concept Analysis

Part of the book series: Lecture Notes in Computer Science ((LNAI,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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Chapter  Google Scholar 

  2. Eibl-Eibesfeldt, I.: Galapagos. Piper Verlag, München (1962)

    Google Scholar 

  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)

    MathSciNet  Google Scholar 

  4. Ganter, B.: Begriffe und Implikationen

    Google 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 

  7. Ganter, B., Wille, R.: Formal Concept Analysis – Mathematical Foundations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  8. Ganter, B., Wille, R.: Contextual Attribute Logic. In: Tepfenhart, W.M. (ed.) ICCS 1999. LNCS, vol. 1640, pp. 377–388. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  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-X

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ganter, B. (2005). Contextual Attribute Logic of Many-Valued Attributes. In: Ganter, B., Stumme, G., Wille, R. (eds) Formal Concept Analysis. Lecture Notes in Computer Science(), vol 3626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11528784_5

Download citation

  • DOI: https://doi.org/10.1007/11528784_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27891-7

  • Online ISBN: 978-3-540-31881-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics