@article{keyhere, 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 Turingequivalent to a #P-complete problem.}, author = {Kuznetsov, Sergei and Obiedkov, Sergei}, interhash = {621d51fff81b1ed566607b7e18480dbc}, intrahash = {de0a8419ab5d374012b9d05498f840b0}, journal = {Formal Concept Analysis}, pages = {306--308}, title = {Counting Pseudo-intents and #P-completeness}, url = {http://dx.doi.org/10.1007/11671404_21}, year = 2006 }