Polynomial-time satisfiability for a special case of Positive$\wedge$Negative

Marcel Wild

A Boolean function in CNF format is of type Positive$\wedge$Negative} if each clause C is either positive (i.e. all literals of C are positive) or negative (i.e. all literals of C…