New Results on Monotone Dualization and Generating Hypergraph Transversals

@article{Eiter2003NewRO,
  title={New Results on Monotone Dualization and Generating Hypergraph Transversals},
  author={Thomas Eiter and G. Gottlob and K. Makino},
  journal={SIAM J. Comput.},
  year={2003},
  volume={32},
  pages={514-537}
}
We consider the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph) whose associated decision problem is a prominent open problem in NP-completeness. We present a number of new polynomial time, respectively, output-polynomial time results for significant cases, which largely advance the tractability frontier and improve on previous results. Furthermore, we show that duality of two monotone CNFs can be disproved with limited nondeterminism. More… Expand
On the complexity of monotone dualization and generating minimal hypergraph transversals
TLDR
The decomposition technique can be thought of as a generalization of that of Fredman and Khachiyan, and yields stronger bounds on the sequential complexity of the problem in the case when the sizes of f and g are significantly different, and allows for generating all minimal transversals of a given hypergraph using only polynomial space. Expand
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
TLDR
It is shown that none of the new algorithms improving the sequential method is output-polynomial, by proving lower bounds for all three algorithms. Expand
Resolution based algorithms for the transversal hypergraph generation problem
TLDR
A novel algorithm for the problem of hypergraph duality, given a hypergraph H, is given based on the notion of subtransversal, and it is shown how to compute the residual dual of H given a subset E of its minimal transversals. Expand
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
TLDR
This paper uses an Apriori approach to obtain FPT results for generating all maximal independent sets of a hypergraph, all minimaltransversals of ahypergraph, and all maximal frequent sets where parameters bound the intersections or unions of edges. Expand
Some fixed-parameter tractable classes of Dual and related problems ⋆
In this paper we present fixed-parameter algorithms for the problem Dual—given two hypergraphs, decide if one is the transversal hypergraph of the other—and related problems. In the first part, weExpand
Computational aspects of monotone dualization: A brief survey
TLDR
This paper focuses on the famous paper by Fredman and Khachiyan, which showed that the dualization of monotone disjunctive normal forms is solvable in quasi-polynomial time (and thus most likely not co-NP-hard), as well as on follow-up works. Expand
Combinatorial Results on Directed Hypergraphs for the SAT Problem
TLDR
This paper approaches the SAT problem by searching a transversal of the directed hypergraphs associated to its instance and reveals a new degree of a CNF formula unsatisfiability and a structural result about unsatisfiable formulae. Expand
On the fixed-parameter tractability of the equivalence test of monotone normal forms
TLDR
It is shown that Monet is in FPT by giving fixed-parameter algorithms for different parameters by examining the parameterized complexity of Monet. Expand
Hypergraph Transversal Computation and Related Problems in Logic and AI
TLDR
This paper addresses the problem of generating minimal transversals of a hypergraph and its decisional variant, i.e., the recognition of the transversal hypergraph for another hypergraph, and surveys some results on problems which are known to be related to computing the transVERSal hyper graph, where it focuses on problems in propositional Logic and AI. Expand
Partial Enumeration of Minimal Transversals of a Hypergraph
TLDR
This paper proposes the first approach to deal with enumeration problems with huge number of solutions, when interesting- ness measures are not known, to partially enumerate the solutions, i.e. to enumerate only a representative sample of the set of all solutions. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 41 REFERENCES
Exact Transversal Hypergraphs and Application to Boolean µ-Functions
  • Thomas Eiter
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 1994
TLDR
It is shown that hypergraphs are recognizable in polynomial time and that their minimal transversals as well as their maximal independent sets can be generated in lexicographic order withPolynomial delay between subsequent outputs, which is impossible in the general case unless P= NP. Expand
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
TLDR
It is shown that for an arbitrary hypergraph the families of multiple and partial transversals are both dual-bounded in the sense that the size of the corresponding dual hypergraph is bounded by a polynomial in the cardinality and the length of description of the input hypergraph. Expand
Generating all maximal independent sets of bounded-degree hypergraphs
TLDR
This work shows that any monotone function with a read-k CNF representation can be learned in terms of its DNF representation with membership queries alone in time polynomial in the DNF size and n assuming k is some fixed constant. Expand
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
TLDR
It is implied, in particular, that the problem of incrementally generating minimal integer solutions of a monotone system of linear inequalities can be done in quasi-polynomial time. Expand
Efficient dualization of O(log n)-term monotone disjunctive normal forms
  • K. Makino
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 2003
This paper shows that O(logn)-term monotone disjunctive normal forms (DNFs) φ can be dualized in incremental polynomial time, where n is the number of variables in φ. This improves upon the trivialExpand
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for anExpand
On Horn Envelopes and Hypergraph Transversals
TLDR
It is pointed out that there is a rather unexpected connection between the upper bounding problem and the problem of generating all transversals of a hypergraph, and several related complexity questions are settled. Expand
Satisfiability and self-duality of monotone boolean functions
The problem of determining if a given monotone boolean function is self-dual arises in the areas of artificial intelligence, databases, boolean circuits, graph theory, digital signal analysis, graphExpand
Dual subimplicants of positive Boolean functions
Given a positive Boolean function fand a subset δ of its variables, we give a combinatorial condition characterizing the existence of a prime implicant Dˆof the Boolean dual f d of f having theExpand
Graph Minors. II. Algorithmic Aspects of Tree-Width
We introduce an invariant of graphs called the tree-width, and use it to obtain a polynomially bounded algorithm to test if a graph has a subgraph contractible to H, where H is any fixed planarExpand
...
1
2
3
4
5
...