Skip to main content

Implications in Triadic Formal Contexts

  • Conference paper
Conceptual Structures at Work (ICCS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3127))

Included in the following conference series:

Abstract

There are different possibilities to define implications in a triadic formal context. We discuss several such notions. Our main interest is to give compact descriptions and to use them for an algorithm that generates these implications. Our findings are illustrated by a small example.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Biedermann, K.: A Foundation of the Theory of Trilattices. Shaker Verlag, Aachen (1998), ISBN 3-8265-4028-X

    Google Scholar 

  2. Dau, F., Wille, R.: On the modal unterstanding of triadic contexts. In: Decker, R., Gaul, W. (eds.) Classification and Information Processing at the Turn of the Millenium. Proceedings of the 23rd Annual Conference of the GfKl, University of Bielefeld, March 10-14, 1999. Studies in Classification, Data Analysis, and Knowledge Organization, pp. 3–540. Springer, Heidelberg, (2000), ISBN: 3-540-67589-2

    Google Scholar 

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

    MATH  Google Scholar 

  4. Guigues, J.-L., Duquenne, V.: Familles minimales d’implications informatives resultant d’un tableau de données binaires. Math. Sci. Humaines 95 (1986)

    Google Scholar 

  5. Lehmann, F., Wille, R.: A triadic approach to formal concept analysis. In: Ellis, G., Rich, W., Levinson, R., Sowa, J.F. (eds.) ICCS 1995. LNCS (LNAI), vol. 954, pp. 32–43. Springer, Heidelberg (1995)

    Google Scholar 

  6. Stumme, G.: Attribute exploration with background implications and exceptions. In: Bock, H.-H., Polasek, W. (eds.) Data analysis and information systems, pp. 457–469. Springer, Heidelberg (1996)

    Google Scholar 

  7. Wille, R.: The basic theorem of triadic concept analysis. Order 12, 149–158 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganter, B., Obiedkov, S. (2004). Implications in Triadic Formal Contexts. In: Wolff, K.E., Pfeiffer, H.D., Delugach, H.S. (eds) Conceptual Structures at Work. ICCS 2004. Lecture Notes in Computer Science(), vol 3127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27769-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27769-9_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22392-4

  • Online ISBN: 978-3-540-27769-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics