On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
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
Completing description logic knowledge bases using formal concept analysis
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Counting pseudo-intents and #p-completeness
ICFCA'06 Proceedings of the 4th 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
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
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents determine whether they are the lectically first n pseudo-intents. We show that this problem is coNP-hard. We thereby show that there cannot be an algorithm with a good theoretical complexity for enumerating pseudo-intents in a lectic order. In a second part of the paper we introduce the notion of minimal pseudo-intents, i. e. pseudo-intents that do not strictly contain a pseudo-intent. We provide some complexity results about minimal pseudo-intents that are readily obtained from the previous result.