On the complexity of the maximum satisfiability problem for horn formulas

This publication has 5 references indexed in Scilit:

• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
  The Journal of Logic Programming, 1984
• Logic and Databases: A Deductive Approach
  ACM Computing Surveys, 1984
• Network Flow and Testing Graph Connectivity
  SIAM Journal on Computing, 1975
• Minimum cuts and related problems
  Networks, 1975