ICFCA
2010
Springer
13 years 11 months ago
2010
Springer
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 det...