The maximum satisfiability problem asks for an assignment of truth values to the variables in a compound proposition in conjunctive normal form (which expresses a compound proposition as the conjunction of clauses where each clause is the disjunction of two or more variables or their negations) that makes as many of these clauses true as possible. For example, three but not four of the clauses in (p V q)Λ(p V ~q)Λ(~p V r)Λ(~p V ~r) can be made true by an assignment of truth values to p, q, and r. we will show that probabilistic methods can provide a lower bound for the number of clauses that can be made true by an assignment of truth values to the variables.
a) Suppose that there are n variables in a compound proposition in conjunctive normal form. If we pick a truth value for each variable randomly by flipping a coin and assigning true to the variable if the coin comes up heads and false if it
comes up tails, what is the probability of each possible assignment of truth values to the n variables?
(b) Assuming that each clause is the disjunction of exactly two distinct variables or their negations, what is the probability that a given clause is true, given the random assignment of truth values from part (a)?