Artificial Intelligence Questions & Answers – Forward Chaining

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

1. Which condition is used to cease the growth of forward chaining?
a) Atomic sentences
b) Complex sentences
c) No further inference
d) All of the mentioned
View Answer

Answer: c
Explanation: Forward chain can grow by adding new atomic sentences until no further inference is made.

2. Which closely resembles propositional definite clause?
a) Resolution
b) Inference
c) Conjunction
d) First-order definite clauses
View Answer

Answer: d
Explanation: Because they are disjunction of literals of which exactly one is positive.

3. What is the condition of variables in first-order literals?
a) Existentially quantified
b) Universally quantified
c) Both Existentially & Universally quantified
d) None of the mentioned
View Answer

Answer: b
Explanation: First-order literals will accept variables only if they are universally quantified.
advertisement
advertisement

4. Which are more suitable normal form to be used with definite clause?
a) Positive literal
b) Negative literal
c) Generalized modus ponens
d) Neutral literal
View Answer

Answer: c
Explanation: Definite clauses are a suitable normal form for use with generalized modus ponen.

5. Which will be the instance of the class datalog knowledge bases?
a) Variables
b) No function symbols
c) First-order definite clauses
d) None of the mentioned
View Answer

Answer: b
Explanation: If the knowledge base contains no function symbols means, it is an instance of the class datalog knowledge base.
Note: Join free Sanfoundry classes at Telegram or Youtube

6. Which knowledge base is called as fixed point?
a) First-order definite clause are similar to propositional forward chaining
b) First-order definite clause are mismatch to propositional forward chaining
c) All of the mentioned
d) None of the mentioned
View Answer

Answer: a
Explanation: Fixed point reached by forward chaining with first-order definiteclause are similar to those for propositional forward chaining.

7. How to eliminate the redundant rule matching attempts in the forward chaining?
a) Decremental forward chaining
b) Incremental forward chaining
c) Data complexity
d) None of the mentioned
View Answer

Answer: b
Explanation: We can eliminate the redundant rule matching attempts in the forward chaining by using incremental forward chaining.
advertisement

8. From where did the new fact inferred on new iteration is derived?
a) Old fact
b) Narrow fact
c) New fact
d) All of the mentioned
View Answer

Answer: c
Explanation: None.

9. Which will solve the conjuncts of the rule so that the total cost is minimized?
a) Constraint variable
b) Conjunct ordering
c) Data complexity
d) All of the mentioned
View Answer

Answer: b
Explanation: Conjunct ordering will find an ordering to solve the conjuncts of the rule premise so that the total cost is minimized.
advertisement

10. How many possible sources of complexity are there in forward chaining?
a) 1
b) 2
c) 3
d) 4
View Answer

Answer: c
Explanation: The three possible sources of complexity are an inner loop, algorithm rechecks every rule on every iteration, algorithm might generate many facts irrelevant to the goal.

Sanfoundry Global Education & Learning Series – Artificial Intelligence.

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.