Hardness of Enumerating Pseudo-intents in the Lectic Order

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 coNPhard. 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 pseudointents, 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.

• Type: Conference
• Year: 2010
• Where: ICFCA
• Authors: Felix Distel
• Keywords: Formal Context, Formal Languages, ICFCA 2010, Lectic Order, Minimal Pseudointents