Knowledge Engineering & Expert System

Assignment

1. Either Manasvi attended the meeting or Manasvi was not invited. If the boss wanted Manasvi at the meeting,
then she was invited. Manasvi did not attend the meeting. If the boss did not want Manasvi there, and the
boss did not invite her there, then she is going to be fired. Prove that Manasvi is going to be fired (using
theorem-proving method only).

2 Marks

2. Prove the following using resolution-refutation method.

20 Marks

(a) ˆ All hounds howl at night.

ˆ Light sleepers do not have anything which howls at night.
ˆ John has either a cat or a hound.
ˆ (Conclusion) If John is a light sleeper, then John does not have any mice.
(b) ˆ Every child loves Santa.
ˆ Everyone who loves Santa loves any reindeer.
ˆ Rudolph is a reindeer, and Rudolph has a red nose.
ˆ Anything which has a red nose is weird or is a clown.
ˆ No reindeer is a clown.
ˆ Scrooge does not love anything which is weird.
ˆ (Conclusion) Scrooge is not a child.
(c) ˆ Anyone who buys carrots by the bushel owns either a rabbit or a grocery store.
ˆ Every dog chases some rabbit.
ˆ Mary buys carrots by the bushel.
ˆ Anyone who owns a rabbit hates anything that chases any rabbit.
ˆ John owns a dog.
ˆ Someone who hates something owned by another person will not date that person.
ˆ (Conclusion) If Mary does not own a grocery store, she will not date John.
(d) ˆ Every child loves anyone who gives the child any present.
ˆ Every child will be given some present by Santa if Santa can travel on Christmas eve.
ˆ It is foggy on Christmas eve.
ˆ Anytime it is foggy, anyone can travel if he has some source of light.
ˆ Any reindeer with a red nose is a source of light.
ˆ (Conclusion) If Santa has some reindeer with a red nose, then every child loves Santa.

3. Write a prolog program that

18 Marks

(a) finds the last and nth element from a list.

(b) reverses any input list.
(c) concatenates two linked list
(d) creates a binary search tree.
(e) Add the elements in a given list of integres.

1
 (f) generates all permutations of a given list.
4. Discuss the various knowledge representation schemes.

2 Marks

5. Differentiate between the monotonic and non-monotonic reasoning with suitable set of examples.

2 Marks

6. Differentiate between the shallow and causal reasoning with suitable examples.

2 Marks

7. Consider the knowledge base given below. Perform the forward and backward chaining to satisfy the goal

4 Marks
ˆ R1: if A then B
ˆ R2: if C then E
ˆ R3: if A and C then F
ˆ R4: if B and E then D
ˆ Facts: A,C
ˆ Goal: D
8. What are the different phases in building an expert system?

2 Marks

9. How is an expert system different from a traditional program? How is a production system different from
an expert system? Also, describe the knowledge acquisition component of expert system.

4 Marks

10. Draw a semantic net for computers using inst and is a links. Consider the classes of microcomputer, main-
frame, supercomputer, computing system, dedicted, general purpose, board-level, computer-on-a-chip, single
process, and multiprocess. Moreover, you can include specific instances too.

4 Marks

11. Write short notes on the following:

ˆ Semantic Nets vs. Extended Semantic Nets
ˆ Abductive Reasoning vs. Deductive Reasoning
ˆ Inductive Reasoning vs. Deductive Reasoning
ˆ Monotonic Reasoning vs. Non-monotonic Reasoning
ˆ Semantic Nets vs Frames

20 Marks

12. Discuss the backward induction.

4 Marks

13. Discuss the temporal reasoning through a suitable example.

4 Marks

14. Describe the various types of belief.

4 Marks

15. List down the main characteristics of the markov chain process.

4 Marks

16. Differentiate between causal reasoning and shallow reasoning.

4 Marks