Resolution

Which is a refutation complete inference procedure for propositional logic?

• Clauses

• b) Variables

• c) Propositional resolution

• d) Proposition

Which can be converted to inferred equivalent CNF sentence?

• Every sentence of propositional logic

• b) Every sentence of inference

• c) Every sentence of first-order logic

• d) All of the mentioned

Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable?

• Search statement

• b) Reading statement

• c) Replaced statement

• d) Original statement

When the resolution is called as refutation-complete?

• Sentence is satisfiable

• b) Sentence is unsatisfiable

• c) Sentence remains the same

• d) None of the mentioned