Max Horn SAT and the minimum cut problem in directed hypergraphs

Mathematical Programming, Series B

Volumn 80, Issue 2, 1998, Pages 213-237

  Gallo, G ^a   Gentile, C ^a   Pretolani, D ^a   Rago, G ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Directed hypergraphs; Generalized set covering; Horn clauses; Maximum satisfiability; Minimum cut

Indexed keywords

EID: 0039993716     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01581727     Document Type: Article

References (18)

1. G. Gallo, G. Longo, S. Nguyen, S. Pallottino, Directed Hypergraphs and Applications, Discrete Applied Mathematics 42 (1993) 177-201.
2. D. Pretolani, Satisfiability and Hypergraphs, Ph.D. Thesis, TD-12/93, Dipartimento di Informatica, University of Pisa, Italy, 1993.
3. G. Gallo, G. Rago, A Hypergraphs Approach to Logical Inference for Datalog Formulae, TR 28/90, Dipartimento di Informatica, Università di Pisa.
4. G. Rago, Optimization, Hypergraphs and Logical Inference, Ph.D. Thesis, TD-4/94, Dipartimento di Informatica, University of Pisa, Italy, 1993.
5. B. Jaumard, B. Simeone, On the complexity of the maximum satisfiability problem for Horn formulas, Information Processing Letters 26 (1987/1988) 1-4.
6. J. Kratochvíl, M. Křivánek, Satisfiability of co-nested formulas, Acta Informatica 30 (1993) 397-403.
7. M.X. Goemans, D.P. Williamson, New 3/4-approximation algorithms for the maximum satisfiability problem, SIAM Journal on Discrete Mathematics 7 (1994) 656-666.
8. M.X. Goemans, D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995) 1115-1145.
9. J.M. Bourjolly, P.L. Hammer, W.R. Pulleyblank, B. Simeone, Boolean Combinatorial Bounding of Maximum 2-Satisfiability, RRR 5-92. RUTCOR, Rutgers University, 1992.
10. J. Cheriyan, W.H. Cunningham, L. Tuncel, Y. Wang, A Linear Programming and Rounding Approach to Max 2-SAT, in: D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, American Mathematical Society (1996).
11. G. Gallo, R. Cambini, M.G. Scutellà, Flows on hypergraphs, Mathematical Programming 78 (1997) 195-217.
12. W.F. Dowling, J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming 1 (1984) 267-284.
13. G. Ausiello, G.F. Italiano, U. Nanni, Dynamic maintenance of directed hypergraphs, Theoretical Computer Science 72 (1990) 97-117.
14. R.G. Jeroslow, K. Martin, R.L. Rardin, J. Wang, Gainfree Leontief substitution flow problems. Mathematical Programming 57 (3) (1992) 375-414.
15. R.G. Jeroslow, Logic-based decision support - mixed integer model formulation, Annals of Discrete Mathematics 40 (1989).
16. R.G. Jeroslow, J. Wang, Dynamic programming, integral polyhedra and Horn clause knowledge base, ORSA Journal on Computing 1 (1989) 7-19.
17. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, UK, 1988.
18. J.N. Hooker, V. Vinay, An empirical study of branching rules for satisfiability, presented at the third Symposium on Artificial Intelligence and Mathematics, January 1994.