Explanation: It is depth-first search algorithm because its space requirements are linear in the size of the proof. 7. Which problem can frequently occur in backward chaining algorithm?
A. Repeated states
B. Incompleteness
C. Complexity
D. Both a & b
Answer:A
Explanation: It is depth-first search algorithm because its space requirements are linear in the size of the proof. 7. Which problem can frequently occur in backward chaining algorithm?
A. Repeated states B. Incompleteness C. Complexity D. Both a & b
Explanation: If there is any loop in the chain means, It will lead to incompleteness and repeated states. 8. How the logic programming can be constructed?