Which of the following statement sets are SATISFIABLE?
P ^ Q, P v ~P, and (P -> Q) ^{Q-> R} have satisfying assignments. P ^ ~P is a contradiction (UNSAT).
Select the CORRECT properties of FIRST-ORDER LOGIC Unification:
Statements 1, 2, and 3 are correct. Most General Unifier is unique up to variable renaming.
How many distinct truth assignments satisfy the propositional formula (P v Q) ^{R v S}?
(P v Q) is satisfied by 3/4 assignments. (R v S) is satisfied by 3/4 assignments. Total = 3 * 3 = 9.
For a boolean formula with $n = 4 variables$, how many truth assignments evaluate to FALSE for the single maxterm clause (P v ~Q v R v ~S)?
A single maxterm clause evaluates to False for exactly 1 specific assignment ($P=0$, $Q=1$, $R=0$, $S=1$).
How many distinct truth assignments satisfy the formula P XOR Q XOR R?
XOR of 3 variables is True when an odd number of variables are True: (1,0,0), (0,1,0), (0,0,1), (1,1,1) -> 4 assignments.