Home > Artificial Intelligence > Quizzes > Artificial Intelligence: Knowledge and Reasoning
Artificial Intelligence: Knowledge and Reasoning
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 36% Most missed: “The rule of Universal Instantiation (UI for short) says that we can infer any se…”
Artificial Intelligence: Knowledge and Reasoning
Time left 00:00
25 Questions

1. Lifted inference rules require finding substitutions that make different logical expressions looks identical.
2. How many logical connectives are there in artificial intelligence?
3. Treatment chosen by doctor for a patient for a disease is based on _____________
4. What can be viewed as a single lateral of disjunction?
5. Which closely resembles propositional definite clause?
6. What is used in backward chaining algorithm?
7. Which among the following could the Existential instantiation of ∃x Crown(x) ^ OnHead(x, Johnny)?
8. What will backward chaining algorithm will return?
9. Which rule is equal to the resolution rule of first-order clauses?
10. For resolution to apply, all sentences must be in conjunctive normal form, a conjunction of disjunctions of literals.
11. Which is not a property of representation of knowledge?
12. Which algorithm are in more similar to backward chaining algorithm?
13. Which can be converted to inferred equivalent CNF sentence?
14. How can be the goal is thought of in backward chaining algorithm?
15. An inference algorithm that derives only entailed sentences is called sound or truth-preserving.
16. Which is also called single inference rule?
17. Which knowledge base is called as fixed point?
18. Which will solve the conjuncts of the rule so that the total cost is minimized?
19. Translate the following statement into FOL.
For every a, if a is a PhD student, then a has a master degree.
20. How the logic programming can be constructed?
21. There exist only two types of quantifiers, Universal Quantification and Existential Quantification.
22. What is meant by factoring?
23. Which are more suitable normal form to be used with definite clause?
24. First Order Logic is also known as ___________
25. 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.