Artificial and Computational Intelligence - AIML ZG557

BIRLA INS TITUTE OF TECHNOLOGY & S CIENCE, PILANI
WORK INTEGRATED LEARNING PROGRAMMES

Digital Learning
Part A: Content Design
Course Title Artificial and Computational Intelligence

Course No(s) AIML**ZG557
Credit Units 5
Credit Model 1.25 - 1.5 - 2.25
1.25 unit for class room hours, 1.5 unit for Tutorial, 2.25
units for student preparation.
1 unit = 32 hours
Course Authors S .P.Vimal, Rajavadhana P
Version No 4.0
Date Aug 12, 2022
Course Objectives
No Course Objective
CO1 To provide a solid foundation for designing intelligent agents
CO2 Learn the representation and use of knowledge in inference-based problem

solving approaches
CO3 Learn to apply probability theory to describe and model agents operating in
uncertain environments
CO4 Learn the optimization models of computation and processing in real world
application of intelligent agents
Text Book(s)
T1 Stuart Russell and Peter Norvig, “Artificial Intelligence – A M odern Approach”,
Third Ed, Pearson Education, 2010
Reference Book(s) & other resources

R1 Ryszard S. M ichalski, Jaime G. Carbonell and Tom M . M itchell, “M achine
Learning: An Artificial Intelligence Approach”, Elsevier, 2014
R2 Dan W Patterson, “Introduction to AI and Expert Systems”, Prentice Hall of India,
New Delhi, 2010
R3 Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata M cGraw Hill
Publishing Company, New Delhi, 2003
Modular Content S tructure
0. Introduction
a. Artificial Intelligence: Foundations, Overview of M odern AI & Application
Domains.
1. Introduction to Intelligent Agents: Notion of Agents and Environments, Rationality,
Nature of Environments, Structure of Agents
2. Problem Solving Agent using Search:
a. Problem Formulation, Uninformed Search Algorithms: Uniform cost Search,
Depth Limited Search, Iterative Deepening Search – Informed Search Algorithms:
Notion of Heuristics, Greedy best first search, A* search, Optimality of A*
b. Heuristic Functions: Heuristic Accuracy & Algorithm performance, Admissible
heuristics from relaxed problems, pattern databases & Experience
c. Local Search Algorithms & Optimization Problems: Hill Climbing Search,
Simulated Annealing, Local Beam Search, Evolutionary Algorithms - Genetic
Algorithm, Ant Colony Optimization, Particle Swarm Optimization
3. Game Playing:
a. Searching to play games: M inimax Algorithm, Alpha-Beta Pruning
b. M aking imperfect real time decisions
4. Knowledge Representation using Logics:
(Pre-Reading: Logics- Propositional, Predicate, TT-Entail, Theorem Proving)
a. Logic Representation of a sample agent, Proof by resolution, DPLL Algorithm,
Agents based on Propositional logic
b. Overview of First Order Logic semantics, Example representation, Unification &
Lifting, forward chaining, Backward Chaining, Resolution
5. Probabilistic Representation and Reasoning
a. Inference using full joint distribution & Example, Knowledge representation
using Bayesian Networks, semantics of Bayesian Networks, Representation of
Conditional Independence using Bayesian Networks
b. Exact Inference - by enumeration and variable elimination, Need for Approximate
Inference - Direct Sampling
6. Reasoning over time
a. Time and Uncertainty, Inference in temporal models
b. Hidden M orkov M odels, Algorithms: Filtering, Smoothing, Finding the most
likely sequence, EM algorithms for Learning the parameters of HM M
7. Ethics in AI
a. Explainable AI- Logically Explained Network, Explainable Bayesian Network
Learning Outcomes:
No Learning Outcomes
LO1 Understand the environment and process of development to build intelligent

agents
LO2 Identify heuristics to pursue goals in exponentially large search spaces.
LO3 Represent problem and derive reasoning using logical inferences
LO4 Apply probability theory to describe and model agents operating in uncertain
environments
LO5 Analyze ways for agents to learn and improve their behavior.
Part B: Course Handout
Academic Term
Course Title Artificial and Computational Intelligence
Course No DS E**ZG557
Lead Instructor
S ession # List of Topic Title (from content structure in Part A) References
(1) What is Artificial Intelligence: Acting Humanly, Thinking T1: 1.1

humanly, Thinking rationally, Acting Rationally
1 (2) Foundations of AI T1: 1.2, 1.4
(3) Brief Overview of M odern AI & Application Domains.
(1) Intelligent Agents: Notion of Agents and Environments,

2 Rationality T1: Chapter 2
(2) Nature of Environments, Structure of Agents
Problem Solving Agent:

(1) Problem Formulation - Examples T1: Chapter
3 (2) Uninformed Search Algorithms: Uniform cost Search, 3.1-3.4, 3.5.1,
Depth Limited Search, Iterative Deepening Search. 3.5.2
(3) Notion of Heuristics
(4) Informed Search Algorithms : Greedy best first search, A*
search
Problem Solving Agent using Informed Search:
(1) Optimality of A* T1: Chapter
4 Heuristic Functions: 3.5.2, 3.6
(1) Heuristic Accuracy & Algorithm performance
(2) Admissible heuristics from relaxed problems, pattern
databases. & Experience
Local Search Algorithms & Optimization Problems

5 (1) Hill Climbing Search T1: Chapter
(2) Simulated Annealing, 4.1
(3) Local Beam Search
Local Search Algorithms & Optimization Problems T1: Chapter

6 (1) Genetic Algorithm 4.1, Research
papers & web
resources
Local Search Algorithms & Optimization Problems

7 (1) Ant Colony Optimization Research
(2) Particle Swarm Optimization papers & web
resources
Searching to play games:

(1) M inimax Algorithm T1: Chapter
8 (2) Alpha-Beta Pruning 5.1 to 5.4
(3) M aking imperfect real time decisions
Logical Agent:
9 (1) Logic Representation of a sample agent T1: Chapter
(2) DPLL Algorithm, Agents based on Propositional logic 7.1, 7.2, 7.5.2,
(3) Overview of First Order Logic semantics, Example 7.5.3, 7.6.1,
representation 8.1, 8.3.4
Inference in First Order Logic

(1) Unification & Lifting
10 (2) Forward chaining T1: Chapter 9
(3) Backward Chaining
11 Inference in First Order Logic T1: Chapter

(1) Resolution 9, 13, 14.1
Probabilistic Representation and Reasoning
(1) Inference using full joint distribution & Example
(2) Knowledge representation using Bayesian Networks
(1) Semantics of Bayesian Networks T1: 14.2, 14.3
12 (2) Representation of Conditional Independence using BN

13 (1) Exact Inference - by enumeration and variable elimination T1: 14.4, 14.5
(2) Need for Approximate Inference - Direct Sampling
Reasoning over time

14 (1) Time and Uncertainty T1: Chapter
(2) Inference in temporal models 15.1, 15.2
Reasoning over time

(1) Hidden M arkov M odels T1: Chapter ,
15 (2) Learning HM M Parameters using EM Algorithm 15.3, 20.3-
(3) Applications of HM M 20.3.3
Ethics in AI:
(1) Explainable AI- Logically Explained Network, Research
16 Explainable Bayesian Network papers & web
resources
Detailed Plan for Lab work/Design work

Lab Lab Objective Lab S heet Access URL Content Reference
No
1 Implementing Uninformed Search NA M odule #2

Algorithms
2 Implementing Informed Search NA M odule #2

Techniques
3 Implementing Local Search Techniques NA M odule #2
4 Implementing adversarial search NA M odule #3

techniques
5 Representing knowledge using logics NA M odule #4

and performing reasoning
6 Experimenting with Bayesian Networks NA M odule #5

and Inferencing
7 Experimenting with HM M NA M odule #6

Case studies: Detailed Plan
Case study No Case study Objective Case study S heet Access URL
- - -
Evaluation S cheme:
Legend: EC = Evaluation Component; AN = After Noon Session; FN = Fore Noon Session
No Name Type Duration Weight Day, Date, S ession, Time
EC-1 Quiz-I Online - 5% TBA
Assignment -1 Take- - 13% TBA
Home
Assignment -2 Take- - 12% TBA
Home
EC-2 M id-Semester Open/Clos 1.5 hours 30% TBA
Test ed Book
EC-3 Comprehensive Open/Clos 2.5 hours 40% TBA
Exam ed Book
Note:
Syllabus for M id-Semester Test (Open/Closed Book): Topics in Contact Sessions: 1 to 8
Syllabus for Comprehensive Exam (Open/Closed Book): All topics
Important links and information:

Elearn portal: https://elearn.bits-pilani.ac.in
Students are expected to visit the Elearn portal on a regular basis and stay up to date with the latest
announcements and deadlines.
Contact sessions: Students should attend the online lectures as per the schedule provided on the
Elearn portal.
Evaluation Guidelines:
1. EC-1 consists of two Assignments and one Quiz. Students will attempt them through the
course pages on the Elearn portal. Announcements will be made on the portal, in a timely
manner.
2. For Closed Book tests: No books or reference material of any kind will be permitted.
3. For Open Book exams: Use of books and any printed / written reference material (filed or
bound) is permitted. However, loose sheets of paper will not be allowed. Use of calculators
is permitted in all exams. Laptops/Mobiles of any kind are not allowed. Exchange of any
material is not allowed.
4. If a student is unable to appear for the Regular Test/Exam due to genuine exigencies, the
student should follow the procedure to apply for the M ake-Up Test/Exam which will be
made available on the Elearn portal. The M ake-Up Test/Exam will be conducted only at
selected exam centres on the dates to be announced later.
It shall be the responsibility of the individual student to be regular in maintaining the self-study
schedule as given in the course handout, attend the online lectures, and take all the prescribed
evaluation components such as Assignment/Quiz, M id-Semester Test and Comprehensive Exam
according to the evaluation scheme provided in the handout.

Artificial and Computational Intelligence - AIML ZG557

Uploaded by

Copyright:

Available Formats

Artificial and Computational Intelligence - AIML ZG557

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Artificial and Computational Intelligence - AIML ZG557

Uploaded by

Copyright:

Available Formats

BIRLA INS TITUTE OF TECHNOLOGY & S CIENCE, PILANI

WORK INTEGRATED LEARNING PROGRAMMES

Course Title Artificial and Computational Intelligence

CO1 To provide a solid foundation for designing intelligent agents

CO2 Learn the representation and use of knowledge in inference-based problem

Reference Book(s) & other resources

LO1 Understand the environment and process of development to build intelligent

LO2 Identify heuristics to pursue goals in exponentially large search spaces.

LO3 Represent problem and derive reasoning using logical inferences

Part B: Course Handout

Course Title Artificial and Computational Intelligence

S ession # List of Topic Title (from content structure in Part A) References

(1) What is Artificial Intelligence: Acting Humanly, Thinking T1: 1.1

(1) Intelligent Agents: Notion of Agents and Environments,

Problem Solving Agent:

Local Search Algorithms & Optimization Problems

Local Search Algorithms & Optimization Problems T1: Chapter

Local Search Algorithms & Optimization Problems

Searching to play games:

Inference in First Order Logic

11 Inference in First Order Logic T1: Chapter

Probabilistic Representation and Reasoning

Reasoning over time

Reasoning over time

Detailed Plan for Lab work/Design work

1 Implementing Uninformed Search NA M odule #2

2 Implementing Informed Search NA M odule #2

3 Implementing Local Search Techniques NA M odule #2

4 Implementing adversarial search NA M odule #3

5 Representing knowledge using logics NA M odule #4

6 Experimenting with Bayesian Networks NA M odule #5

7 Experimenting with HM M NA M odule #6

Important links and information:

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.