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 …

Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …

An unsatisfiable set of constraints is minimal if all its (strict) subsets are satisfiable. The task
of type error diagnosis requires finding all minimal unsatisfiable subsets of a given set of …

This paper considers the problem of dualizing a monotone CNF (equivalently, computing all
minimal transversals of a hypergraph), whose associated decision problem is a prominent …

Given an undirected graph G=(V, E) with matching number ν (G), we define d-blockers as
subsets of edges B such that ν ((V, E∖ B))≤ ν (G)− d. We define d-transversals T as subsets …

Given a finite set V, and a hypergraph H⊆ 2V, the hypergraph transversal problem calls for
enumerating all minimal hitting sets (transversals) for H. This problem plays an important …

The question if a given partial solution to a problem can be extended reasonably occurs in
many algorithmic approaches for optimization problems. For instance, when enumerating …

We consider the problem of enumerating all minimal integer solutions of a monotone system
of linear inequalities. We first show that, for any monotone system of r linear inequalities in n …

An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a
challenging open problem and is known to be equivalent to the well-known Transversal …

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 …