Computational aspects of monotone dualization: A brief survey

@article{Eiter2008ComputationalAO,
  title={Computational aspects of monotone dualization: A brief survey},
  author={Thomas Eiter and Kazuhisa Makino and Georg Gottlob},
  journal={Discret. Appl. Math.},
  year={2008},
  volume={156},
  pages={2035-2049}
}
Dualization of a monotone Boolean function represented by a conjunctive normal form (CNF) is a problem which, in different disguise, is ubiquitous in many areas including Computer Science, Artificial Intelligence, and Game Theory to mention some of them. It is also one of the few problems whose precise tractability status (in terms of polynomial-time solvability) is still unknown, and now open for more than 25 years. In this paper, we briefly survey computational results for this problem, where… Expand
Speeding up Dualization in the Fredman-Khachiyan Algorithm B
TLDR
This work investigates the use of the FK-B algorithm for the computation of the dual of a monotone Boolean function, and presents practical improvements to its performance, and describes a simple memoization technique that avoids the solution of multiple identical subproblems. Expand
Algorithmic and Computational Complexity Issues of MONET
TLDR
Several restricted classes of Monet are shown to be solvable in logarithmic space, which improves previously known polynomial time bounds and shows Monet to be in the complexity class of fixed-parameter tractable problems with respect to several parameters. 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
Achieving new upper bounds for the hypergraph duality problem through logic
TLDR
This paper develops a new nondeterministic algorithm for DUAL that requires to guess O(log2 n) bits and forms its deterministic part in FO(COUNT), i.e., first order logic augmented by counting quantifiers. Expand
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
  • G. Gottlob
  • Mathematics, Computer Science
  • PODS '13
  • 2013
TLDR
It is shown that duality testing for hypergraphs, and thus for monotone DNFs, is feasible in DSPACE(log2 n), i.e., in quadratic logspace, and that whenever, for a Boolean-valued relation, a number of maximal frequent itemsets and anumber of minimal infrequent itemsets are known, then it can be decided in quadRatic log space whether there exist additional frequent or infrequent itemets. Expand
A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem
TLDR
It is shown that the connectivity problem for bijunctive relations can be solved in O(min{n|φ|, T (n)}) time, where n denotes the number of variables, φ denotes the corresponding 2-CNF formula, and T ( n) denotes the time needed to compute the transitive closure of a directed graph of n vertices. Expand
Extending Set-based Dualization: Application to Pattern Mining
TLDR
A weak representation as sets for pattern mining problems is introduced which extends the RAS class to a wider and significantly larger class of problems, called WRAS, and identifies EWRAS, an efficient subclass of WRAS for which the dualization problem is still quasi-polynomial. Expand
On Berge Multiplication for Monotone Boolean Dualization
TLDR
Weshow that for any monotone CNF φ, Berge multiplication can be done in subexponential time, and for many interestingsubclasses of monotones C NF's such as CNF's with bounded size, bounded degree, bounded intersection, bounded conformality, and read-once formula, it can bedone in polynomial or quasi-polynomialtime. Expand
Structural and computational aspects of simple and influence games
Simple games are a fundamental class of cooperative games. They have a huge relevance in several areas of computer science, social sciences and discrete applied mathematics. The algorithmic andExpand
Polynomially solvable cases of hypergraph transversal and related problems
  • I. Rauf
  • Computer Science, Mathematics
  • 2011
TLDR
The hypergraph transversal problem is shown to be solvable in output polynomial time for a number of hypergraph classes, and tight sublinear upper bounds on the readability of a monotone Boolean function given in CNF (or DNF) form are given, parameterized by the number of terms in the CNF and the maximum number of variables in the intersection of any constant number of Terms. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 97 REFERENCES
Self-Duality of Bounded Monotone Boolean Functions and Related Problems
TLDR
The equivalence between the problem of determining self-duality of a boolean function in DNF and a special type of satisfiability problem called NAESPI is shown and it is shown that c-bounded NAesPI can be solved in polynomial time when c is some constant. Expand
Monotone Boolean dualization is in co-NP[log2n]
TLDR
A modified version of Fredman and Khachiyan's algorithm requires deterministic polynomial time plus O( log2 n) nondeterministic guesses, thus placing the problem in the class co-NP[log2 n]. Expand
Generating dual-bounded hypergraphs
TLDR
This article surveys some recent results on the generation of implicitly given hypergraphs and their applications in Boolean and integer programming, data mining, reliability theory, and combinatorics and considers the problem of incrementally generating the family F π of all minimal subsets satisfying property ~. Expand
New Results on Monotone Dualization and Generating Hypergraph Transversals
TLDR
It is shown that duality of two monotone CNFs can be disproved with limited nondeterminism and feasible in polynomial time with O(log2 n/\log log n) suitably guessed bits. Expand
Polynominal Time Algorithms for Some Self-Duality Problems
TLDR
This paper exhibits polynomial time algorithms for testing self-duality for several natural classes of formulas where the problem was not known to be solvable. Expand
A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function
TLDR
This algorithm uses the Hop-Skip-and-Jump algorithm to give an explicit expression for the irredundant DNF of ƒd in terms of the one for Ɠ, and can be applied to solve regular set-covering problems in O(nm) time. Expand
Minimizing the Average Query Complexity of Learning Monotone Boolean Functions
TLDR
The unbiased empirical results show that an implementation of the subroutine considered as a standard in the literature performs almost twice as many queries as the evaluative criterion on the average. Expand
Abduction and the Dualization Problem
TLDR
The monotone dualization problem and its connection to computing all abductive explanations for a query literal and some related problems in knowledge discovery are reviewed and new light is shed on the computational nature of abduction and Horn theories in particular. Expand
Complexity of Identification and Dualization of Positive Boolean Functions
TLDR
It is shown that the existence of an incrementally polynomial algorithm for this problem is equivalent to the exist of the following algorithms, where ƒ and g are positive Boolean functions. 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
...
1
2
3
4
5
...