A short note on some tractable cases of the satisfiability problem
It is shown that the tractable class of CNF formulas solvable by linear autarkies properly contains the class of q-Horn formulas and that it is incomparable with SLUR. (C) 2000 Academic Press.
satisfiability autarkies horn complexity