Polynomially solvable satisfiability problems

This publication has 3 references indexed in Scilit:

• An O(n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentences
  Information Processing Letters, 1987
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
  The Journal of Logic Programming, 1984
• The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic
  Information and Control, 1983