Algorithms for the Construction of Concept Lattices and Their Diagram Graphs
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Attribute-incremental construction of the canonical implication basis
Annals of Mathematics and Artificial Intelligence
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
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
Uncovering and reducing hidden combinatorics in guigues-duquenne bases
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Counting pseudo-intents and #p-completeness
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Applying the JBOS reduction method for relevant knowledge extraction
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
We examine the enumeration problem for essential closed sets of a formal context. Essential closed sets are sets that can be written as the closure of a pseudo-intent. The results for enumeration of essential closed sets are similar to existing results for pseudo-intents, albeit some differences exist. For example, while it is possible to compute the lectically first pseudo-intent in polynomial time, we show that it is not possible to compute the lectically first essential closed set in polynomial time unless P = NP. This also proves that essential closed sets cannot be enumerated in the lectic order with polynomial delay unless P = NP. We also look at minimal essential closed sets and show that they cannot be enumerated in output polynomial time unless P = NP.