Skip to main content
Springer Nature Link
Log in

Computing with Conceptual Structures

  • Conference paper
Conceptual Structures: Logical, Linguistic, and Computational Issues (ICCS 2000)

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

Included in the following conference series:

Abstract

We give an overview over the computational tools for conceptional structures that have emerged from the theory of Formal Concept Analysis, with emphasis on basic ideas rather than technical details. We describe what we mean by conceptual computations, and try to convice the reader that an elaborate formalization is a necessary precondition. Claiming that Formal Concept Analysis provides such a formal background, we present as examples two well known algorithms in very simple pseudo code. These can be used for navigating in a lattice, thereby supporting some prototypical tasks of conceptual computation. We refer to some of the many more advanced methods, discuss how to compute with limited precision and explain why in the case of incomplete knowledge the conceptual approach is more efficient than a combinatorial one. Utilizing this efficiency requires skillful use of the formalism. We present two results that lead in this direction.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Birkhoff, G.: Lattice Theory. American Math. Soc. Colloquium Publications 25, 3rd edn. Providence, R.I. (1973)

    Google Scholar 

  2. Burmeister, P.: CONLMP: Ein Programm zur Formalen Begriffsanalyse. In: Stumme, G., Wille, R. (Hrsg.) Begriffliche Wissensverarbeitung: Methoden und Anwendungen. Springer, Heidelberg (1999)

    Google Scholar 

  3. Devlin, K.: Goodbye Descartes. The end of logic and the search for a new cosmology of the mind. John Wiley & Sons, New York (1997)

    Google Scholar 

  4. Doignon, J.-P.: Falmagne. Knowledge Spaces. Springer, Heidelberg (1999)

    Google Scholar 

  5. 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 

  6. Freese, R., Jez̃ek, J., Nation, J.B.: Free lattices. In: Mathematical Surveys and Monographs, vol. 42. American Mathematical Society, Providence (1995)

    Google Scholar 

  7. Ganter, B., Krau”se, R.: Pseudo models and propositional Horn inference, TU Dresden (1999) (Preprint)

    Google Scholar 

  8. Ganter, B., Kuznetsov, S.: Stepwise construction of the Dedekind-MacNeille completion. In: Mugnier, M.-L., Chein, M. (eds.) ICCS 1998. LNCS (LNAI), vol. 1453, pp. 295–302. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1998)

    Google Scholar 

  10. Gr”atzer, G.: General Lattice Theory, 2nd edn. Birkh”auser, Basel (1998)

    Google Scholar 

  11. Gr”atzer, G.: Universal Algebra, 2nd edn. Springer, Heidelberg (1979)

    Google Scholar 

  12. Kuznetsov, S.O.: Mathematical aspects of concept analysis. Journal of Mathematical Science, Series Contemporary Mathematics and its Applications 18, 1654–1698 (1996)

    Google Scholar 

  13. Kuznetsov, S.O.: Interpretation on graphs andalgorithmic complexity characteristics of a search for specific patterns. Automatic Documentation and Mathematical Linguistics 23(1), 37–45 (1989)

    MATH  Google Scholar 

  14. Kuznetsov, S.O.: Some Counting andDe cision Problems in Formal Concept Analysis. Preprint of the Technische Universitát Dresden, MATH-Al-14-1999 (September 1999)

    Google Scholar 

  15. Kuznetsov, S.O., Sergei, A.O.: Algorithms for the Construction of the Set of all Concepts andtheir line diagram (to appear)

    Google Scholar 

  16. 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 

  17. Lindig, C.: Algorithmen zur Begriffsanalyse und ihre Anwendung in Softwarebibliotheken. Ph.D.Thesis, University of Braunschweig (1999)

    Google Scholar 

  18. Pollandt, S.: Datenanalyse mit Fuzzy-Begriffen. In: Stumme, G., Wille, R. (Hrsg.) Begriffliche Wissensverarbeitung: Methoden und Anwendungen. Springer, Heidelberg (1999)

    Google Scholar 

  19. Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Fast Computation of Concept Lattices Using Data Mining Techniques (to appear)

    Google Scholar 

  20. Vogt, F.: Formale Begriffsanalyse mit C++: Datenstrukturen und Algorithmen. Springer, Heidelberg (1996)

    Google Scholar 

  21. Wille, R.: Conceptual graphs andformal 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 

  22. Wille, R.: Conceptual Landscapes of Knowledge: A Pragmatic Paradigm for Knowledge Processing. In: Mineau, G., Falls, A. (eds.) Proc. 2nd Int. Symposium on Knowledge Retrieval, Use and Storage for Efficiency, Vancouver (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dresden University of Technology,  

    Bernhard Ganter

Authors
  1. Bernhard Ganter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Algebra, University of Technology, Dresden, Germany

    Bernhard Ganter

  2. Département d’informatique et de génie logiciel, Université Laval, Pavillon Adrien-Pouliot, 1065, av. de la Médecine, G1V 0A6, Quebec City, Québec, Canada

    Guy W. Mineau

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganter, B. (2000). Computing with Conceptual Structures. 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_33

Download citation

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

  • 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