Question 1) Answer the following questions:
a) What do you understand by term Inference?
b) What do you understand by operational semantics?
c) What do you understand by meta interpreter?
d) What is the language of predicate calculus?
e) What do you understand by static database of prolog?
f) What is a semantic network?
g) What is an Expert System?
h) What do you understand by the term recursion?
i) Write the recursive definition of a LIST.
j) What do you understand by redundancy of the solution to the queries?
Question 2) Define the term propositional calculus. Distinguish between a well formed and not a well formed formula with the help of a suitable example.
Question 3) Demonstrate that ~PVQ and P→Q are logically equivalent using truth Table.
Question 4) Translate the following English sentences into predicate Logic.
(a) Everyone is loyal to someone.
(b) All Romans were either Loyal to Caesar or hated him.
(c) For every number, there is one and only one immediate successor.
(d) There is no number for which O is immediate successor.
(e) For every number other than 0, there is one and only one immediate predecessor.
Question 5) Ancestor X of Y is defined as “if X is parent of Y or if X is parent of Z who is ancestor of Y” write prolog program.
Question 6) Explain FAIL Predicate with the help of a suitable example.
Question 7) What are logical limitations of PROLOG? Write a prolog Program using Cut for Quick sort.
Question 8) Write an iterative and recursive program to Prolog to add the elements of a given list of integers.
Question 9) Write brief notes on:
(a) Fuzzy Logic Neural networks
(b) Normal Forms