A minimal unsatisfiable partial assignment for 3-CNF is a partial assignment that:
- There exist a clause where all variables are unsatisfied.
- Unfixing any variable make every clause contain at least one free variable.
Particularly for 2-SAT and 3-SAT is their number bounded by polynomial?
If yes, then how number of such assignments in SAT can be reduced from $2^m$ to polynomial, when applying Tseytin transform? $m$ is number of variables.