Max Horn SAT and the minimum cut problem in directed hypergraphs (Q1380929)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Max Horn SAT and the minimum cut problem in directed hypergraphs
scientific article

    Statements

    Max Horn SAT and the minimum cut problem in directed hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 March 1998
    0 references
    0 references
    maximum satisfiability
    0 references
    Horn clauses
    0 references
    minimum cut
    0 references
    generalized set covering
    0 references
    maximum Horn satisfiability problem
    0 references
    minimum cardinality cut
    0 references
    directed hypergraph
    0 references
    disjunctive programming
    0 references
    0 references