Skip to main content
SpringerLink
Log in
Book cover

International Conference on Formal Concept Analysis

ICFCA 2012: Formal Concept Analysis pp 278–291Cite as

Some Notes on Managing Closure Operators

  • Conference paper

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

Abstract

It is widely known that closure operators on finite sets can be represented by sets of implications (also known as inclusion dependencies) as well as by formal contexts. In this paper we survey known results and present new findings concerning time and space requirements of diverse tasks for managing closure operators, given in contextual, implicational, or black-box representation. These tasks include closure computation, size minimization, finer-coarser-comparison, modification by “adding” closed sets or implications, and conversion from one representation into another.

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Day, A.: The lattice theory of functional dependencies and normal decompositions. International Journal of Algebra and Computation 2(4), 409–431 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Distel, F.: Hardness of Enumerating Pseudo-intents in the Lectic Order. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol. 5986, pp. 124–137. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Distel, F., Sertkaya, B.: On the complexity of enumerating pseudo-intents. Discrete Applied Mathematics 159(6), 450–466 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Eiter, T., Gottlob, G.: Hypergraph Transversal Computation and Related Problems in Logic and AI. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 549–564. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Eiter, T., Ibaraki, T., Makino, K.: Computing intersections of Horn theories for reasoning with models. Tech. Rep. IFIG research report 9803, Universität Gießen (1998), http://bibd.uni-giessen.de/ghtm/1998/uni/r980014.html

  6. Ganter, B.: Two basic algorithms in concept analysis. Tech. Rep. 831, FB4, TH Darmstadt (1984)

    Google Scholar 

  7. Ganter, B.: Two Basic Algorithms in Concept Analysis. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol. 5986, pp. 312–340. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer (1997)

    Google Scholar 

  9. Gottlob, G., Libkin, L.: Investigations on armstrong relations, dependency inference, and excluded functional dependencies. Acta Cybernetica 9(4), 385–402 (1990)

    MathSciNet  MATH  Google Scholar 

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

  11. Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)

    Google Scholar 

  12. Kavvadias, D., Papadimitriou, C.H., Siedri, M.: On Horn Envelopes and Hypergraph Traversals (Extended abstract). In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol. 762, pp. 399–405. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  13. Kuznetsov, S.O.: On the intractability of computing the duquenne-guigues base. Journal of Universal Computer Science 10(8), 927–933 (2004)

    MathSciNet  Google Scholar 

  14. Kuznetsov, S.O., Obiedkov, S.: Counting Pseudo-intents and #P-completeness. In: Missaoui, R., Schmidt, J. (eds.) ICFCA 2006. LNCS (LNAI), vol. 3874, pp. 306–308. Springer, Heidelberg (2006)

    Google Scholar 

  15. Kuznetsov, S.O., Obiedkov, S.A.: Some decision and counting problems of the duquenne-guigues basis of implications. Discrete Applied Mathematics 156(11), 1994–2003 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Maier, D.: The Theory of Relational Databases. Computer Science Press (1983)

    Google Scholar 

  17. Mannila, H., Räihä, K.J.: Design of Relational Databases. Addison-Wesley (1992)

    Google Scholar 

  18. Babin, M.A., Kuznetsov, K.O.: Recognizing pseudo-intents is conp-complete. In: Kryszkiewicz, M., Obiedkov, S. (eds.) Proc. 7th Int. Conf. on Concept Lattices and Their Applications (CLA 2010). CEUR Workshop Proceedings, vol. 672. CEUR-WS.org (2010)

    Google Scholar 

  19. Rudolph, S.: Some Notes on Pseudo-closed Sets. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol. 4390, pp. 151–165. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  20. Sertkaya, B.: Some Computational Problems Related to Pseudo-intents. In: Ferré, S., Rudolph, S. (eds.) ICFCA 2009. LNCS(LNAI), vol. 5548, pp. 130–145. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  21. Sertkaya, B.: Towards the Complexity of Recognizing Pseudo-intents. In: Rudolph, S., Dau, F., Kuznetsov, S.O. (eds.) ICCS 2009. LNCS, vol. 5662, pp. 284–292. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  22. Wild, M.: Implicational bases for finite closure systems. In: Lex, W. (ed.) Arbeitstagung Begriffsanalyse und Künstliche Intelligenz, pp. 147–169. Springer (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Karlsruhe Institute of Technology, Germany

    Sebastian Rudolph

Authors
  1. Sebastian Rudolph
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of Nicosia, 46 Makedonitissas Ave., 1700, Nicosia, Cyprus

    Florent Domenach

  2. Higher School of Economics, National Research University, Pokrovsky Boulevard, 109028, Moscow, Russia

    Dmitry I. Ignatov

  3. Faculty of Business and Economics, Katholieke Universiteit Leuven, Naamsestraat 69, 3000, Leuven, Belgium

    Jonas Poelmans

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rudolph, S. (2012). Some Notes on Managing Closure Operators. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds) Formal Concept Analysis. ICFCA 2012. Lecture Notes in Computer Science(), vol 7278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29892-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29892-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29891-2

  • Online ISBN: 978-3-642-29892-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation