  The Inverse 3-SAT problem is known to be coNP Complete. This article shows a
new interesting way to solve directly the problem by using closure under
resolution and partial assignment properties. An algorithm is proposed which
lets solve the (co)Inverse 3-SAT problem.
