SerialNo 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

RegisterationNumber 11002570 11003073 11003142 11103918 11113226 11004150 11004925 11000764 11001480 11001519 11004682 11005529 11007580 11008869 11009003 11009176 11014065 11004719 11000943 10810139 10802849 10803076 10811747

Name RollNumber Bhupinder Kaur RKE095A14 Nitesh Sisodia RKE095A15 Jasdeep Rana RKE095A16 Rohit RKE095A18 Ajay Kumar RKE095A19 Kushagara RKE095A20 Vishal Deepak Awathare RKE095A21 Tanuj Wadhwa RKE095A22 Divya Batra RKE095A23 Sachin Thakur RKE095A24 Akshay Kumar RKE095A25 Kaushik Nath RKE095A26 Vicky Kumar Singh RKE095A27 Nishant Singh RKE095A28 Varun Soni RKE095A29 Abhinay Prakash Pandey RKE095A30 Mohammad Irshadul haqueRKE095A32 C. K. Vishwadeep Manhas RKE095A33 Shashank Rawat RKE095A34 Prabhjeet Singh RKE095A35 Surjeet Singh RKE095A36 Anish Kumar Shah RKE095A38 Ngathem Johnson Singh RKE095A40

Topics Reasoning exercise using predicate lo Expert System design using prolog Software specification using logic Reasoning exercise using proposition Design and analysis of electronic circu Software verification using logic Symbolic manipulations of algebraic e Do a natural deduction proof for a si Tower of Hanoi problem analysis usin Analyzing rule base and knowledge b Analyzing rule base and knowledge b Analyze a simple expert system to ide Reasoning exercise using predicate lo Expert System design using prolog Software specification using logic Reasoning exercise using proposition Design and analysis of electronic circu Software verification using logic Symbolic manipulations of algebraic e Do a natural deduction proof for a si Tower of Hanoi problem analysis usin Analyzing rule base and knowledge b Analyzing rule base and knowledge b

exercise using predicate logic em design using prolog pecification using logic exercise using propositional logic analysis of electronic circuits using logic erification using logic manipulations of algebraic expression al deduction proof for a simpler version of the wise-men problem: There are two wise men; as usual, they can see each other's hats but n anoi problem analysis using Prolog ule base and knowledge base for "Television Fault Diagnosis system" to develop and expert system ule base and knowledge base for "Heart disease advisor " to develop an expert system imple expert system to identify 1 rupee, 2 rupee and 5 rupee Indian coins exercise using predicate logic em design using prolog pecification using logic exercise using propositional logic analysis of electronic circuits using logic erification using logic manipulations of algebraic expression al deduction proof for a simpler version of the wise-men problem: There are two wise men; as usual, they can see each other's hats but n anoi problem analysis using Prolog ule base and knowledge base for "Television Fault Diagnosis system" to develop and expert system ule base and knowledge base for "Heart disease advisor " to develop an expert system

ey can see each other's hats but not their own. It is common knowledge that there's only one white hat available and two red ones. So at

ey can see each other's hats but not their own. It is common knowledge that there's only one white hat available and two red ones. So at

available and two red ones. So at least one of the men is wearing a red one. Man 1 informs the second that he doesn't know which hat h

available and two red ones. So at least one of the men is wearing a red one. Man 1 informs the second that he doesn't know which hat h

that he doesn't know which hat he is wearing. Man 2 says, "Aha, then I must be wearing a red hat." 9 Develop an application in prolog to

that he doesn't know which hat he is wearing. Man 2 says, "Aha, then I must be wearing a red hat." 9 Develop an application in prolog to

evelop an application in prolog to solve 8-queen problem to find all ways of arranging 8 queens on a standard chess board such that no qu

evelop an application in prolog to solve 8-queen problem to find all ways of arranging 8 queens on a standard chess board such that no qu

ndard chess board such that no queen is in a position to take any of the others. Your program should find all 92 solutions and display each

ndard chess board such that no queen is in a position to take any of the others. Your program should find all 92 solutions and display each

d all 92 solutions and display each using character based graphics. 10 This exercise is about the wise-men puzzle. Justify your answers.(a)

d all 92 solutions and display each using character based graphics. 10 This exercise is about the wise-men puzzle. Justify your answers.(a)

n puzzle. Justify your answers.(a) Each man is asked the question "Do you know the colour of your hat?"Suppose that the first man says "

n puzzle. Justify your answers.(a) Each man is asked the question "Do you know the colour of your hat?"Suppose that the first man says "

"Suppose that the first man says "no" but the second one says "yes." Given this information together with the common knowledge, can w

"Suppose that the first man says "no" but the second one says "yes." Given this information together with the common knowledge, can w

th the common knowledge, can we infer the colour of his hat? (b) Can we predict whethe

th the common knowledge, can we infer the colour of his hat? (b) Can we predict whethe