Department of Computer Engineering

Journal

Artificial Intelligence

Semester VI

Department of Computer Engineering

K. J. Somaiya College of Engineering
(Constituent College of Somaiya Vidyavihar University)
Academic Year 2023-24

[Type text]
 K. J. Somaiya College of Engineering, Mumbai-77

Subject: Artificial Intelligence

List of Experiments for academic year 2023-24
Sr. CO
Topic
No Mapping

1. Study of AI projects and Turing Test CO 1

2. Implementation of family tree PROLOG program using condition-action

CO 1
rules based agent

3. Implementation of PROLOG program to solve a Crime mystery/medical

CO 3
diagnosis using Goal based agent architecture

4. Implementation of uninformed search algorithms – BFS,DFS, DLS for the

CO 2
given problem

5. Implementation of informed search algorithm(Greedy Best First search/A*) CO 2

6. Implementation of alpha-beta pruning CO 2

7. Implementation of Constraint Satisfaction Problem CO4

8. IEEE Case study on learning/planning techniques CO4

9. Virtual Lab experiment - NLP CO4

10. Virtual Lab experiment – POS tagging : Hidden Markov Model CO4

Subject Incharges-

Ms. Rohini Nair

Dr. Ayesha Hakim
Ms. Mansi Kambli

Somaiya Vidyavihar University 2023-24 Batch Page 1

 K. J. Somaiya College of Engineering, Mumbai-77

Batch: Roll No.:

Experiment / assignment / tutorial No. 1

Title: Study of Artificial Intelligent project.

______________________________________________________________________
Objective: To study various AI projects for their architectures. Complexity,
programming language, applications and other AI related concepts.
______________________________________________________________________
Expected Outcome of Experiment:

Course After successful completion of the course students should be able to

Outcome

Understand the history & various application of AI and choose appropriate

CO1
agent architecture to solve the given problem.

______________________________________________________________________
Books/ Journals/ Websites referred:
1. http://en.wikipedia.org/wiki/List_of_artificial_intelligence_projects
2. http://www.cs.cornell.edu/courses/cs478/2002sp/mllinks/
interesting_ai_demos_and_project.htm
3. http://homepages.inf.ed.ac.uk/rbf/AIMOVIES/AImovai.htm
4. “Artificial Intelligence: a Modern Approach” by Russell and Norving, Pearson
education Publications
5. “Artificial Intelligence” By Rich and knight, Tata McGraw Hill Publications
______________________________________________________________________
Pre Lab/ Prior Concepts:
History and evolution of AI, Artificial intelligence: definitions and theories.
______________________________________________________________________
Historical Profile:
AI research is highly technical and specialised and is also divided by several
multidisciplinary technical issues. So far there are many projects those have been
developed and are in progress to work on those issues. Students must learn the
applications of intelligent robots by studying various such projects to know the depth
and complexity of the course.
_____________________________________________________________________
New Concepts to be learned:
Applications of AI, Current research and future research potential in the field.
Somaiya Vidyavihar University 2023-24 Batch Page 2
 K. J. Somaiya College of Engineering, Mumbai-77

_____________________________________________________________________

Chosen Project Name:

Project Description:

Project category/field (Game, NLP etc):

Agent architecture: (State just name):

Programming language in which the project is/was developed:

Awards won by the project:

Somaiya Vidyavihar University 2023-24 Batch Page 3

 K. J. Somaiya College of Engineering, Mumbai-77

Nature of the project (Experimental/in use in real world):

(Explain in brief why experimental or how it is useful in real world)

Applications of the project:

Somaiya Vidyavihar University 2023-24 Batch Page 4

 K. J. Somaiya College of Engineering, Mumbai-77

Chat session with any chatbot(questions should vary difficulty level):

Somaiya Vidyavihar University 2023-24 Batch Page 5

 K. J. Somaiya College of Engineering, Mumbai-77

Post Lab Descriptive Questions:

1. ………….. is called the father of AI.
A) James C Gosling
B) Dennis Ritchie
C) Alan Turing
D) Isaac Newton
Answer:

2. In AI ………………………. is a combination of data structures and interpretive

procedures.
A) Knowledge
B) Meta-knowledge
C) Artificial Knowledge
D) Performance
Answer:

Post Lab Descriptive Questions:

1. Define Artificial Intelligence in terms of human performance.
2. What is a Turing test?
3. Define an Omniscient agent. Are intelligent agents Omniscient?
4. What can today’s AI systems do?
5. What can today’s AI systems not do?
6. Design ten questions to pose to a man or a machine that is taking a Turing test.

Somaiya Vidyavihar University 2023-24 Batch Page 6

 K. J. Somaiya College of Engineering, Mumbai-77

Batch: Roll No.:

Experiment / assignment / tutorial No. 2

Title: Implementation of condition-action rules based agent using PROLOG

_____________________________________________________________________
Objective: Developing a basic level agent program that runs on condition-action rules
______________________________________________________________________

Expected Outcome of Experiment:

Course After successful completion of the course students should be able to

Outcom
e

Understand the history & various application of AI and choose appropriate

CO1
agent architecture to solve the given problem.

______________________________________________________________________
Books/ Journals/ Websites referred:
1. https://www.csupomona.edu/~jrfisher/www/prolog_tutorial/contents.html
2. http://www.csupomona.edu/~jrfisher/www/prolog_tutorial/pt_framer.html
3. http://www.doc.gold.ac.uk/~mas02gw/prolog_tutorial/prologpages/
4. “Artificial Intelligence: a Modern Approach” by Russell and Nerving,
Pearson education Publications
5. “Artificial Intelligence” By Rich and knight, Tata McGraw Hill Publications
6. “Prolog: Programming for Artificial Intelligence” by Ivan Bratko, Pearson
education Publications
______________________________________________________________________
Pre Lab/ Prior Concepts: Intelligent Agent, Agent Architectures, Rule base Vs
Knowledge Based approach
______________________________________________________________________
Historical Profile: Agent programs for simple applications need not be very
complicated. They can be based on condition-action rules and still they give better
results, though not always rational. The family tree program makes use of similar
concept.
_____________________________________________________________________

New Concepts to be learned:

Defining rules, using and programming with PROLOG
______________________________________________________________________
Somaiya Vidyavihar University 2023-24 Batch Page 7
 K. J. Somaiya College of Engineering, Mumbai-77

A simple agent program can be defined mathematically as an agent function which

maps every possible percepts sequence to a possible action the agent can perform or to
a coefficient, feedback element, function or constant that affects eventual actions:
F: P * − >A
Algorithm for ‘Condition-Action Rule Table’ Agent function:

functionSIMPLE-REFLEX-AGENT (percept) returns an action

Static: rules, a set of condition-action rules
State🡨INTERPRET-INPUT (percept)

Rule🡨RULE-MATCH (state, rules)

Action🡨RULE-ACTION [rule]
Returnaction

This approach follows a table for lookup of condition-action pairs defining all possible
condition-action rules necessary to interact in an environment.

Example Family Tree/disease-symptom mapping/ City map with their distances

between them:

Somaiya Vidyavihar University 2023-24 Batch Page 8

 K. J. Somaiya College of Engineering, Mumbai-77

Base Knowledgebase:

Rules:

Somaiya Vidyavihar University 2023-24 Batch Page 9

 K. J. Somaiya College of Engineering, Mumbai-77

Some Sample queries and Outputs:

Somaiya Vidyavihar University 2023-24 Batch Page 10

 K. J. Somaiya College of Engineering, Mumbai-77

Post Lab Objective Questions

1. The PROLOG suit is based on
a. Interpreter
b. Compiler
c. None of the above
Answer:

2. State true or false

There must be at least one fact pertaining to each predicate written in the PROLOG
program.
Answer:

3. State true or false

In the PROLOG program the variable declaration is a compulsory part.
Answer:

Post Lab Subjective Questions

1. Differentiate between a fact and a predicate with syntax.
2. Differentiate between knowledge based and Rule base approach.
3. Differentiate between database and knowledge base.
4. What is a ‘free variable’? Explain with an example.

Somaiya Vidyavihar University 2023-24 Batch Page 11

 K. J. Somaiya College of Engineering, Mumbai-77

Batch: Roll No.:

Experiment / assignment / tutorial No. 3

Title: Implementation of Goal based agent architecture using PROLOG.

______________________________________________________________________
Objective: To use the concepts of knowledge engineering to design and solve moderate
complex problem.
______________________________________________________________________
Expected Outcome of Experiment:

Course After successful completion of the course students should be able to

Outcom
e

Understand the history & various application of AI and choose appropriate

CO1
agent architecture to solve the given problem.

______________________________________________________________________
Books/ Journals/ Websites referred:
1. https://www.csupomona.edu/~jrfisher/www/prolog_tutorial/contents.html
2. http://www.csupomona.edu/~jrfisher/www/prolog_tutorial/pt_framer.html
3. http://www.doc.gold.ac.uk/~mas02gw/prolog_tutorial/prologpages/
4. http://classes.soe.ucsc.edu/cmps112/Spring03/languages/prolog/
PrologIntro.pdf
5. “Prolog: Programming for Artificial Intelligence” by Ivan Bratko, Pearson
education Publications
6. “Artificial Intelligence: a Modern Approach” by Russel and Norving, Pearson
education Publications
7. “Artificial Intelligence” By Rich and knight, Tata Mcgraw Hill Publications
______________________________________________________________________
Pre Lab/ Prior Concepts:
Agents, Agent Architecture, Programming with PROLOG
______________________________________________________________________
Historical Profile:
Knowledge is vast, uncertain and continuously changing. These properties of
knowledge make it difficult to arrive at a result. A murder mystery is a kind of situation
which depicts the uncertain nature of knowledge and also emphasizes the need of
choosing right clauses from entire knowledgebase to make a decision. He goal based
agent architecture and some knowledge engineering can help in solutioning of such
problems.

Somaiya Vidyavihar University 2023-24 Batch Page 12

 K. J. Somaiya College of Engineering, Mumbai-77

The logical agents are complex but they can reason and learn from the actions and new
precepts. They are less like acting and think like humans but more like acting and
thinking rational agents.
Knowledge and reasoning play a crucial role in dealing with partially observable
environments. A knowledge based agent can combine the general knowledge with
current percept to infer the hidden aspects of the current state prior to selecting actions.
_____________________________________________________________________
New Concepts to be learned:
Knowledge engineering, implementing complex agent architecture, uncertainty in
knowledge.
_____________________________________________________________________
The Knowledge Engineering Process
1. Identify the task
2. Assemble the relevant knowledge
3. Decide on vocabulary of predicates, functions and constants
4. Encode general knowledge about the domain
5. Encode description of specific problem instance
6. Pose queries to the inference procedure and get answers
7. Debug the knowledge base
Algorithm for KB-Agent:

Somaiya Vidyavihar University 2023-24 Batch Page 13

 K. J. Somaiya College of Engineering, Mumbai-77

Problem Statement:

Knowledge Engineering steps applied to chosen problem:

Somaiya Vidyavihar University 2023-24 Batch Page 14

 K. J. Somaiya College of Engineering, Mumbai-77

Agent Architecture (Justify the blocks):

Team Members:
1.
2.

Somaiya Vidyavihar University 2023-24 Batch Page 15

 K. J. Somaiya College of Engineering, Mumbai-77

Somaiya Vidyavihar University 2023-24 Batch Page 16

 K. J. Somaiya College of Engineering, Mumbai-77

Post Lab Objective Questions

1. Which is not a Goal-based agent?

a. Inference
b. Search
c. Planning
d. Conclusion
e. Dynamic search.
Answer:

2. Which were built in such a way that humans had to supply the inputs and
interpret the outputs?
a. Agents
b. Sensor
c. AI System
d. Actuators
Answer:

Post Lab Subjective Questions

Explain the role of PEAS and task environment in choosing the agent
architecture. Justify your answer with an example.

Somaiya Vidyavihar University 2023-24 Batch Page 17

 K. J. Somaiya College of Engineering, Mumbai-77

Batch: Roll No.:

Experiment / assignment / tutorial No.

Title: Implementation of uninformed search algorithm( BFS/DFS/DLS/IDS)

______________________________________________________________________
Objective: Comparison and analysis of uninformed search algorithms

Expected Outcome of Experiment:

Course After successful completion of the course students should be able to

Outcom
e

Analyse and solve problems for goal based agent architecture (searching and
CO 2
planning algorithms).

______________________________________________________________________
Books/ Journals/ Websites referred:
1. “Artificial Intelligence: a Modern Approach” by Russell and Norving, Pearson
education Publications
2. “Artificial Intelligence” By Rich and knight, Tata Mcgraw Hill Publications
3. http://people.cs.pitt.edu/~milos/courses/cs2710/lectures/Class4.pdf
4. http://cs.williams.edu/~andrea/cs108/Lectures/InfSearch/infSearch.html
5. http://www.cs.mcgill.ca/~dprecup/courses/AI/Lectures/ai-lecture02.pdf
http://homepage.cs.uiowa.edu/~hzhang/c145/notes/04a-search.pdf
6. http://wiki.answers.com/Q/
Informed_search_techniques_and_uninformed_search_techniques
7. www.cs.swarthmore.edu/~eeaton/teaching/cs63/.../UninformedSearch.ppt
______________________________________________________________________
Pre Lab/ Prior Concepts: Problem solving, state-space trees, problem formulation,
goal based agent architecture
______________________________________________________________________
Historical Profile:
The AI researchers have come up many algorithms those operate on state space tree to
give the result. Goal based agent architectures solve problems through searching or
planning. Depending on availability of more information other than the problem
statement decides if the solution can be obtained with uninformed search or informed
search.
Somaiya Vidyavihar University 2023-24 Batch Page 18
 K. J. Somaiya College of Engineering, Mumbai-77

Its fact that not all search algorithms end up in giving the optimal solution. So, it states
the need to have a better and methodological approach which guarantees optimal
solution.
______________________________________________________________________
New Concepts to be learned: Uninformed (blind) search, iterative deepening, greedy
best first search, A* search
______________________________________________________________________
Uninformed searching techniques:

● Breadth first search

● Depth first search

● Iterative deepening search

● Depth limit search

Chosen Problem statement:

Somaiya Vidyavihar University 2023-24 Batch Page 19

 K. J. Somaiya College of Engineering, Mumbai-77

State-space tree :

Somaiya Vidyavihar University 2023-24 Batch Page 20

 K. J. Somaiya College of Engineering, Mumbai-77

Solution with of chosen algorithm on the state-space tree:

Somaiya Vidyavihar University 2023-24 Batch Page 21

 K. J. Somaiya College of Engineering, Mumbai-77

Comparison of performance of uninformed Algorithm:

Somaiya Vidyavihar University 2023-24 Batch Page 22

 K. J. Somaiya College of Engineering, Mumbai-77

Post Lab Objective questions

1. Which search algorithm imposes a fixed depth limit on nodes?
a. Depth-limited search
b. Depth-first search
c. Iterative Deepening search
d. Only (a) and (b)
e. Only (a), (b) and (c).
Answer:

2. Optimality of BFS is
a. When all step costs are equal
b. When all step costs are unequal
c. When there is less number of nodes
d. Both a & c

Answer:

Post Lab Subjective Questions:

1. Mention the criteria for the evaluation of search Algorithm.
2. State the properties of BFS,DFS, DLS and IDS
3. Explain why BFS is worst approach when the branching factor and solution
depth in state-space tree is large (value =10 or more)

Somaiya Vidyavihar University 2023-24 Batch Page 23

 K. J. Somaiya College of Engineering, Mumbai-77

Batch: Roll No.:

Experiment / assignment / tutorial No.

Title: Implementation of Informed search algorithm( GBFS/A*)

______________________________________________________________________
Objective: Comparison and analysis of informed search algorithms

Expected Outcome of Experiment:

Course After successful completion of the course students should be able to

Outcom
e

Analyse and solve problems for goal based agent architecture (searching and
CO2
planning algorithms).

______________________________________________________________________
Books/ Journals/ Websites referred:
1. “Artificial Intelligence: a Modern Approach” by Russell and Norving, Pearson
education Publications
2. “Artificial Intelligence” By Rich and knight, Tata Mcgraw Hill Publications
3. http://people.cs.pitt.edu/~milos/courses/cs2710/lectures/Class4.pdf
4. http://cs.williams.edu/~andrea/cs108/Lectures/InfSearch/infSearch.html
5. http://www.cs.mcgill.ca/~dprecup/courses/AI/Lectures/ai-lecture02.pdf
http://homepage.cs.uiowa.edu/~hzhang/c145/notes/04a-search.pdf
6. http://wiki.answers.com/Q/
Informed_search_techniques_and_uninformed_search_techniques
______________________________________________________________________
Pre Lab/ Prior Concepts: Problem solving, state-space trees, problem formulation,
goal based agent architecture
______________________________________________________________________
Historical Profile:
The AI researchers have come up many algorithms those operate on state space tree to
give the result. Goal based agent architectures solve problems through searching or
planning. Depending on availability of more information other than the problem
statement decides if the solution can be obtained with uninformed search or informed
search.

Somaiya Vidyavihar University 2023-24 Batch Page 24

 K. J. Somaiya College of Engineering, Mumbai-77

Its fact that not all search algorithms end up in giving the optimal solution. So, it states
the need to have a better and methodological approach which guarantees optimal
solution.
______________________________________________________________________
New Concepts to be learned: Heuristic, Informed search, greedy best first search, A*
search
______________________________________________________________________
Informed searching techniques

● Greedy best first search

● A*

Chosen Problem statement:

Somaiya Vidyavihar University 2023-24 Batch Page 25

 K. J. Somaiya College of Engineering, Mumbai-77

State-space tree :

Somaiya Vidyavihar University 2023-24 Batch Page 26

 K. J. Somaiya College of Engineering, Mumbai-77

Solution with of GBFS/ A* on the state-space tree:

Somaiya Vidyavihar University 2023-24 Batch Page 27

 K. J. Somaiya College of Engineering, Mumbai-77

Comparison of performance of Greedy and A* Algorithm:

Properties of A* algorithm:

Somaiya Vidyavihar University 2023-24 Batch Page 28

 K. J. Somaiya College of Engineering, Mumbai-77

Post lab Objective questions

1. A heuristic is a way of trying
a. To discover something or an idea embedded in a program
b. To search and measure how far a node in a search tree seems to be from a
goal
c. To compare two nodes in a search tree to see if one is better than the other
d. Only (a) and (b)
e. Only (a), (b) and (c).
Answer:

2. A* algorithm is based on
a. Breadth-First-Search
b. Depth-First –Search
c. Best-First-Search
d. Hill climbing.
e. Bulkworld Problem.
Answer:

3. What is a heuristic function?

a. A function to solve mathematical problems
b. A function which takes parameters of type string and returns an integer
value
c. A function whose return type is nothing
d. A function which returns an object
e. A function that maps from problem state descriptions to measures of
desirability.
Answer:

Post Lab Subjective Questions:

1. How best-first-search algorithm supports heuristic evaluation function?
2. Find a good heuristic function for following
a. Monkey and Banana problem
b. Travelling Salesman problem
3. Define the heuristic search. Discuss benefits and short comings.

Somaiya Vidyavihar University 2023-24 Batch Page 29

 K. J. Somaiya College of Engineering, Mumbai-77

Batch: Roll No.:

Experiment / assignment / tutorial No.

Title: Implementation of Alpha Beta Pruning.

______________________________________________________________________
Objective: Implementation of Alpha-Beta Pruning algorithm

Expected Outcome of Experiment:

Course After successful completion of the course students should be able to

Outcom
e

Analyse and solve problems for goal based agent architecture (searching and
CO2
planning algorithms).

______________________________________________________________________

Books/ Journals/ Websites referred:

1. “Artificial Intelligence: a Modern Approach” by Russel and Norving, Pearson
education Publications
2. “Artificial Intelligence” By Rich and knight, Tata Mcgraw Hill Publications
3. www.cs.sfu.ca/CourseCentral/310/oschulte/mychapter5.pdf
4. http://cs.lmu.edu/~ray/notes/asearch/
5. www.cs.cornell.edu/courses/cs4700/2011fa/.../06_adversarialsearch.pdf
______________________________________________________________________
Pre Lab/ Prior Concepts: Two/Multi player Games and rules, state-space tree,
searching algorithms and their analysis properties
______________________________________________________________________
Historical Profile: - The game playing has been integral part of human life. The
multiplayer games are competitive environment in which everyone tries to gain more
points for himself and wishes the opponent to gain minimum.
The game can be represented in form of a state space tree and one can follow
the path from root to some goal node, for either of the player.
______________________________________________________________________
New Concepts to be learned: Adversarial search, minmax algorithm, minmax
pruning,
______________________________________________________________________
Adversarial Search:-

Somaiya Vidyavihar University 2023-24 Batch Page 30

 K. J. Somaiya College of Engineering, Mumbai-77

Somaiya Vidyavihar University 2023-24 Batch Page 31

 K. J. Somaiya College of Engineering, Mumbai-77

Alpha-beta pruning algorithm:

Chosen Problem:

Somaiya Vidyavihar University 2023-24 Batch Page 32

 K. J. Somaiya College of Engineering, Mumbai-77

Solution tree for chosen Problem:

Somaiya Vidyavihar University 2023-24 Batch Page 33

 K. J. Somaiya College of Engineering, Mumbai-77

Post Lab objective Questions:

1. Which search is equal to minmax search but eliminates the branches that can’t
influence the final decision?
a. Breadth-first search
b. Depth first search
c. Alpha-beta pruning
d. None of the above
Answer:

2. Which values are independent in minmax search alogirthm?

a. Pruned leaves x and y
b. Every states are dependant
c. Root is independent
d. None of the above
Answer:

Post Lab Subjective Questions:

1. Explain the concept of adversarial search

2. Explain how alpha-beta pruning improves memory efficiency of algorithm
3. Explain how a game of chess may benefit from min-max and alpha-beta
pruning algorithms.

Somaiya Vidyavihar University 2023-24 Batch Page 34

 K. J. Somaiya College of Engineering, Mumbai-77

Batch: Roll No.:

Experiment / assignment / tutorial No.

Title: Implementation of Constraint Satisfaction concepts

______________________________________________________________________
Objective: Implementation of Local search algorithm

Expected Outcome of Experiment:

Course After successful completion of the course students should be able to

Outcom
e

Analyse and solve problems for goal based agent architecture (searching and
CO2
planning algorithms).

______________________________________________________________________

Books/ Journals/ Websites referred:

1. “Artificial Intelligence: a Modern Approach” by Russel and Norving, Pearson
education Publications
2. “Artificial Intelligence” By Rich and knight, Tata Mcgraw Hill Publications
3.
______________________________________________________________________
Pre Lab/ Prior Concepts: Informed, uninformed search, Local search
______________________________________________________________________
Historical Profile:

______________________________________________________________________
New Concepts to be learned: Constraint Satisfaction, CSP with backtracking
______________________________________________________________________

Definition:- (Define CSP)

The sequence in which variable-constraint assignments are considered by CSP

algorithms to improve the backtracking efficiency:-

Somaiya Vidyavihar University 2023-24 Batch Page 35

 K. J. Somaiya College of Engineering, Mumbai-77

Problem chosen:

Step by styep solution to the problem:

Somaiya Vidyavihar University 2023-24 Batch Page 36

 K. J. Somaiya College of Engineering, Mumbai-77

Somaiya Vidyavihar University 2023-24 Batch Page 37

 K. J. Somaiya College of Engineering, Mumbai-77

Post Lab objective Questions:

To overcome the need to backtrack in constraint satisfaction problem can be

eliminated by ____________

a) Forward Searching

b) Constraint Propagation

c) Backtrack after a forward search

d) Omitting the constraints and focusing only on goals

Consider a problem of preparing a schedule for a class of student. What type of

problem is this?

a) Search Problem

b) Backtrack Problem

c) CSP

d) Planning Problem

Q1. How do you solve a CSP Problem?

Q2. Explain CSP with an example.

Batch: Roll No.:

Somaiya Vidyavihar University 2023-24 Batch Page 38
Experiment / assignment / tutorial No. 8
 K. J. Somaiya College of Engineering, Mumbai-77

Title: IEEE Case study on learning/planning techniques

______________________________________________________________________
Objective: Case study on AI System (learning/planning techniques) based paper
published in IEEE/ACM/Springer
______________________________________________________________________

Expected Outcome of Experiment:

Course After successful completion of the course students should be able to

Outcom
e

Analyse applications of AI and understand planning & learning processes in

advanced AI applications
CO4

______________________________________________________________________
Books/ Journals/ Websites referred:
______________________________________________________________________
Pre Lab/ Prior Concepts:
A learning agent is a tool in AI that is capable of learning from its experiences. It
starts with some basic knowledge and is then able to act and adapt autonomously,
through learning, to improve its own performance.

Artificial intelligence is an important technology in the future. Whether it is intelligent

robots, self-driving cars, or smart cities, they will all use different aspects of artificial
intelligence!!! But Planning is very important to make any such AI project.

Even Planning is an important part of Artificial Intelligence which deals with the tasks
and domains of a particular problem. Planning is considered the logical side of acting.

Everything we humans do is with a definite goal in mind, and all our actions are
oriented towards achieving our goal. Similarly, Planning is also done for Artificial
Intelligence.

For example, Planning is required to reach a particular destination. It is necessary to

find the best route in Planning, but the tasks to be done at a particular time and why
they are done are also very important.

______________________________________________________________________
Somaiya Vidyavihar University 2023-24 Batch Page 39
 K. J. Somaiya College of Engineering, Mumbai-77

Note: A minimum of two papers should be selected based on the AI application of

learning or planning concepts and summarized as follows.
Title :

Abstract of the paper

Proposed Architecture / System

Results

Conclusion

______________________________________________________________________
.

Somaiya Vidyavihar University 2023-24 Batch Page 40

 K. J. Somaiya College of Engineering, Mumbai-77

Batch: Roll No.:

Experiment / assignment / tutorial No. 9

Title: Virtual Lab 1

______________________________________________________________________
Objective: Self-Learning Experiment using Virtual Lab in NLP to introduce
concepts like word analysis, word generation and building POS Tagger

Expected Outcome of Experiment:

Course After successful completion of the course students should be able to

Outcom
e

Analyse applications of AI and understand planning & learning processes in

CO4
advanced AI applications

______________________________________________________________________

Books/ Journals/ Websites referred:

1. “Artificial Intelligence: a Modern Approach” by Russel and Norving, Pearson
education Publications
2. “Artificial Intelligence” By Rich and knight, Tata Mcgraw Hill Publications
______________________________________________________________________
Pre Lab/ Prior Concepts: Natural Language Processing
______________________________________________________________________

Theory: Discuss/Add the Language Model, Text Classification in NLP.

Reference Link: https://nlp-iiith.vlabs.ac.in/exp/word-analysis/

Somaiya Vidyavihar University 2023-24 Batch Page 41

 K. J. Somaiya College of Engineering, Mumbai-77

Batch: Roll No.:

Experiment / assignment / tutorial No. 10

Title: Virtual Lab 2

______________________________________________________________________
Objective: Understand the Virtual Lab Experiment for tagging Parts of Speech using
Hidden Markov Model.

Expected Outcome of Experiment:

Course After successful completion of the course students should be able to

Outcom
e

Analyse applications of AI and understand planning & learning processes in

CO4
advanced AI applications

______________________________________________________________________

Books/ Journals/ Websites referred:

3. “Artificial Intelligence: a Modern Approach” by Russel and Norving, Pearson
education Publications
4. “Artificial Intelligence” By Rich and knight, Tata Mcgraw Hill Publications
______________________________________________________________________
Pre Lab/ Prior Concepts: Natural Language Processing
______________________________________________________________________

Theory: Add/Discuss the Hidden Markov Model (HMM), calculating the various
Probabilities

Procedure for POS Tagging - Hidden Markov Model:

1
Somaiya Vidyavihar University 2023-24 Batch Page 42
 K. J. Somaiya College of Engineering, Mumbai-77

Reference Link: https://nlp-iiith.vlabs.ac.in/exp/markov-model/

Simulation Results:

Postlab Questions:

1. How is Hidden Markov Model different from Markov Model?

2. What is the basic design for HMM for finding out POS?

Somaiya Vidyavihar University 2023-24 Batch Page 43