The design of relational databases
The design of relational databases
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On Horn Envelopes and Hypergraph Transversals
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Theory of Relational Databases
Theory of Relational Databases
Some decision and counting problems of the Duquenne-Guigues basis of implications
Discrete Applied Mathematics
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 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
Two basic algorithms in concept analysis
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
| Hi-index | 0.00 |
It is widely known that closure operators on finite sets can be represented by sets of implications (also known as inclusion dependencies) as well as by formal contexts. In this paper we survey known results and present new findings concerning time and space requirements of diverse tasks for managing closure operators, given in contextual, implicational, or black-box representation. These tasks include closure computation, size minimization, finer-coarser-comparison, modification by "adding" closed sets or implications, and conversion from one representation into another.