DSEC/CSE/ CS8691-ARTIFICIAL INTELLIGENCE /III/-C-VI

COURSE PLAN

Name of the Faculty K. RAMESH

Designation/Department AP/CSE
Course Code/Name CS8691/ ARTIFICIAL INTELLIGENCE
Year/Section/Department III/C/CSE
Credits Details L:3 T:0 P:0 C:3
Total Contact Hours Required 45
Syllabus:

UNIT I INTRODUCTION 9
Introduction–Definition - Future of Artificial Intelligence – Characteristics of Intelligent Agents–
Typical Intelligent Agents – Problem Solving Approach to Typical AI problems.

UNIT II PROBLEM SOLVING METHODS 9

Problem solving Methods - Search Strategies- Uninformed - Informed - Heuristics - Local Search
Algorithms and Optimization Problems - Searching with Partial Observations - Constraint Satisfaction
Problems – Constraint Propagation - Backtracking Search - Game Playing - Optimal Decisions in
Games – Alpha - Beta Pruning - Stochastic Games

UNIT III KNOWLEDGE RPRESENTATION 9

First Order Predicate Logic – Prolog Programming – Unification – Forward Chaining-Backward
Chaining – Resolution – Knowledge Representation - Ontological Engineering-Categories and
Objects – Events - Mental Events and Mental Objects - Reasoning Systems for Categories -
Reasoning with Default Information

UNIT IV SOFTWARE AGENTS 9

Architecture for Intelligent Agents – Agent communication – Negotiation and Bargaining –
Argumentation among Agents – Trust and Reputation in Multi-agent systems.

UNIT V APPLICATIONS 9
AI applications – Language Models – Information Retrieval- Information Extraction – Natural
Language Processing - Machine Translation – Speech Recognition – Robot – Hardware – Perception
– Planning – Moving

Objective:
∑ To understand the various characteristics of Intelligent agents
∑ To learn the different search strategies in AI
∑ To learn to represent knowledge in solving AI problems
1
 DSEC/CSE/ CS8691-ARTIFICIAL INTELLIGENCE /III/-C-VI

∑ To understand the different ways of designing software agents

∑ To know about the various applications of AI.

Text Book:

T1. S. Russell and P. Norvig, "Artificial Intelligence: A Modern Approachǁ, Prentice Hall, Third
Edition, 2009.
T2. Bratko, ―Prolog: Programming for Artificial Intelligenceǁ, Fourth edition, Addison-Wesley
Educational Publishers Inc., 2011.

Reference Book:

R1. M. Tim Jones, ―Artificial Intelligence: A Systems Approach (Computer Science) ǁ, Jones
and Bartlett Publishers, Inc.; First Edition, 2008
R2. Nils J. Nilsson, ―The Quest for Artificial Intelligenceǁ, Cambridge University Press, 2009
R3. William F. Clocksin and Christopher S. Mellish, ǁ Programming in Prolog: Using the ISO
Standardǁ, Fifth Edition, Springer, 2003.
R4. Gerhard Weiss, ―Multi Agent Systemsǁ, Second Edition, MIT Press, 2013.

Website:

W1.https://www.slideshare.net/premdeshmane/introduction-and-architecture-of-expert-system
(Topic no 28)
W2. https://www.slideshare.net/sabinkafle1/search strategies-in-ai (Topic no 11)
W3. https://www.slideshare.net/faizanadnan/ backtracking- (Topic no8)

Online Mode of Study (if Any):

NPTEL details can be listed.

v https://nptel.ac.in/courses/106/105/106105077/
v https://nptel.ac.in/courses/106/105/106105077/
v https://nptel.ac.in/courses/106/105/106105077/
v https://nptel.ac.in/courses/106/102/106102220/

Course Plan:

No of
Topic Books For Page Teaching Cumulative
Topic Name periods
No reference No Methodology periods
required
UNIT I INTRODUCTION 9
1 T1 1-30 BB 1 1
Introduction

2 T1, R2 1-4,1-5 BB 1 2
Definition of AI

2
 DSEC/CSE/ CS8691-ARTIFICIAL INTELLIGENCE /III/-C-VI

Future of Artificial 1066- BB

3 T1 1 3
Intelligence 1067
Characteristics of BB
4 T1 36-39 1 4
Intelligent Agents
T1, R1 46-58, BB
5 Typical Intelligent Agents 1 5
38-49
6 Problem Solving T1 64-68 BB 1 6
Approach to Typical AI T1 BB
7 64-95 1 7
problems.

8 Problem Solving example T1 96-101 BB 1 8

9 Solved Problem T1 102-107 BB 1 9

LEARNING OUTCOME:
At the end of unit, the students will be able to
∑ Know the importance of intelligent agents.
∑ Understand the concept of problem solving and its methods
∑ Understand the characteristics of intelligent agents
UNIT II PROBLEM SOLVING METHODS 9
Problem solving Methods - T1, BB
10 Search Strategies. 64-108 1 10
W2
Uninformed - Informed - BB
11 T1 81-103 1 11
Heuristics
Local Search Algorithms and BB
12 T1 121-129 1 12
Optimization Problems
Searching with Partial BB
13 T1 206-211 1 13
Observations
Constraint Satisfaction BB
14 T1 206-211 1 14
Problems
Constraint Propagation T1, BB
15 218-223 1 15
W3
Backtracking Search -Game BB
16 Playing
T1 163-168 1 16

17 Optimal Decisions in Games T1 163-168 BB 1 17

18 Alpha - Beta Pruning - T1 169-181 BB 1 18

Stochastic Games.
LEARNING OUTCOME:
At the end of unit, the students will be able to
∑ Know about various AI search algorithms (uninformed, informed, heuristic, constraint satisfaction,
genetic algorithms
∑ Identify and apply AI techniques to a wide range of problems, including complex problem solving via
search, knowledge-base systems, machine learning, probabilistic models, agent decision making, etc.
∑ Apply search to game-playing and to solve Constraint Satisfaction Problems.

3
 DSEC/CSE/ CS8691-ARTIFICIAL INTELLIGENCE /III/-C-VI

UNIT III KNOWLEDGE REPRESENTATION 9

First Order Predicate T1, R1 290-318 BB 1 19

19 Logic

Prolog Programming – T1. T2 330-334 BB 1 20

20
Unification
Forward Chaining- T1 335-349 BB 1 21
21
Backward Chaining
22 Resolution T1 350-361 BB 1 22

Knowledge Representation T1, R1 444-475 BB 24

23 - Ontological Engineering- 2
Categories and Objects
Events - Mental Events and T1 453-460 BB 1 25
24
Mental Objects
Reasoning Systems for T1 461-465 BB 1 26
25
Categories
Reasoning with Default T1 465-469 BB 1 27
26
Information
LEARNING OUTCOME:
At the end of unit, the students will be able to
∑ Demonstrate working knowledge of reasoning in the presence of incomplete and/or uncertain
information
∑ Know how to build simple knowledge-based systems
∑ Understand the fundamentals of events, objects and reasoning.
UNIT IV SOFTWARE AGENTS 9
Architecture for 1062- BB
27 Intelligent Agents. T1, W1 1 28
1063
Intelligent Agents. 1056- BB
28 T1 1 29
1061
29 Intelligent Agents T1 50-54 BB 1 30
Examples
Agent communication 1062- BB
30 T1 1 31
1064
31 Negotiation
T1 248 BB 1 32

32 Bargaining
R2, R3 345,169 BB 1 33
Argumentation among 1059- BB
33 Agents
T1 1 34
1060
Argumentation among 1061- BB
34 Agents
T1 1 35
1068
Trust and Reputation in BB
35 T1, R4 431-436 1 36
Multi-agent systems
LEARNING OUTCOME:
4
 DSEC/CSE/ CS8691-ARTIFICIAL INTELLIGENCE /III/-C-VI

At the end of unit, the students will be able to

∑ Understand the architecture of Intelligent Agents.
∑ Apply knowledge representation, reasoning, and machine learning techniques to real-world
problems
UNIT V APPLICATIONS 9
36 AI applications
T1, R2 24-28 BB 1 37

37 Language Models
T1 876-880 BB 1 38

38 Information Retrieval
T1 883-888 BB 1 39

39 Information Extraction
T1 889-903 BB 1 40
Natural Language BB
40 T1, R1 876-899 1 41
Processing
41 Machine Translation
T1 973-977 BB 1 42

42 Speech Recognition
T1 979-984 BB 1 43
Robot – Hardware – BB
43 T1, R4 988-991 1 44
Perception.
44 Planning – Moving
T1 1001-1007 BB 1 45
LEARNING OUTCOME:
At the end of unit, the students will be able to
∑ Know about the basics of information retrieval and extraction.
∑ Represent knowledge using machine translation techniques, speech recognition and natural
language processing.

COURSE OUTCOME
At the end of the course, the student should be able to:
CO1: Use appropriate search algorithms for any AI problem
CO2: Represent a problem using first order and predicate logic
CO3: Provide the apt agent strategy to solve a given problem
CO4: Design software agents to solve a problem
CO5: Design applications for NLP .

Course Outcome Vs Program Outcome Mapping:

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO 1 2 2 1 1 - - - - - - - -
CO 2 2 2 1 1 - - - - - - - -
CO 3 2 2 1 1 - - - - - - - -
CO 4 2 2 1 1 1 - - - - - - -
CO 5 3 2 2 2 1 - - - - - - -

CONTENT BEYOND THE SYLLABUS

∑ Human-like open domain chat bot
∑ Machine learning and de-noising
5
 DSEC/CSE/ CS8691-ARTIFICIAL INTELLIGENCE /III/-C-VI

Assignment: 1
Batch Register Total Mode of Topics
Details Number Number Assignment
1. crypt arithmetic problem for the below
814319104001- problem: SEND + MORE=MONEY
Batch 1 814319104018 18 MCQ 2. informed search techniques
3. alpha beta pruning with algorithm

814319104019-
814319104027,
1. Uniform search techniques
814319104029-
814319104031, 2. role of communication for intelligent
Batch 2 18 Seminar agents
814319104033,
814319104034, 3.first order logic to represent knowledge
814319104036-
814319104039
814319104040- 1. PEAS specification of the task
814319104050, environment
814319104053- 2. artificial intelligence in the future.
Batch 3 17 PPT
814319104055,
814319104058- 3. resolution and conversion to FOL
814319104060
Assignment: 2
Batch Register Total Mode of
Topics
Details Number Number Assignment
1. architecture for intelligent agents
2.backtracking search with algorithms
814319104001- for game playing.
Batch 1 18 Seminar
814319104018 3. unification algorithm to prove the
concept of resolution

814319104019- 1. water jug problem by using problem

814319104027, solving.
814319104029- 2.resolution and conversion to FOL
814319104031,
Batch 2 18 PPT 3. various applications of artificial
814319104033,
814319104034, intelligence
814319104036-
814319104039
814319104040- 1. forward chaining processes
814319104050, 2. Backward chaining process
814319104053- 3. Negotiation in detail
Batch 3 17 MCQ
814319104055,
814319104058-
814319104060

6
 DSEC/CSE/ CS8691-ARTIFICIAL INTELLIGENCE /III/-C-VI

Assignment: 3
Batch Register Total Mode of
Topics
Details Number Number Assignment
1. speech recognition concept
814319104001- 2. concepts of information retrieval
Batch 1 18 PPT
814319104018 3. Narrate argumentation among
agents
814319104019- 1. Bargaining theories in details
814319104027,
814319104029- 2. various hardware components
814319104031, required for a robot
Batch 2 18 MCQ
814319104033, 3. speech arts and communication
814319104034, levels
814319104036-
814319104039
814319104040- 1. concepts of machine translation
814319104050,
814319104053- 2. mental events and mental objects
Batch 3 17 Seminar
814319104055, with example
814319104058- 3. language model
814319104060

SIM Questions:

1. Explain crypt arithmetic problem for the below problem: SEND +

MORE=MONEY. (NOV/DEC 2018) (NOV/DEC 2017) (APR/MAY 2017)

2. Explain about the water jug problem by using problem solving

method.(NOV/DEC 2018)

3. Discuss about the greedy best first search and A * search. (APR/MAY 2018)
(NOV/DEC 2016)

4. Explain about the Uniform search techniques. (APR/MAY 2018)

SIM 1 5. Explain about the informed search techniques. (NOV/DEC 2017) (NOV/DEC
2016)

6. Explain assertions and queries in first order logic (NOV/DEC 2017)

7. Write a simple backtracking algorithm for constraint satisfaction problems.

8. Explain briefly problem-solving strategies.

9. Describe alpha beta pruning with algorithm.

10. Explain the backtracking search with algorithms for game playing.

7
 DSEC/CSE/ CS8691-ARTIFICIAL INTELLIGENCE /III/-C-VI

11. Describe the role of communication for intelligent agents.

12. Compare and contrast human intelligence to artificial intelligence with numerous
example and applications

1. What is abstract architecture for intelligent agents? (APR/MAY 2018)

2. Write briefly on concrete architectures for intelligent agents NOV/DEC 2019)

3. Write short note on layered architectures’/DEC 2019)

4. Explain Negotiation in detail. (APR/MAY 2019)

5. Explain Bargaining theories in details. (APR/MAY 2019)

6. Narrate argumentation among agents in details. NOV/DEC 2019)

SIM 2 7. With diagrammatic representation, explain trust and reputation in Multi agent
systems.

8. Briefly explain about speech arts and communication levels.

9. Explain about the four classes agents.

10. Explain about the types of control flow within layered architectures.

11. Explain about the resolution and conversion to FOL.

12. Illustrate the user of first order logic to represent knowledge

1. Explain speech recognition concept in details.

2. How is knowledge acquired by the process of information extraction?

(APR/MAY 2019)

3. Explain the Backward chaining process in detail with example. (NOV/DEC

2017)

4. Explain with an example the use of unification algorithm to prove the concept of
resolution.
SIM 3 5. Prepare how the natural language is processing and explain with relevant
example.

6. Define robotics. Discuss the various hardware components required for a robot.

7. Examine the PEAs specification of the task environment of an agent.

8. Analyze the Characteristic of intelligent Agents. (NOV/DEC 2017)

9. Explain the role of artificial intelligence in the future. (NOV/DEC 2016)

10. Explain Ontological Engineering categories and objects events. (NOV/DEC

8
 DSEC/CSE/ CS8691-ARTIFICIAL INTELLIGENCE /III/-C-VI

2016/17) (APR/MAY 2018)

11. Explain N-Gram character models smoothing n – gram models.

12. What is language model? Explain in detail. (NOV/DEC 2019)

Submission Details:
Phase 1(Before AT 1) Phase 2 (Before AT 2) Phase 3 (Model)
Assignment 1 SIM 1 Assignment 2 SIM 2 Assignment 3 SIM 3

GOOGLECLASSROOMCODE: bqyawt2

PREPARED BY VERIFIED BY

Mr.K.RAMESH Mrs. SOWMIYA.S.R

AP/CSE HOD/CSE

APPROVED BY

PRINCIPAL