Counting pseudo-intents and #p-completeness

Authors:
Sergei O. Kuznetsov;Sergei Obiedkov
Affiliations:
VINITI Institute, Moscow, Russia;University of Pretoria, Pretoria, South Africa
Venue:
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Year:
2006

Citing 2
Cited 12

Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods

AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Some Computational Problems Related to Pseudo-intents

ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Towards the Complexity of Recognizing Pseudo-intents

ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Some notes on pseudo-closed sets

ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
On the complexity of computing generators of closed sets

ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
On the complexity of enumerating pseudo-intents

Discrete Applied Mathematics
Some complexity results about essential closed sets

ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Hardness of enumerating pseudo-intents in the lectic order

ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Publication analysis of the formal concept analysis community

ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Some notes on managing closure operators

ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Computing premises of a minimal cover of functional dependencies is intractable

Discrete Applied Mathematics
Detecting mistakes in binary data tables

Automatic Documentation and Mathematical Linguistics

Quantified Score

Hi-index	0.00

Visualization

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.