Max Horn SAT and the minimum cut problem in directed hypergraphs

This paper considers the Maximum Horn Satisfiability problem, which is reduced to the problem of finding a minimum cardinality cut on a directed hypergraph, and proposes different IP formulations, related to three different definitions of hyperpath weight.