Inverse Intersections for Boolean Satisfiability Problems

Boolean Satisfiability (SAT) problems are expressed as mathematical formulas. This paper presents an alternative matrix representation for any type of these SAT problems. It shows how to use this matrix representation to get the full set of valid assignments. It proves that this is the full set of answers for the given problem, and it shows that this is exponential in size, relative to the matrix. It then presents an algorithm that utilizes the inverses of the clauses in this matrix for faster searching through this set of answers. It shows that this algorithm is both correct and polynomial.