Hypergraph Transversal Computation and Related Problems in Logic and AI
Generating minimal transversals of a hypergraph is an important problem which has many applications in Computer Science. In the present paper, we address this problem and its decisional variant, i.e., the recognition of the transversal hypergraph for another hypergraph. We survey some results on problems which are known to be related to computing the transversal hypergraph, where we focus on problems in propositional Logic and AI. Some of the results have been established already some time ago, and were announced but their derivation was not widely disseminated. We then address recent developments on the computational complexity of computing resp. recognizing the transversal hypergraph. The precise complexity of these problems is not known to date, and is in fact open for more than 20 years now.
KeywordsPolynomial Time Boolean Function Conjunctive Query Membership Query Negative Clause
Unable to display preview. Download preview PDF.
- 6.E. Boros, V. Gurvich, L. Khachiyan, and K. Makino. On the complexity of generating maximal frequent and minimal infrequent sets. In Proc. STACS-02, LNCS 2285, pp. 133–141, 2002.Google Scholar
- 10.T. Eiter. On Transversal Hypergraph Computation and Deciding Hypergraph Saturation. PhD thesis, Institut für Informationssysteme, TU Wien, Austria, 1991.Google Scholar
- 12.T. Eiter, G. Gottlob, and K. Makino. New results on monotone dualization and generating hypergraph transversals. In Proc. ACM STOC-2002, pp. 14–22, 2002. Full paper Tech. Rep. INFSYS RR-1843-02-05, TU Wien. Available as Computer Science Repository Report (CoRR) nr. cs.DS/0204009 via URL: http://arxiv.org/abs/cs/0204009.
- 13.T. Eiter and K. Makino. On computing all abductive explanations. In Proc. 18th National Conference on Artificial Intelligence (AAAI’ 02). AAAI Press, 2002.Google Scholar
- 16.R. Fagin, J. D. Ullman, and M. Y. Vardi. On the semantics of updates in databases. In Proc. PODS-83, pp. 352–365, 1983.Google Scholar
- 18.G. Friedrich, G. Gottlob, and W. Nejdl. Physical negation instead of fault models. In Proc. AAAI-91, July 1990.Google Scholar
- 19.P. Gärdenfors. Knowledge in Flux. Bradford Books, MIT Press, 1988.Google Scholar
- 21.D. Gaur and R. Krishnamurti. Self-duality of bounded monotone Boolean functions and related problems. In Proc. 11th International Conference on Algorithmic Learning Theory (ALT), LNCS 1968, pp. 209–223. Springer, 2000.Google Scholar
- 26.G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. In Proc. 18th ACM Symp. on Principles of Database Systems (PODS-99), pp. 21–32, 1999. Full paper to appear in Journal of Computer and System Sciences.Google Scholar
- 28.D. Gunopulos, R. Khardon, H. Mannila, and H. Toivonen. Data mining, hypergraph transversals, and machine learning. In Proc. 16th ACM Symp. on Principles of Database Systems (PODS-97), pp. 209–216, 1997.Google Scholar
- 29.D. S. Johnson. A Catalog of Complexity Classes. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, A, chapter 2. Elsevier, 1990.Google Scholar
- 31.H. Kautz, M. Kearns, and B. Selman. Reasoning with characteristic models. In Proc. AAAI-93, pp. 34–39, 1993.Google Scholar
- 32.D. Kavvadias, C. Papadimitriou, and M. Sideri. On Horn envelopes and hypergraph transversals. In W. Ng, editor, Proc. 4th International Symposium on Algorithms and Computation (ISAAC-93), LNCS 762, pp. 399–405, 1993.Google Scholar
- 37.N. Mishra and L. Pitt. Generating all maximal independent sets of boundeddegree hypergraphs. In Proc. Tenth Annual Conference on Computational Learning Theory (COLT-97), pp. 211–217, 1997.Google Scholar
- 38.B. Nebel. A knowledge level analysis of belief revision. In Proc. 1st Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR-89), pp. 301–311, 1989.Google Scholar
- 39.B. Nebel. How Hard is it to Revise a Belief Base? In D. Gabbay and Ph. Smets, eds, Handbook on Defeasible Reasoning and Uncertainty Management Systems, volume III: Belief Change, pp. 77–145. Kluwer Academic, 1998.Google Scholar
- 40.C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google Scholar
- 42.B. Selman and H. J. Levesque. Abductive and default reasoning: A computational core. In Proc. AAAI-90, pp. 343–348, 1990.Google Scholar
- 44.K. Takata. On the sequential method for listing minimal hitting sets. In Proc. Workshop on Discrete Mathematics and Data Mining, 2nd SIAM International Conference on Data Mining, April 11–13, Arlington, Virginia, USA, 2002.Google Scholar
- 45.M. Winslett. Updating Logical Databases. Cambridge University Press, 1990.Google Scholar