Towards the complexity of recognizing pseudo-intents

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5662 LNAI, Issue , 2009, Pages 284-292

  Sertkaya, Bariş ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; COMPLEXITY CLASS; DECISION PROBLEMS; FORMAL CONCEPT ANALYSIS; FORMAL CONTEXTS; HYPERGRAPH; HYPERGRAPH THEORY; LEXICOGRAPHIC ORDER; LOWER BOUNDS; OPEN PROBLEMS; POLYNOMIAL ALGORITHM; POLYNOMIAL-TIME;

POLYNOMIAL APPROXIMATION; SEMANTIC WEB; SEMANTICS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 76649091235     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03079-6_22     Document Type: Conference Paper

References (19)

1. Berge, C.: Hypergraphs. Elsevier Science Publishers B.V, North Holland (1989)
2. Duquenne, V.: The core of finite lattices. Discrete Mathematics 88, 133-147 (1991)
3. Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24(6), 1278-1304 (1995)
4. Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS, vol. 2424, pp. 549-564. Springer, Heidelberg (2002)
5. Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms 21(3), 618-628 (1996)
6. Ganter, B.: Two basic algorithms in concept analysis. Technical Report Preprint-Nr. 831, Technische Hochschule Darmstadt, Darmstadt, Germany (1984)
7. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)
8. Goldsmith, J., Levy, M., Mundhenk, M.: Limited nondeterminism. SIGACT 27(2), 20-29 (1978)
9. Guigues, J.-L., Duquenne, V.: Familles minimales d'implications informatives resultant d'un tableau de données binaries. Mathématiques, Informatique et Sciences Humaines 95, 5-18 (1986)
10. Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: Proceedings of the Sixteenth Symposium on Principles of Database Systems (PODS 1997), pp. 209-216 (1997)
11. Janssen, P., Nourine, L.: Minimum implicational basis for meet-semidistributive lattices. Information Processing Letters 99(5), 199-202 (2006)
12. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Information Processing Letters 27(3), 119-123 (1988)
13. Kavvadias, D.J., Papadimitriou, C.H., Sideri, M.: On horn envelopes and hyper-graph transversals. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol. 762, pp. 399-405. Springer, Heidelberg (1993)
14. Kuznetsov, S.O.: On the intractability of computing the Duquenne-Guigues Base. Journal of Universal Computer Science 10(8), 927-933 (2004)
15. Kuznetsov, S.O., Obiedkov, S.A.: Counting pseudo-intents and #P-completeness. In: Missaoui, R., Schmidt, J. (eds.) Formal Concept Analysis. LNCS, vol. 3874, pp. 306-308. Springer, Heidelberg (2006)
16. Kuznetsov, S.O., Obiedkov, S.A.: Some decision and counting problems of the Duquenne-Guigues basis of implications. Discrete Applied Mathematics 156(11), 1994-2003 (2008)
17. Obiedkov, S.A., Duquenne, V.: Attribute-incremental construction of the canonical implication basis. Annals of Mathematics and Artificial Intelligence 49(1-4), 77-99 (2007)
18. Sertkaya, B.: Some computational problems related to pseudo-intents. In: Ferré, S., Rudolph, S. (eds.) Proceedings of the 7th International Conference on Formal Concept Analysis (ICFCA 2009). LNCS (LNAI), vol. 5548, pp. 130-145. Springer, Heidelberg (2009)
19. Wild, M.: Optimal implicational bases for finite modular lattices. Quaestiones Mathematicae 23, 153-161 (2000)