Question

A control strategy for a refutation system is said to be ___________ if its use results in a procedure that will find a contradiction whenever one exists.

A.  Optimal

 

B.  Complete

 

C.  Efficient

 

D.  Sound

​

Answer 1

Answer:

D.Sound................

Answer 2

A "control strategy for the refutation system" is said to be complete if its use results in a procedure that will 'find a contradiction' whenever one exists.

Answer - (Option B)

Explanation:

• A resolution refutation is represented by refutation tree with a root node created by NIL.
• The control strategy derives a graph by searching refutation and grows it into a refutation tree along with the root node.
• In order for a control strategy to be complete, the results should search and find for contradictions whenever one exists and this completeness of control strategy does not mean completeness of logical strategy.