Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1995: Computing and Combinatorics pp 111–120Cite as

Computations with finite closure systems and implications

  • Session 2B: Database
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 959))

Abstract

Closure systems C ⊂ 2Mon a finite set M arise in many areas of discrete mathematics. They are conveniently encoded by either the family Irr(C) of meet irreducible closed sets, or by implicational bases Σ. We significantly improve six (partly little known) algorithms in order to settle the problems (a),(b),... (g) listed below. In particular, the algorithm LINCLOSURE, which is well known in relational database theory, is enhanced. It appears as a subroutine in three of our algorithms. Applications in database theory, matroid theory and algebra will be pointed out.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P.J. Chase, Efficient subsemilattice generation, J. Comb. Theory 10 (1971) 181–182.

    Article  Google Scholar 

  2. B. Ganter, Algorithmen zur Formalen Begriffsanalyse, p.241–254 in: B. Ganter, R. Wille, K. E. Wolff (ed.): Beitrage zur Begriffsanalyse, B.I. Mannheim/Wien/Zürich.

    Google Scholar 

  3. B. Ganter, K. Reuter, Finding all closed sets: A general approach, Order 8 (1991) 283–290.

    Article  Google Scholar 

  4. G. Gottlob, Computing covers for embedded functional dependencies, in: Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, p.58–69 (1987).

    Google Scholar 

  5. C. Herrmann, M. Wild, A polynomial algorithm for testing congruence modularity, submitted.

    Google Scholar 

  6. D. Maier, The Theory of Relational Databases, Computer Science Press, 1983.

    Google Scholar 

  7. H. Mannila, K.J. Räihä, The design of relational databases, Addison Wesley 1992.

    Google Scholar 

  8. R. C. Shock, Computing the minimum cover of functional dependencies, Inf. Proc. Letters 22 (1986) 157–159.

    Article  Google Scholar 

  9. N. White (ed.), Matroid Applications, Enc. Math. and its Appl., Vol. 40 (1992), Cambridge University Press.

    Google Scholar 

  10. M. Wild, A theory of finite closure spaces based on implications, Advances in Mathematics 108 (1994) 118–139.

    Article  Google Scholar 

  11. M. Wild, An enumerative principle of exclusion, submitted.

    Google Scholar 

  12. M. Wild, Cover preserving order embeddings into Boolean lattices, Order 9 (1992) 209–232.

    Article  Google Scholar 

  13. M. Wild, Computations with finite closure systems and implications, Report Nr. 1708, Technische Hochschule Darmstadt 1994 (21 pages).

    Google Scholar 

  14. R. Wille, Concept lattices and conceptual knowledge systems, Computers Math. Applic. Vol. 23 (1992) 493–515.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, THD, 64289, Darmstadt, Germany

    Marcel Wild

Authors
  1. Marcel Wild
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wild, M. (1995). Computations with finite closure systems and implications. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030825

Download citation

  • DOI: https://doi.org/10.1007/BFb0030825

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation