CS-14 : INTELLIGENT
SYSTEMS JUNE 1998
| Time : 3 Hours |
Max. Marks : 75 |
Note : Question 1 is compulsory. Answer any three from the rest.
| 1. | (a) | Write LISP function that, given two lists, return |
|
||
| (b) | Transform the first order
predicate logic statements given below into equivalent conceptual graphs. (i) (ii) (iii) |
|
| 2. | (a) | Explain the difference between forward and backward chaining and under what condition each would be best to use for a given set of problems. |
| (b) | Identify and describe one good application area for the expert system for a child health care. | |
| 3. | (a) | Describe Depth-First Search algorithm. How is it different from Depth-First Interaction Deepening Search ? |
| (b) | For the search tree below use breadth-first searching and list the elements of queue just before selecting and expanding each next state until a goal node is reached. (Goal state designated with *) | |
![]() |
||
| 4. | (a) | Draw an Augmented Transition Network (ATM) to implement the following grammar |
| S
NP NP VP DET V N |
||
| (b) | Explain the main differences
between the following two grammars. Chomsky's Transformational Grammar Fillmore's Case Grammar |
|
| 5. | (a) | give the advantages of expert system architectures based on decision trees over those of production rules what are the main advantages ? |
| (b) | Explain how uncertainty is propagated through a chain of rules during a consultation with an expert system which is based on the mycin architecture. | |
| 6. | Write short notes on the following : | |
| (a) | Conceptual indexing | |
| (b) | Deterministic versus non-deterministic parsers | |
| (c) | General Learning Model |