Recognizing pseudo-intents is coNP-complete

CEUR Workshop Proceedings

Volumn 672, Issue , 2010, Pages 294-301

  Babin, Mikhail A ^a   Kuznetsov, Sergei O ^a  

^a NATIONAL RESEARCH UNIVERSITY HIGHER SCHOOL OF ECONOMICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

NP COMPLETE;

INFORMATION ANALYSIS;

EID: 84889567832     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. B. Ganter and R. Wille, Formal Concept Analysis: Mathematical Foundations; Springer, Berlin (1999).
2. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness; Freeman, San Francisco (1979).
3. J. L. Guigues and V. Duquenne, Familles minimales d'implications informatives resultant d'un tableau de donnees binaries, Mathematiques, Informatique et Sciences Humaines; 95:5-18, (1986).
4. S. O. Kuznetsov and S. A. Obiedkov, Counting pseudo-intents and #Pcompleteness. In R. Missaoui and J. Schmid, Eds, ICFCA 2006,Lecture Notes in Computer Science, vol. 3874, 306-308, Springer-Verlag, (2006).
5. S. O. Kuznetsov and S. A. Obiedkov, Some decision and counting problems of the duquenne-guigues basis of implications, Discrete Applied Mathematics, 156(11):1994-2003, (2008).
6. B. Sertkaya, Towards the complexity of recognizing pseudo-intents, In F. Dau and S. Rudolph, Eds, ICCS 2009, Lecture Notes in Computer Science, vol. 5662, 284-292, Springer-Verlag, (2009)
7. B. Sertkaya, Some computational problems related to pseudo-intents, In S. Ferre and S. Rudolph, Eds, ICFCA 2009, Lecture Notes in Computer Science, vol. 5662, 284-292, Springer-Verlag, (2009)
8. F. Distel, Hardness of enumerating pseudo-intents in the lectic order. In L. Kwuida and B. Sertkaya, Eds, ICFCA 2010, Lecture Notes in Artificial Intelligence, vol. 5986, 124-137, Springer-Verlag, (2010)