Functional dependencies in Horn theories
Artificial Intelligence
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Machine Learning on the Basis of Formal Concept Analysis
Automation and Remote Control
Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data
Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data
Some decision and counting problems of the Duquenne-Guigues basis of implications
Discrete Applied Mathematics
Master Data Management
Towards the Complexity of Recognizing Pseudo-intents
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Some notes on pseudo-closed sets
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
On the complexity of enumerating pseudo-intents
Discrete Applied Mathematics
Hardness of enumerating pseudo-intents in the lectic order
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Counting pseudo-intents and #p-completeness
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Detecting mistakes in binary data tables
Automatic Documentation and Mathematical Linguistics
| Hi-index | 0.04 |
The problem of recognizing whether a subset of attributes is a premise of a minimal cover of functional dependencies of a relation is shown to be coNP-complete. The complexity of some related decision, enumerating, and sampling problems on functional dependencies, FCA implications, and closed sets of attributes is discussed.