Home > Artificial Intelligence > Quizzes > Artificial Intelligence & Soft Computing: Knowledge, Reasoning and Planning
Artificial Intelligence & Soft Computing: Knowledge, Reasoning and Planning
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 26% • Most missed: “How can be the goal is thought of in backward chaining algorithm?”
Artificial Intelligence & Soft Computing: Knowledge, Reasoning and Planning
Time left 00:00
25 Questions

1. Which are more suitable normal form to be used with definite clause?
2. What is meant by factoring?
3. Lifted inference rules require finding substitutions that make different logical expressions looks identical.
4. Which can be converted to inferred equivalent CNF sentence?
5. Which knowledge base is called as fixed point?
6. How the logic programming can be constructed?
7. How many proposition symbols are there in artificial intelligence?
8. The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicated. For any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base.
9. In order to utilize generalized Modus Ponens, all sentences in the KB must be in the form of Horn sentences.
10. Treatment chosen by doctor for a patient for a disease is based on _____________
11. A common convention is:
12. What form of negation does the prolog allows?
13. How can be the goal is thought of in backward chaining algorithm?
14. Which is created by using single propositional symbol?
15. Which is omitted in prolog unification algorithm?
16. Which is used to construct the complex sentences?
17. Which will be the instance of the class datalog knowledge bases?
18. What among the following could the universal instantiation of ___________For all x King(x) ^ Greedy(x) => Evil(x)
19. When the resolution is called as refutation-complete?
20. Which problem can frequently occur in backward chaining algorithm?
21. What is used in backward chaining algorithm?
22. How many logical connectives are there in artificial intelligence?
23. Which algorithm will work backward from the goal to solve a problem?
24. Which is not Familiar Connectives in First Order Logic?
25. There exist only two types of quantifiers, Universal Quantification and Existential Quantification.

⚡ Recently practiced quizzes in this topic
Live quiz activity
Artificial Intelligence Practice Test Questions: Adversarial Search Natural Language Processing (NLP) Basics Test Soft Computing Practice Test Questions Artificial Intelligence Fundamentals: Introduction to Artificial Intelligence Practice Test Artificial Intelligence: Search Techniques CBSE Class 10 Natural Language Processing AI-417 Practice Test Artificial Intelligence Practice Test Questions: Planning and Acting in the Real World Artificial Intelligence & Soft Computing: Expert System Neural Network Practice Test: Feedforward Neural Networks Artificial Intelligence Practice Test Questions 3
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.