2

Does a 3-SAT problem, where in each clause there is at least a negative-literal, always has a solution?

After looking at it, seems to me that the answer is yes, but maybe there is something I am not seeing.

wallek876
  • 121
  • 1

1 Answers1

1

Consider the all-zeroes assignment, $x_1=x_2=\cdots=x_n=0$.

What if all clauses have a positive literal?

Lieuwe Vinkhuijzen
  • 4,292
  • 17
  • 27
  • Doesn't seem to be enough information to determine if there is a solution, if all literals where positive I would say that there isn't any solution. – wallek876 May 21 '19 at 09:29