Machine-translated by Google. Questions are authored in English.
Top

Discussion

The inference rule deals exclusively with formulas in conjunctive normal forms is called as :

  • A.Resolution rule
  • B.Contingency rule
  • C.Unsatisfiability rule
  • D.Contradiction rule

Answer: A

The rule is the resolution rule.

Resolution works on clauses, disjunctions of literals, so the formulas must first be put into conjunctive normal form. From two clauses containing a complementary pair, such as \(P \vee Q\) and \(\neg P \vee R\), it derives the resolvent \(Q \vee R\). Deriving the empty clause shows the clause set is unsatisfiable, which is how resolution refutation proves theorems.

Contingency, unsatisfiability and contradiction are properties of formulas, not names of inference rules.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.