Skip to main content
SpringerLink
Log in

Join on Closure Systems Using Direct Implicational Basis Representation

  • Conference paper
Book cover Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 14))

Abstract

Closure systems arise in many areas as databases, datamining, formal concept analysis, logic and artificial intelligence. Several representations were studied to deal efficiently with closure systems and to be efficient tools in various areas. Implicational basis is a particular representation which have the advantage to be a short representation of datas. This paper states on operation of join of closure systems using their implicational basis representations. Computation of an implicational basis of join of closure systems given by their implicational basis is a problem that can’t be solve in polynomial time in size of the input in general. We present here a polynomial algorithm that solves this problem when the given implicational basis corresponding to the given closure systems are direct.

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

Access this chapter

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 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Guigues, J.-L., Duquenne, V.: Famille minimale d’implications informatives résultant d’un tableau de donneés binaires, Matheḿatiques et sciences humaines, 24 (1986)

    Google Scholar 

  2. Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: European Conference on Logics in Artificial Intelligence (JELIA 2002), pp. 549–564 (2002)

    Google Scholar 

  3. Ganter, B.: Finding closed sets under symmetry, FB4-Preprint 1307, TH Darmstadt (1990)

    Google Scholar 

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

    Book  MATH  Google Scholar 

  5. Mannila, H., Räihä, K.J.: On the complexity of inferring functional dependencies. Discrete Applied Mathematics 40(2), 237–243 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Eiter, T., Ibaraki, T., Makino, K.: Computing Intersections of Horn Theories for Reasoning with Models. Artificial Intelligence 110(1), 57–101 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Eiter, T., Ibaraki, T., Makino, K.: Disjunctions of Horn Theories and their Cores, Rutcor Research Report (1998)

    Google Scholar 

  8. Kautz, H., Selman, B.: Knowledge Compilation and Theory Approximation. Journal of the ACM 43(2), 193–224 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  9. Birkhoff, G., Frink, O.: Representations of lattices of sets. Transactions of the American Mathematical Society 64, 299–316 (1948)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIMOS - CNRS UMR 6158, Université Blaise Pascal, Clermont-Ferrand, France

    Yoan Renaud

Authors
  1. Yoan Renaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Theoretical and Applied Computer Science, UFR MIM,, Paul Verlaine University of Metz, Metz, France

    Hoai An Le Thi

  2. Faculty of Sciences, Technology and Communications, University of Luxembourg, Luxembourg

    Pascal Bouvry

  3. Laboratory of Mathematics, National Institute for Applied Sciences, Rouen Mont, Saint Aignan, France

    Tao Pham Dinh

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Renaud, Y. (2008). Join on Closure Systems Using Direct Implicational Basis Representation. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87477-5_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87476-8

  • Online ISBN: 978-3-540-87477-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation