On finding solutions for extended Horn formulas

We present a simple quadratic-time algorithm for solving the satisfiability problem for a special class of boolean formulas. This class properly contains the class of extended Horn formulas and balanced formulas. Previous algorithms for these classes require testing membership in the classes. However, the problem of recognizing balanced formulas is complex, and the problem of recognizing extended Horn formulas is not known to be solvable in polynomial time. Our algorithm requires no such test for membership.