Skip to main content

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

Included in the following conference series:

Abstract

Triadic concept graphs have been introduced as a mathematization of conceptual graphs with subdivision. In this paper it is shown that triadic concept graphs of a triadic power context family always form a complete lattice with respect to the generalization order. For stating this result, a clarification of the notion of generalization is needed. It turns out that the generalization order may be differently defined, depending on the assumed background knowledge, respectively.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Acham, K.: Abstraktion. Historisches Wörterbuch der Philosophie. Bd.1. Schwabe, Basel, 59–63 (1971)

    Google Scholar 

  2. Biedermann, K.: How triadic diagrams represent conceptual structures. In: Delugach, H.S., Keeler, M.A., Searle, L., Lukose, D., Sowa, J.F. (eds.) ICCS 1997. LNCS (LNAI), vol. 1257, pp. 304–317. Springer, Heidelberg (1997)

    Google Scholar 

  3. Biedermann, K.: A foundation of the theory of trilattices. In: Dissertation, TU Darmstadt 1998. Shaker Verlag, Aachen (1998)

    Google Scholar 

  4. Ganter, B., Wille, R.: Formale Begriffsanalyse: Mathematische Grundlagen. Springer, Heidelberg (1996); English translation: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)

    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. Prediger, S.: Kontextuelle Urteilslogik mit Begriffsgraphen. Ein Beitrag zur Restrukturierung der mathematischen Logik. Dissertation, TU Darmstadt. Shaker Verlag, Aachen (1998)

    Google Scholar 

  7. Prediger, S., Wille, R.: The lattice of concept graphs of a relationally scaled context. In: Tepfenhart, W.M. (ed.) ICCS 1999. LNCS (LNAI), vol. 1640, pp. 401–414. Springer, Heidelberg (1999)

    Google Scholar 

  8. Wille, R.: Conceptual Graphs and Formal Concept Analysis. In: Delugach, H.S., Keeler, M.A., Searle, L., Lukose, D., Sowa, J.F. (eds.) ICCS 1997. LNCS (LNAI), vol. 1257, pp. 290–303. Springer, Heidelberg (1997)

    Google Scholar 

  9. Wille, R.: Triadic Concept Graphs. In: Mugnier, M.-L., Chein, M. (eds.) ICCS 1998. LNCS (LNAI), vol. 1453, pp. 194–208. Springer, Heidelberg (1998)

    Google Scholar 

  10. Wille, R., Zickwolff, M.: Grundlagen einer Triadischen Begriffsanalyse. In: Stumme, G., Wille, R. (eds.) Begriffliche Wissensverarbeitung: Methoden und Anwendungen, pp. 125–150. Springer, Heidelberg (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Groh, B., Wille, R. (2000). Lattices of Triadic Concept Graphs. In: Ganter, B., Mineau, G.W. (eds) Conceptual Structures: Logical, Linguistic, and Computational Issues. ICCS 2000. Lecture Notes in Computer Science(), vol 1867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722280_23

Download citation

  • DOI: https://doi.org/10.1007/10722280_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67859-5

  • Online ISBN: 978-3-540-44663-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics