Artificial Intelligence Questions & Answers – Backward Chaining

«
»

This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Backward Chaining”.

1. Which algorithm will work backward from the goal to solve a problem?
a) Forward chaining
b) Backward chaining
c) Hill-climb algorithm
d) None of the mentioned

Explanation: Backward chaining algorithm will work backward from the goal and it will chain the known facts that support the proof.

2. Which is mainly used for automated reasoning?
a) Backward chaining
b) Forward chaining
c) Logic programming
d) Parallel programming

Explanation: Logic programming is mainly used to check the working process of the system.

3. What will backward chaining algorithm will return?
b) Substitutes matching the query
c) Logical statement
d) All of the mentioned

Explanation: It will contains the list of goals containing a single element and returns the set of all substitutions satisfying the query.
Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!

4. How can be the goal is thought of in backward chaining algorithm?
a) Queue
b) List
c) Vector
d) Stack

Explanation: The goals can be thought of as stack and if all of them us satisfied means, then current branch of proof succeeds.

5. What is used in backward chaining algorithm?
a) Conjuncts
b) Substitution
c) Composition of substitution
d) None of the mentioned

Explanation: None.

6. Which algorithm are in more similar to backward chaining algorithm?
a) Depth-first search algorithm
c) Hill-climbing search algorithm
d) All of the mentioned

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 Repeated states & Incompleteness

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?
a) Variables
b) Expressing knowledge in a formal language
c) Graph
d) All of the mentioned

Explanation: Logic programming can be constructed by expressing knowledge in a formal expression and the problem can be solved by running inference process.

9. What form of negation does the prolog allows?
a) Negation as failure
b) Proposition
c) Substitution
d) Negation as success

Explanation: None.

10. Which is omitted in prolog unification algorithm?
a) Variable check
b) Occur check
c) Proposition check
d) Both Occur & Proposition check