Skip to main content
SpringerLink
Log in

Counting Pseudo-intents and #P-completeness

  • Conference paper
Book cover Formal Concept Analysis

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

Abstract

Implications of a formal context (G,M,I) have a minimal implication basis, called Duquenne-Guigues basis or stem base. It is shown that the problem of deciding whether a set of attributes is a premise of the stem base is in coNP and determining the size of the stem base is polynomially Turing equivalent to a #P-complete problem.

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

Institutional subscriptions

References

  1. Ganter, B.: Two Basic Algorithms in Concept Analysis, Preprint Nr. 831, Technische Hochschule Darmstadt (1984)

    Google Scholar 

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

    MATH  Google Scholar 

  3. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  4. Guigues, J.-L., Duquenne, V.: Informative implications derived from a table of binary data. Preprint, Groupe Mathématiques et Psychologie, Université René Descartes, Paris (1984)

    Google Scholar 

  5. Guigues, J.-L., Duquenne, V.: Familles minimales d’implications informatives résultant d’un tableau de données binaires. Math. Sci. Hum. 24(95), 5–18 (1986)

    MathSciNet  Google Scholar 

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

  7. Valiant, L.G.: The Complexity of Enumeration and Reliability Problems. SIAM J. Comput. 8(3), 410–421 (1979)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. VINITI Institute, ul. Usievicha 20, Moscow, 125190, Russia

    Sergei O. Kuznetsov

  2. University of Pretoria, Pretoria, 0002, South Africa

    Sergei Obiedkov

Authors
  1. Sergei O. Kuznetsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergei Obiedkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Département d’informatique et d’ingénierie, Université du Québec en Outaouais, succursale B, C.P. 1250, J8X 3X7, Gatineau, Québec, Canada

    Rokia Missaoui

  2. Mathematisches Institut, Universität Bern, Sidlerstr. 5, 3012, Bern, Switzerland

    Jürg Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuznetsov, S.O., Obiedkov, S. (2006). Counting Pseudo-intents and #P-completeness. In: Missaoui, R., Schmidt, J. (eds) Formal Concept Analysis. Lecture Notes in Computer Science(), vol 3874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671404_21

Download citation

  • DOI: https://doi.org/10.1007/11671404_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32203-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation