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.

[1]  Jaakko Astola,et al.  Almost all monotone Boolean functions are polynomially learnable using membership queries , 2001, Inf. Process. Lett..

[2]  Vladimir Gurvich,et al.  On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets , 2002, STACS.

[3]  Christos H. Papadimitriou,et al.  Incremental Recompilation of Knowledge , 1994, AAAI.

[4]  Toshihide Ibaraki,et al.  Decision lists and related Boolean functions , 2002, Theor. Comput. Sci..

[5]  Kazuhisa Makino,et al.  On computing all abductive explanations , 2002, AAAI/IAAI.

[6]  Georg Gottlob,et al.  New Results on Monotone Dualization and Generating Hypergraph Transversals , 2003, SIAM J. Comput..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Ronald Fagin,et al.  On the semantics of updates in databases , 1983, PODS.

[9]  Leonid Khachiyan,et al.  On the Complexity of Dualization of Monotone Disjunctive Normal Forms , 1996, J. Algorithms.

[10]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[11]  Leonard Pitt,et al.  Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries , 1999, Machine Learning.

[12]  Vladimir Gurvich,et al.  An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension , 2000, Parallel Process. Lett..

[13]  Donald Nute,et al.  Counterfactuals , 1975, Notre Dame J. Formal Log..

[14]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[15]  Dimitrios Gunopulos,et al.  Data mining, hypergraph transversals, and machine learning (extended abstract) , 1997, PODS.

[16]  Toshihide Ibaraki,et al.  Complexity of Identification and Dualization of Positive Boolean Functions , 1995, Inf. Comput..

[17]  Hector J. Levesque,et al.  Abductive and Default Reasoning: A Computational Core , 1990, AAAI.

[18]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[19]  Toshihide Ibaraki,et al.  A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions , 1995, J. Algorithms.

[20]  Leonard Pitt,et al.  Generating all maximal independent sets of bounded-degree hypergraphs , 1997, COLT '97.

[21]  Ramesh Krishnamurti,et al.  Self-Duality of Bounded Monotone Boolean Functions and Related Problems , 2000, ALT.

[22]  Bart Selman,et al.  Reasoning With Characteristic Models , 1993, AAAI.

[23]  Peter Gärdenfors,et al.  Knowledge in Flux , 1988 .

[24]  Ronald Fagin,et al.  Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.

[25]  Heikki Mannila,et al.  Design by Example: An Application of Armstrong Relations , 1986, J. Comput. Syst. Sci..

[26]  Bernhard Nebel,et al.  How Hard is it to Revise a Belief Base , 1996 .

[27]  Dimitrios Gunopulos,et al.  Data mining, hypergraph transversals, and machine learning (extended abstract) , 1997, PODS '97.

[28]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[29]  Toshihide Ibaraki,et al.  Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle , 1997, SIAM J. Comput..

[30]  Bernhard Nebel,et al.  A Knowledge Level Analysis of Belief Revision , 1989, KR.

[31]  Georg Gottlob,et al.  Hypertree decompositions and tractable queries , 1998, PODS '99.

[32]  Brian C. Williams,et al.  Diagnosing Multiple Faults , 1987, Artif. Intell..

[33]  Christos H. Papadimitriou,et al.  On Horn Envelopes and Hypergraph Transversals , 1993, ISAAC.

[34]  Judy Goldsmith,et al.  Limited nondeterminism , 1996, SIGA.

[35]  David E. Smith,et al.  Reasoning About Action I: A Possible Worlds Approach , 1987, Artif. Intell..

[36]  Nathan Linial,et al.  Deciding Hypergraph 2-Colourability by H-Resolution , 1985, Theor. Comput. Sci..

[37]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[38]  Marianne Winslett,et al.  Updating logical databases , 1990, Cambridge tracts in theoretical computer science.

[39]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..

[40]  Roni Khardon.  Translating between Horn Representations and their Characteristic Models , 1995, J. Artif. Intell. Res..

[41]  Georg Gottlob,et al.  Physical Impossibility Instead of Fault Models , 1990, AAAI.

[42]  Georg Gottlob,et al.  Investigations on Armstrong relations, dependency inference, and excluded functional dependencies , 1990, Acta Cybern..

[43]  P. Hammer,et al.  Dual subimplicants of positive Boolean functions , 1998 .