Q72

MCQ2 marks, −0.5

The following resolution rule is used in logic programming. Derive clause $(P \vee Q)$ from clauses $(P\vee R),(Q \vee ¬R)$ Which of the following statements related to this rule is FALSE?

(A)

$((P ∨ R)∧(Q ∨ ¬R))⇒(P ∨ Q)$ is logically valid

(B)

$(P ∨ Q)⇒((P ∨ R)∧(Q ∨ ¬R))$ is logically valid

(C)

$(P ∨ Q)$ is satisfiable if and only if $(P ∨ R)∧(Q ∨ ¬R)$ is satisfiable

(D)

$(P ∨ Q)⇒ \text{FALSE}$ if and only if both $P$ and $Q$ are unsatisfiable

Loading…