# satisfiability – Solving largely monotone SAT formulas

I just wonder if solving largely monotone SAT formulas (meaning most clauses do not contain negated literals, but some do) is in any way easier than general SAT formulas? In other words, are there heuristics specially designed for solving such formulas that are not applicable to more general SAT problems? I tried but didn’t find any research in this particular direction.

Of course, what is considered “most” is up to interpretation, but let’s say >95% of the causes are monotone.