Computational aspects of monotone dualization: A brief survey

Discrete Applied Mathematics

Volumn 156, Issue 11, 2008, Pages 2035-2049

  Eiter, Thomas ^a   Makino, Kazuhisa ^b   Gottlob, Georg ^c  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF TOKYO   (Japan)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Combinatorial enumeration; Dualization; Hitting sets; Hypergraphs; Independent sets; Limited nondeterminism; Monotone Boolean functions; Output polynomial algorithms; Polynomial total time; Quasi polynomial time; Self duality; Set coverings; Transversals

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DECISION MAKING; GAME THEORY; NUCLEAR PROPULSION; PARALLEL ALGORITHMS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; RESEARCH; SURVEYS;

COMPUTATIONAL ASPECTS; COMPUTATIONAL RESULTS; CONJUNCTIVE NORMAL FORM (CNF); LEARNING-BASED ALGORITHMS; LIMITED NONDETERMINISM; NORMAL FORM (NF); NP-HARD; POLYNOMIAL-TIME; PROBABILISTIC COMPUTATION; QUASI-POLYNOMIAL TIME;

LEARNING ALGORITHMS;

EID: 47549090600     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.04.017     Document Type: Article

References (95)

1. Angluin D. Queries and concept learning. Mach. Learn. 2 (1996) 319-342
2. Angluin D., Frazier M., and Pitt L. Learning conjunctions of Horn clauses. Mach. Learn. 9 (1992) 147-164
3. J. Bailey, T. Manoukian, K. Ramamohanarao, A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns, in: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), December 19-22, 2003, Melbourne, Florida, USA, IEEE Computer Society, 2003, pp. 485-488.
4. Benzaken C. Algorithme de dualisation d'une fonction booléenne. Revue Francaise de Traitment de l'Information - Chiffres 9 2 (1966) 119-128
5. C. Berge, Hypergraphs, North Holland Mathematical Library, vol. 45, Elsevier, North-Holland, Amsterdam, 1989.
6. Bertalozzi P., and Sassano A. An O (mn) algorithm for regular set-covering problems. Theoret. Comput. Sci. 54 (1987) 237-247
7. Bioch J.C. Dualization, decision lists and identification of monotone discrete functions. Ann. Math. Artificial Intelligence 24 1-4 (1998) 69-91
8. Bioch J.C., and Ibaraki T. Complexity of identification and dualization of positive Boolean functions. Inform. Comput. 123 (1995) 50-63
9. Boros E., Elbassioni K.M., Gurvich V., and Khachiyan L. An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension. Parallel Process. Lett. 10 4 (2000) 253-266
10. Boros E., Elbassioni K.M., Gurvich V., and Khachiyan L. Generating dual-bounded hypergraphs. Optim. Methods Software 17 5 (2002) 749-781
11. E. Boros, K.M. Elbassioni, V. Gurvich, L. Khachiyan, An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals, in: G.D. Battista, U. Zwick (Eds.), Proceedings of the 11th Annual European Symposium on Algorithms (ESA 2003), Lecture Notes in Computer Science, vol. 2832, Budapest, Hungary, September 16-19, 2003, Springer, Berlin, 2003, pp. 556-567.
12. Boros E., Elbassioni K.M., Gurvich V., and Khachiyan L. An inequality for polymatroid functions and its applications. Discrete Appl. Math. 131 2 (2003) 255-281
13. E. Boros, K.M. Elbassioni, V. Gurvich, L. Khachiyan, A global algorithm for finding all minimal transversals of hypergraphs of bounded edge-size, Technical Report DIMACS 2004-31, Rutgers University, 2004.
14. E. Boros, K.M. Elbassioni, V. Gurvich, L. Khachiyan, Computing many maximal independent sets for sparse hypergraphs in parallel, Technical Report RUTCOR RRR 33-2004, Rutgers University, October 2004.
15. E. Boros, K.M. Elbassioni, V. Gurvich, L. Khachiyan, Generating maximal independent sets for hypergraphs with bounded edge-intersections, in: M. Farach-Colton (Ed.), Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN 2004), Lecture Notes in Computer Science, vol. 2976, Buenos Aires, Argentina, April 5-8, 2004, Springer, Berlin, 2004, pp. 488-498.
16. Boros E., Elbassioni K.M., Gurvich V., Khachiyan L., and Makino K. Dual-bounded generating problems: all minimal integer solutions for a monotone system of linear inequalities. SIAM J. Comput. 31 5 (2002) 1624-1643
17. E. Boros, K.M. Elbassioni, V. Gurvich, L. Khachiyan, K. Makino, An intersection inequality for discrete distributions and related generation problem, in: Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), Lecture Notes in Computer Science, vol. 2719, Eindhoven, The Netherlands, June 30-July 4, 2003, Springer, Berlin, 2003.
18. Boros E., Gurvich V., Khachiyan L., and Makino K. Dual-bounded generating problems: partial and multiple transversals of a hypergraph. SIAM J. Comput. 30 6 (2000) 2036-2050
19. Boros E., Gurvich V., Khachiyan L., and Makino K. On maximal frequent and minimal infrequent sets in binary matrices. Ann. Math. Artificial Intelligence 39 3 (2003) 211-221
20. Boros E., Gurvich V., Khachiyan L., and Makino K. Dual-bounded generating problems: weighted transversals of a hypergraph. Discrete Appl. Math. 142 1-3 (2004) 1-15
21. Boros E., Hammer P., Ibaraki T., and Kawakami K. Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle. SIAM J. Comput. 26 (1997) 93-109
22. Crama Y. Dualization of regular Boolean functions. Discrete Appl. Math. 16 (1987) 79-85
23. P. Damaschke, Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, in: R.G. Downey, M.R. Fellows, F.K.H.A. Dehne (Eds.), Proceedings of the First International Workshop on Parameterized and Exact Computation (IWPEC 2004), Lecture Notes in Computer Science, vol. 3162, Bergen, Norway, September 14-17, 2004, Springer, Berlin, 2004, pp. 1-12.
24. Damaschke P. Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoret. Comput. Sci. 351 3 (2006) 337-350
25. Demetrovics J., and Thi V.D. Keys, antikeys and prime attributes. Ann. Univ. Sci. Budapest Sect. Comput. 8 (1987) 35-52
26. C. Domingo, Exact learning of subclasses of CDNF formulas with membership queries, in: J.-Y. Cai, C.K. Wong (Eds.), Proceedings of the 2nd Annual International Conference on Computing and Combinatorics (COCOON '96), Lecture Notes in Computer Science, vol. 1090, Hong Kong, June 17-19, 1996, Springer, Berlin, 1996, pp. 179-188. See also corrigendum: COCOON '97, Lecture Notes in Computer Science, vol. 1276, Springer, Berlin, 1997, pp. 516-520.
27. C. Domingo, Polynomial time algorithms for some self-duality problems, in: G.C. Bongiovanni, D.P. Bovet, G.D. Battista (Eds.), Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC '97), Lecture Notes in Computer Science, vol. 1203, Rome, Italy, March 12-14, 1997, Springer, Berlin, 1997, pp. 171-180.
28. Domingo C., Mishra N., and Pitt L. Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries. Mach. Learn. 37 (1999) 89-110
29. Dong G., and Li J. Mining border descriptions of emerging patterns from dataset pairs. Knowledge Inform. Syst. 8 (2005) 178-202
30. Downey R.G., and Fellows M.R. Parameterized Complexity (1998), Springer, Berlin
31. T. Eiter, On transversal hypergraph computation and deciding hypergraph saturation, Ph.D. Thesis, Institut für Informationssysteme, TU Wien, Austria, 1991.
32. Eiter T. Exact transversal hypergraphs and application to Boolean μ-functions. J. Symbolic Comput. 17 (1994) 215-225
33. Eiter T., and Gottlob G. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24 6 (1995) 1278-1304 Extended paper Technical Report CD-TR 91/16, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, January 1991
34. T. Eiter, G. Gottlob, Hypergraph transversal computation and related problems in logic and AI, in: S. Flesca et al. (Eds.), Proceedings of the 8th European Conference on Logics in Artificial Intelligence-Journées Européennes sur la Logique en Intelligence Artificielle (JELIA 2002), Lecture Notes in Computer Science, vol. 2424, Cosenza, Italy, 2002, Springer, Berlin, 2002, pp. 549-564.
35. T. Eiter, G. Gottlob, K. Makino, New results on monotone dualization and generating hypergraph transversals, in: Proceedings on 34th Annual ACM Symposium on Theory of Computing, Montreal, Canada, May 19-21, 2002, ACM, New York, 2002, pp. 14-22.
36. Eiter T., Gottlob G., and Makino K. New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput. 32 2 (2003) 514-537
37. Eiter T., Ibaraki T., and Makino K. Double Horn functions. Inform. Comput. 144 (1988) 155-190
38. Eiter T., Ibaraki T., and Makino K. Bidual Horn functions and extensions. Discrete Appl. Math. 96-97 (1999) 55-88 Selected for the special volume Discrete Appl. Math. Editors' Choice, Edition 1999
39. T. Eiter, K. Makino, Abduction and the dualization problem, in: G. Grieser, Y. Tanaka, A. Yamamoto (Eds.), Proceedings of the 6th International Conference on Discovery Science (DS 2003), LNCS/LNAI, vol. 2843, Sapporo, Japan, October 17-19, 2003, Springer, Berlin, 2003, pp. 1-20.
40. K.M. Elbassioni, An algorithm for dualization in products of lattices and its applications, in: R.H. Möhring, R. Raman (Eds.), Proceedings of the 10th Annual European Symposium on Algorithms (ESA 2002), Lecture Notes in Computer Science, vol. 2461, Rome, Italy, September 17-21, 2002, Springer, Berlin, 2002, pages 424-435.
41. K.M. Elbassioni, On dualization in products of forests, in: H. Alt, A. Ferreira (Eds.), Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2002), Lecture Notes in Computer Science, vol. 2285, Antibes - Juan les Pins, France, March 14-16, 2002, Springer, Berlin, 2002, pp. 142-153.
42. Fredman M.L., and Khachiyan L. On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21 (1996) 618-628
43. Gainanov D.N. On one criterion of the optimality of an algorithm for evaluating monotonic Boolean functions. U.S.S.R. Comput. Math. Math. Phys. 24 (1984) 176-184
44. D.R. Gaur, R. Krishnamurti, Self-duality of bounded monotone Boolean functions and related problems, in: H. Arimura, S. Jain, A. Sharma (Eds.), Proceedings 11th International Conference on Algorithmic Learning Theory (ALT 2000), Lecture Notes in Computer Science, vol. 1968, Sydney, Australia, December 11-13, 2000, Springer, Berlin, 2000, pp. 209-223.
45. D.R. Gaur, R. Krishnamurti, Average case self-duality of monotone Boolean functions, in: A.Y. Tawfik, S.D. Goodwin (Eds.), Proceedings of the 17th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (Canadian AI 2004), Lecture Notes in Computer Science, vol. 3060, London, Ontario, Canada, May 17-19, 2004, Springer, Berlin, 2004, pp. 322-338.
46. Goldsmith J., Levy M., and Mundhenk M. Limited nondeterminism. SIGACT News 27 2 (1996) 20-29
47. Greiner R., Smith B.A., and Wilkerson R.W. A correction to the algorithm in Reiter's theory of diagnosis. Artificial Intelligence 41 (1990) 79-88
48. Grossi A. Algorithme á seperation de variables pour la dualisation d'une fonctione booléenne. Revue Francaise D'Automatique, Informatique et Recherche B-1 (1974) 41-55
49. D. Gunopulos, R. Khardon, H. Mannila, H. Toivonen, Data mining, hypergraph transversals, and machine learning, in: Proceedings of the 16th ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-96), 1993, pp. 209-216.
50. Gurvich V., and Khachiyan L. On the frequency of the most frequently occurring variable in dual monotone DNFs. Discrete Appl. Math. 169 1-3 (1997) 245-248
51. Gurvich V., and Khachiyan L. On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Discrete Appl. Math. 96-97 (1999) 363-373
52. M. Hagen, Logarithmic space instances of monotone normal form equivalence testing, Technical Report 06-10, Reports on Computer Science, Friedrich-Schiller-Universität Jena, 2006.
53. M. Hagen, Lower bounds for three algorithms for the transversal hypergraph generation, Technical Report 06-08, Reports on Computer Science, Friedrich-Schiller-Universität Jena, 2006.
54. M. Hagen, On the fixed-parameter tractability of the equivalence test of monotone normal forms, Technical Report 06-09, Reports on Computer Science, Friedrich-Schiller-Universität Jena, 2006.
55. G. Hansel, Sur le nombre des fonctions booléennses monotones de n variables, in: Comptes Rendus des Séances de l'Académie des Sciences, vol. 248, Gauthier-Villars, Paris, 1959, pp. 3522-3523.
56. D.S. Johnson, Open and closed problems in NP-completeness, Lecture given at the International School of Mathematics "G. Stampacchia": Summer School "NP-Completeness: The First 20 Years", Erice (Sicily), Italy, June 20-27, 1991.
57. Johnson D.S., Yannakakis M., and Papadimitriou C.H. On generating all maximal independent sets. Inform. Process. Lett. 27 (1988) 119-123
58. Karp R.M., and Wigderson A. A fast parallel algorithm for the maximal independent set problem. J. ACM 32 4 (1985) 762-773
59. D.J. Kavvadias, E.C. Stavropoulos, Evaluation of an algorithm for the transversal hypergraph problem, in: J.S. Vitter, C.D. Zaroliagis (Eds.), Proceedings of the 3rd International Workshop on Algorithm Engineering (WAE '99), Lecture Notes in Computer Science, vol. 1668, London, UK, July 19-21, 1999, Springer, Berlin, 1999, pp. 72-84.
60. 2 n]. Inform. Process. Lett. 85 (2003) 1-6
61. D.J. Kavvadias, E.C. Stavropoulos, Checking monotone Boolean duality with limited nondeterminism, Technical Report TR2003/07/02, Computer Technology Institute, Patras, Greece, July 2003.
62. Kavvadias D.J., and Stavropoulos E.C. An efficient algorithm for the transversal hypergraph generation. J. Graph Algorithms Appl. 9 (2005) 239-264
63. Kean A., and Tsiknis G. An incremental method for generating prime implicants. J. Symbolic Comput. 9 (1990) 185-206
64. L. Khachiyan, E. Boros, K.M. Elbassioni, V. Gurvich, A new algorithm for the hypergraph transversal problem, in: L. Wang (Ed.), Proceedings of the 11th Annual International Conference on Computing and Combinatorics (COCOON 2005), Lecture Notes in Computer Science, vol. 3595, Kunming, China, August 16-29, 2005, Springer, Berlin, 2005, pp. 767-776.
65. Khardon R. Translating between Horn representations and their characteristic models. J. Artificial Intelligence Res. 3 (1995) 349-372
66. Lawler E.L. Covering problems: duality relations and a new method of solution. SIAM J. Appl. Math. 14 5 (1966) 1115-1132
67. Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM J. Comput. 9 (1980) 558-565
68. Lin L., and Jiang Y. The computation of hitting sets: review and new algorithms. Information Process. Lett. 86 4 (2003) 177-184
69. L. Lovász, Coverings and colorings of hypergraphs, in: Proceedings of the 4th Conference on Combinatorics, Graph Theory, and Computing, 1973, pp. 3-12.
70. K. Maghout, Sur la détermination des nombres de stabilité et du nombre chromatique d'un graphe, in: Comptes Rendus des Séances de l'Académie des Sciences, vol. 248, Gauthier-Villars, Paris, 1959, pp. 3522-3523.
71. Makino K. Efficient dualization of O (log n)-term monotone disjunctive normal forms. Discrete Appl. Math. 126 2-3 (2003) 305-312
72. Makino K., and Ibaraki T. The maximum latency and identification of positive Boolean functions. SIAM J. Comput. 26 (1997) 1363-1383
73. Makino K., and Ibaraki T. A fast and simple algorithm for identifying 2-monotonic positive Boolean functions. J. Algorithms 26 (1998) 291-305
74. K. Makino, T. Uno, New algorithms for enumerating all maximal cliques, in: T. Hagerup, J. Katajainen (Eds.), Proceedings of the 9th Scandinavian Workshop on Algorithm Theory on Algorithm Theory (SWAT 2004), Lecture Notes in Computer Science, vol. 3111, Humlebaek, Denmark, July 8-10, 2004, Springer, Berlin, 2004, pp. 260-272.
75. Mannila H., and Räihä K.-J. Algorithms for inferring functional dependencies from relations. Data Knowledge Engrg. 12 1 (1994) 83-99
76. N. Mishra, L. Pitt, Generating all maximal independent sets of bounded-degree hypergraphs, in: Proceedings of the 10th Annual Conference on Computational Learning Theory (COLT), 1997, pp. 211-217.
77. C. Papadimitriou, NP-completeness: a retrospective, in: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP '97), Lecture Notes in Computer Science, vol. 1256, 1997, pp. 2-6.
78. Peled U., and Simeone B. Polynomial-time algorithms for regular set-covering and threshold synthesis. Discrete Appl. Math. 12 (1985) 57-69
79. Peled U., and Simeone B. An O (nm)-time algorithm for computing the dual of a regular Boolean function. Discrete Appl. Math. 49 (1994) 309-323
80. Reiter R. A theory of diagnosis from first principles. Artificial Intelligence 32 (1987) 57-95
81. B. Roy, Algébre moderne et Thèorie des graphes, vol. II, Dunod, Paris, 1970.
82. Rymon R. An SE-tree-based prime implicant generation algorithm. Ann. Math. Artificial Intelligence 11 1-4 (1994) 351-366
83. Seymour P.D. On the two-coloring of hypergraphs. Quart. J. Math. Oxford 25 (1974) 303-312
84. Shmulevich I., Korshunov A.D., and Astola J. Almost all monotone Boolean functions are polynomially learnable using membership queries. Inform. Process. Lett. 79 5 (2001) 211-213
85. Slagle J., Chang C., and Lee R. A new algorithm for generating prime implicants. IEEE Trans. Comput. C-19 4 (1970) 304-310
86. Sokolov N.A. On the optimal evaluation of monotonic Boolean functions. U.S.S.R. Comput. Math. Math. Phys. 22 (1982) 207-220
87. K. Takata, On the sequential method for listing minimal hitting sets, in: Proceedings Workshop on Discrete Mathematics and Data Mining, 2nd SIAM International Conference on Data Mining, April 11-13, Arlington, Virginia, USA, 2002.
88. H. Tamaki, Space-efficient enumeration of minimal transversals of a hypergraph, in: Proceedings of the 75th SIGAL Conference of the Information Processing Society of Japan, IPSJ, 2000, pp. 29-36. Extended paper available from the author.
89. Torvik V.I., and Triantaphyllou E. Minimizing the average query complexity of learning monotone Boolean functions. INFORMS J. Comput. 14 2 (2002) 144-174
90. Tsukiyama S., Ide M., Ariyoshi H., and Shirakawa I. A new algorithm for generating all maximal independent sets. SIAM J. Comput. 6 (1977) 505-517
91. T. Uno, A practical fast algorithm for enumerating minimal set coverings, in: Proceedings of the 83rd SIGAL Conference of the Information Processing Society of Japan, Toyko, March 15, 2002, IPSJ, 2002, pp. 9-16 (in Japanese).
92. T. Uno, K. Satoh, Detailed description of an algorithm for enumeration of maximal frequent sets with irredundant dualization, in: B. Goethals, M.J. Zaki (Eds.), Proceedings Workshop on Frequent Itemset Mining Implementations (FIMI '03) at ICDM 2003, CEUR Workshop Proceedings, vol. 90, December 19, 2003, Melbourne, Florida, USA, CEUR-WS.org, 2003.
93. Valiant L. The complexity of enumeration and reliability problems. SIAM J. Comput. 8 (1979) 410-421
94. Valiant L. A theory of the learnable. Comm. ACM 27 11 (1984) 1134-1142
95. Wotawa F. A variant of Reiter's hitting-set algorithm. Inform. Process. Lett. 79 1 (2001) 45-51