Question 1 : Which is omitted in prolog unification algorithm?
1. Variable check
2. Occur check
3. Proposition check
4. Both Occur & Proposition check
View Answer   Discuss with Members

Question 2 : What form of negation does the prolog allows?
1. Negation as failure
2. Proposition
3. Substitution
4. Negation as success
View Answer   Discuss with Members

Question 3 : How the logic programming can be constructed?
1. Variables
2. Expressing knowledge in a formal language
3. Graph
4. All of the mentioned
View Answer   Discuss with Members

Question 4 : Which problem can frequently occur in backward chaining algorithm?
1. Repeated states
2. Incompleteness
3. Complexity
4. Both Repeated states & Incompleteness
View Answer   Discuss with Members

Question 5 : Which algorithm are in more similar to backward chaining algorithm?
1. Depth-first search algorithm
2. Breadth-first search algorithm
3. Hill-climbing search algorithm
4. All of the mentioned
View Answer   Discuss with Members

Question 6 : What are used in backward chaining algorithm?
1. Conjuncts
2. Substitution
3. Composition of substitution
4. None of the mentioned
View Answer   Discuss with Members

Question 7 : How can be the goal is thought of in backward chaining algorithm?
1. Queue
2. List
3. Vector
4. Stack
View Answer   Discuss with Members

Question 8 : What will backward chaining algorithm will return?
1. Additional statements
2. Substitutes matching the query
3. Logical statement
4. All of the mentioned
View Answer   Discuss with Members

Question 9 : Which is mainly used for automated reasoning?
1. Backward chaining
2. Forward chaining
3. Logic programming
4. Parallel programming
View Answer   Discuss with Members

Question 10 : Which algorithm will work backward from the goal to solve a problem?
1. Forward chaining
2. Backward chaining
3. Hill-climb algorithm
4. None of the mentioned
View Answer   Discuss with Members