Version spaces and the consistency problem
Artificial Intelligence
The many benefits of putting stack filters into disjunctive or conjunctive normal form
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
On the fixed-parameter tractability of the equivalence test of monotone normal forms
Information Processing Letters
On the complexity of the multiplication method for monotone CNF/DNF dualization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
On the complexity of monotone dualization and generating minimal hypergraph transversals
Discrete Applied Mathematics
Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
Some Computational Problems Related to Pseudo-intents
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
The many benefits of putting stack filters into disjunctive or conjunctive normal form
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
On the fractional chromatic number of monotone self-dual Boolean functions
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Some fixed-parameter tractable classes of hypergraph duality and related problems
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
On the complexity of enumerating pseudo-intents
Discrete Applied Mathematics
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
How to apply SAT-solving for the equivalence test of monotone normal forms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Enumeration of minimal dominating sets and variants
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
A parallel algorithm for computing borders
Proceedings of the 20th ACM international conference on Information and knowledge management
About the enumeration algorithms of closed sets
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
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 precisely, this is feasible in polynomial time with O(log2 n/\log log n) suitably guessed bits. This result sheds new light on the complexity of this important problem.