0% found this document useful (0 votes)
28 views3 pages

A.I. LAB Front Pages

Uploaded by

Kunal Barman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
28 views3 pages

A.I. LAB Front Pages

Uploaded by

Kunal Barman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

MATSUNIVERSITY

ARANG,RAIPUR(C.G.)

PRACTICALRECORD FILE
of

Artificial Intelligence And Expert System Laboratory(BT526)


B.Tech. – 5th Semester (CSE)

Batch–2021-2025

Prof.In-Charge SubmittedBy

Ms.Punam Gupta StudentName:-

Assistant Professor ROLL NUMBER:-

Department of Computer Science & Engineering

School of Engineering & IT


MATSUniversity,ArangRaipur(C.G.).
Session-2022-2023
MATSUNIVERSITY
ARANG,RAIPUR(C.G.)

DEPARTMENTOFCOMPUTERSCIENCE&ENGINEERING
Semester V Lecture 15
Branch B.Tech.CSE PeriodperWeek 02
SubjectName Artificial Intelligence And Marks(ESE+IM) 30+20=50
Expert System Laboratory
SubjectCode BT526 Credit 01

LABPROFILE
NAME OFTHE STUDENT:

ROLLNUMBER:

DATE OF DATE OF
GRADE
S.NO NAMEOFEXPERIMENT EXPERIM SUBMISSI
&SIGN
ENT ON
Write a Prolog program to find the rules for parent, child, male,
01 female, son, daughter, brother, sister, uncle, aunt, ancestor given
the facts about father and wife only.

02 Write a program to find the length of a given list.

03 Write a program to find the last element of a given list.

Write a program to delete the first occurrence and also all


04 occurrences of a particular element in a given list.

Write a program to find union and intersection of two given sets


05 represented as lists.

Write a program to read a list at a time and write a list at a time


06
using the well-defined read & write functions.

Write a program for the given knowledge base: If x is on the


07
top of y, y supports x. If x is above y and they are touching each
other, x is on top of y. A cup is above a book. The cup is
touching that book. Convert the above into wffs, clausal form. Is
it possible to deduce that “The book supports the cup”?
MATSUNIVERSITY
ARANG,RAIPUR(C.G.)

Write a program for given knowledge base: If Town x is


08
connected to Town y by highway z and bikes are allowed on z,
you can get to y from x by bike. If Town x is connected to y
by z then y is also connected to x by z. If you can get to town
q from p and also to town r from town q, you can get to town r
from town p. Town A is connected to Town B by Road 1.
Town B is connected to Town C by Road 2. Town A is
connected to Town C by Road 3. Town D is connected to
Town E by Road 4. Town D is connected to Town B by Road
5. Bikes are allowed on roads 3, 4, 5. Bikes are only either
allowed on Road 1 or on Road 2 every day. Convert the
following in to wff’s, clausal form and deduce that “One can
get to town B from town D”.
9 Solve the classical Water Jug problem of AI
Solve the classical Monkey Banana problem of AI.
10
Solve the classical Crypt arithmetic problems such as
11 DONALD + GERALD = ROBERT of AI.

12 Solve the classical Missionary Cannibals problem of AI.


13 Solve the classical Travelling Salesman Problem
of AI.

14 Solve the classical Blocks World Problem of AI.

15 Write a program to search any goal given an input


graph using AO* algorithm.

Signatureof Subject SignatureofHOD


In-charg

You might also like