论文信息 - Recognizing Pseudo-intents is coNP-complete

Recognizing Pseudo-intents is coNP-complete

The problem of recognizing whether a subset of attributes is a pseudo-intent is shown to be coNP-hard, which together with the previous results means that this problem is coNP-complete. Recognizing an essential intent is shown to be NP-complete and recognizing the lectically largest pseudo-intent is shown to be coNP-hard.

Sergei O. Kuznetsov | Mikhail A. Babin | S. Kuznetsov | M. Babin

[1] Felix Distel. Hardness of Enumerating Pseudo-intents in the Lectic Order , 2010, ICFCA.

[2] Bernhard Ganter,et al. Formal Concept Analysis: Mathematical Foundations , 1998 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] Sergei O. Kuznetsov,et al. Counting Pseudo-intents and #P-completeness , 2006, ICFCA.

[5] Baris Sertkaya,et al. Towards the Complexity of Recognizing Pseudo-intents , 2009, ICCS.

[6] Sergei O. Kuznetsov,et al. Some decision and counting problems of the Duquenne-Guigues basis of implications , 2008, Discret. Appl. Math..

[7] Baris Sertkaya. Some Computational Problems Related to Pseudo-intents , 2009, ICFCA.

[8] Vincent Duquenne,et al. Familles minimales d'implications informatives résultant d'un tableau de données binaires , 1986 .