Some computational problems related to pseudo-intents

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

Volumn 5548 LNAI, Issue , 2009, Pages 130-145

  Sertkaya, Bariş ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITY; COMPUTATIONAL PROBLEM; COUNTING PROBLEMS; FORMAL CONTEXTS; HYPERGRAPH; MINIMAL SUBSET; NP COMPLETE; P-COMPLETE; POLYNOMIAL-TIME;

DISTRIBUTED COMPUTER SYSTEMS; POLYNOMIAL APPROXIMATION; SET THEORY;

COMPUTATIONAL COMPLEXITY;

EID: 67650481188     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01815-2_11     Document Type: Conference Paper

References (21)

1. +. In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS, vol. 4667, pp. 52-67. Springer, Heidelberg (2007).
2. Berge, C.: Hypergraphs. Elsevier Science Publishers B.V, North Holland (1989).
3. Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. 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. Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM J. on Computing 32(2), 514-537 (2003).
6. Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. of Algorithms 21(3), 618-628 (1996).
7. Ganter, B.: Two basic algorithms in concept analysis. Technical Report Preprint-Nr. 831, Technische Hochschule Darmstadt, Darmstadt, Germany (1984).
8. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999).
9. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Company, New York (1990).
10. 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).
11. Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: Proc. of the Sixteenth Symposium on Principles of Database Systems (PODS 1997), pp. 209-216 (1997).
12. Hemaspaandra, L.A., Vollmer, H.: The satanic notations: counting classes beyond #P and other definitional adventures. ACM SIGACT-Newsletter 26(1), 2-13 (1995).
13. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Information Processing Letters 27(3), 119-123 (1988).
14. Kuznetsov, S.O.: On the intractability of computing the Duquenne-Guigues Base. J. 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.) ICFCA 2006. 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. Mannila, H., Räihä, K.-J.: Design by example: An application of armstrong relations. J. of Computer and System Sciences 33(2), 126-141 (1986).
18. Obiedkov, S.A., Duquenne, V.: Attribute-incremental construction of the canonical implication basis. Annals of Mathematics and AI 49(1-4), 77-99 (2007).
19. Rudolph, S.: Some notes on pseudo-closed sets. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS, vol. 4390, pp. 151-165. Springer, Heidelberg (2007).
20. Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8(2), 189-201 (1979).
21. Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. on Computing 8(3), 410-421 (1979).