L T P C

23AD1302 ARTIFICIAL INTELLIGENCE AND EXPERT

3 0 0 3
SYSTEMS
COURSE OBJECTIVE
 To understand artificial intelligence principles, history and various Intelligent Agent.
 To learn about different problem-solving strategies using heuristic function.
 To analyze problems by identifying constraints and finding solutions that satisfy those constraints.
 To understand knowledge representation and planning.
 To introduce the concepts of Expert system and Responsible AI.

UNIT I INTRODUCTION TO ARTIFICIAL INTELLIGENCE 9

Definitions – Importance of AI, Foundation of AI, Intelligent Agents–Agent and Environment–Concept of
Rationality– Classification of AI Systems with Respect to Environment, Problem Solving Agents,
Application of AI, Future of AI.

UNIT II PROBLEM SOLVING 9

Search Algorithms, Heuristic Search–Heuristic Functions Local Search and Optimization Problems –
Local Search in Continuous Space – Search with Non–Deterministic Actions – Search in Partially
Observable Environments – Online Search Agents and Unknown Environments.

UNIT III CONSTRAINT SATISFACTION PROBLEMS AND GAME THEORY 9

Constraint Satisfaction Problems – Constraint Propagation – Backtracking Search for CSP – Local
Search for CSP –Structure of CSP–Game Playing – Mini–Max Algorithm – Optimal Decisions in Games
– Alpha–Beta Search – Cutting of Search – Forward Pruning – Monte–Carlo Search for Games –
Stochastic Games, Partially Observable Game, Card Game.

UNIT IV KNOWLEDGE REPRESENTATION AND PLANNING 9

Logical Agents: Knowledge–Based Agents–Propositional Logic–Propositional Theorem, First– Order
Logic: Knowledge Engineering in First order Logic– Interference, Knowledge Representation: Categories
and Objects–Events–Reasoning Systems and Default Information, Planning – Algorithms– Heuristics for
Planning – Hierarchical Planning – Non–Deterministic Domains – Time, schedule, and Resources –
Analysis.

UNIT V EXPERT SYSTEM AND RESPONSIBLE AI 9

Expert Systems – Stages in the Development of an Expert System – Probability Based Expert Systems
–Expert System Tools – Difficulties in Developing Expert Systems – Applications of Expert Systems–
Responsible AI – Ethical Decision Making–Need for Responsible AI–Approaches to Ethical Reasoning–
Ensuring Responsible AI in Practice.
TOTAL: 45 PERIODS
COURSE OUTCOMES
Upon successful completion of the course, students will be able to:
CO1 Analyze various Intelligent agent environment.
CO2 Apply search strategies in problem solving and game playing using heuristic function
CO3 Apply the CSP concepts for a scenario.
CO4 Implement logical agents and first-order logic problems.
CO5 Apply problem-solving strategies with knowledge representation mechanism for solving
hard problems.
CO6 Demonstrate the basics of expert systems and responsible AI to develop models.
 TEXT BOOKS

1. Russell, S. and Norvig, P. 2015. Artificial Intelligence - A Modern Approach, 3rd edition, Prentice
Hall (Unit I,II,IV).
2. Poole, D. and Mackworth, A. 2010. Artificial Intelligence: Foundations of Computational Agents,
Cambridge University Press (Unit I,II,III,IV).
3. Castillo, E., Gutiérrez, J. M., and Hadi, A. S. 1997. Expert Systems and Probabilistic Network
Models, Springer-Verlag. ISBN: 0-387-94858-9 (Unit V).
4. Virginia Dignum, 2019.Responsible Artificial Intelligence-How to Develop and use AI in a
Responsible Way, Springer. ISBN: 978-3-030-30371-6 (Unit V).

REFERENCE BOOKS
1. Elaine Rich, Kevin Knight and B.Nair, Artificial Intelligence 3rd Edition, McGraw Hill, 2017.
2. Luger, G.F. 2008. Artificial Intelligence -Structures and Strategies for Complex Problem Solving,
6th edition, Pearson. Brachman, R. and Levesque, H. 2004. Knowledge Representation and
Reasoning, Morgan Kaufmann
3. Alpaydin, E. 2010. Introduction to Machine Learning. 2nd edition.
4. Sutton R.S. and Barto, A.G. 1998. Reinforcement Learning: An Introduction, MIT Press.
5. Padhy, N.P. 2009. Artificial Intelligence and Intelligent Systems, Oxford University Press.
6. Sray Agarwal,Sashin Mishra, Responsible AI: Implementing Ethical and Unbiased Algorithms,
Springer. September 2021,ISBN:978-3030769772.

WEB REFERENCES
1. https://www.javatpoint.com/(Unit 1,2,3,4)
2. https://www.simplilearn.com/tutorials/artificial-intelligence-tutorial(Unit 1,2,3,4)
3. https://pythongeeks.org/(Unit 1,2,3,4)
4. https://www.upwork.com/resources/ai-ethical-considerations (UNIT V).
 23AD1302 –-ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS

UNIT 1

INTRODUCTION TO ARTIFICIAL INTELLIGENCE

Definitions – Importance of AI, Foundation of AI, Intelligent Agents–Agent and Environment–Concept

of Rationality– Classification of AI Systems with Respect to Environment, Problem Solving Agents,
Application of AI, Future of AI.

PART – A
1. What is AI? [May 03,04]
Artificial Intelligence is the branch of computer science concerned with making computers
behave like humans.
 Systems that think like humans
 Systems that act like humans
 Systems that think rationally
 Systems that act rationally

2. Define an agent. [May 03, Dec-09]

An agent is anything that can be viewed as perceiving its environment through sensors and acting
upon that environment through actuators.

3. What is an agent function? Differentiate an agent function and an agent program.

An agent’s behavior is described by the agent function that maps any given percept sequence to an
action.

AGENT FUNCTION AGENT PROGRAM

An abstract mathematical description A concrete implementation, running on the
agent Architecture.
4. Define rational agent? [Dec-05,11, May-10]
A rational agent is one that does the right thing. Here right thing is one that will cause agent to be more
successful. That leaves us with the problem of deciding how and when to evaluate the agent’s success.

5. List down the characteristics of intelligent agent? [May-11]

 The IA must learn and improve through interaction with the environment.
 The IA must adapt online and in the real time situation.
 The IA must accommodate new problem-solving rules incrementally.
 The IA must have memory which must exhibit storage and retrieval capabilities.

6. What can AI do today?

 Autonomous Planning and Scheduling
 Game Planning
 Autonomous Control
 Diagnosis
 Logistics Planning
 Robotics

7. What is a task environment? How it is specified?

Task environments are essentially the "problems" to which rational agents are the "solutions" .
A Task environment is specified using PEAS (Performance, Environment, Actuators, and
Sensors) description.

8. List the properties of task environments.

 Fully observable vs. partially observable.
 Deterministic vs. stochastic.
 Episodic vs sequential
 Static vs dynamic.
 Discrete vs. continuous.
 Single agent vs. multi agent.

9. What are the four different kinds of agent programs?
o Simple reflex agents;
o Model-based reflex agents;
o Goal-based agents; and
o Utility-based agents.

10. Classify the different types of knowledge.

a. simple relational knowledge
b. Inferential knowledge c. procedural knowledge d. Inheritable knowledge
 PART B

1. Explain in detail about foundation of AI.

2. Illustrate about Classification of AI systems with respect to the environment.
3. Analyze in detail about types of agents and solve the PEAS specification of the task
environment of an agent.

 Self-driving car
 Medical Diagnosis
 Vacuum Cleaner
 Part –picking Robot

4. Describe the steps involved in problem solving agents.

5. Discuss in detail about Intelligent agent and its features.
 UNIT II
PROBLEM SOLVING AGENTS

Search Algorithms, Heuristic Search–Heuristic Functions Local Search and Optimization Problems – Local
Search in Continuous Space – Search with Non–Deterministic Actions – Search in Partially Observable
Environments – Online Search Agents and Unknown Environments.

1. Compare Uninformed Search (Blind search) and informed Search (Heuristic Search)
strategies.
Uninformed or Blind Search Informed or Heuristic Search

 No additional  More effective

information beyond that  Uses problem-specific
provided in the problem knowledge beyond the definition
definition of the problem itself.
 Not effective
 No information about
number of steps or path
cost

2. Define Best-first-search.

Best-first search is an instance of the general TREE-SEARCH or GRAPH-SEARCH algorithm in

which a node is selected for expansion based on the evaluation function f(n ). Traditionally, the
node with the lowest evaluation function is selected for expansion.

3. List out the features of online search agents.

4. Define DLS.
5. What are the types of Hill Climbing?
6. What is global maximum?
 7. What is A* search?

A* search is the most widely-known form of best-first search. It evaluates the nodes by
combining g(n),the cost to reach the node, and h(n),the cost to get from the node to the goal:
f (n) = g(n) + h(n)
Where f (n) = estimated cost of the cheapest solution through n.
g (n) is the path cost from the start node to node n.
h (n) = heuristic function
A* search is both complete and optimal.
8. What are local search algorithms?

Local search algorithms operate using a single current state (rather than multiple paths) and generally
move only to neighbors of that state. The local search algorithms are not systematic. The
key two advantages are (i) they use very little memory – usually a constant amount, and (ii) they can
often find reasonable solutions in large or infinite (continuous) state spaces for which systematic
algorithms are unsuitable.

9. What is Hill-climbing search?

The Hill-climbing algorithm is simply a loop that continually moves in the direction of increasing
value –that is uphill. It terminates when it reaches a “peak” where no neighbor has a higher value.
The algorithm does not maintain a search tree so the current node data structure need only record
the state and its objective function value. Hill-climbing does not look ahead beyond the immediate
neighbors of the current state.

10. What are the variants of hill-climbing?

o Stochastic hill-climbing
 Random selection among the uphill moves.
 The selection probability can vary with the steepness of the uphill move.
o First-choice hill-climbing
 cfr. Stochastic hill climbing by generating successors randomly until a better one
is found.
o Random-restart hill-climbing
 Tries to avoid getting stuck in local maxima.

PART B

1. Classify the uninformed search techniques and explain any two of them .
2. Categorize the features of local search and optimization problems.
3. Elaborate in detail about Hill Climbing search algorithm and its types.
4. Identify the features of Online Search Agents and Unknown Environments.
5.Solve the given problem using Best First Search and A* Search algorithm and find an optimal solution
 UNIT III

CONSTRAINT SATISFACTION PROBLEMS AND GAME THEORY

PART A

1. What is constraint satisfaction problem? (Nov/Dec 2014)

Constraint satisfaction problems (CSPs) are mathematical problems defined as a set of objects
whose state must satisfy a number of constraints or limitations. CSPs represent the entities
in a problem as a homogeneous collection of finite constraints over variables, which are solved
by constraint satisfaction methods.

2. Define Global Maximum.

If elevation corresponds to an objective function, then the aim is to find the highest peak is
called global maximum.

3. Define a game.

Formal Definition of Game

We will consider games with two players, whom we will call MAX and MIN. MAX moves
first, and then they take turns moving until the game is over. At the end of the game, points
are awarded to the winning player and penalties are given to the loser. A game can be
formally defined as a search problem with the following components:

a. The initial state, which includes the board position and identifies the player to move.
b. A successor function, which returns a list of (move, state) pairs, each indicating
a legal move and the resulting state.
c. A terminal test, which describes when the game is over. States where the game
has ended are called terminal states.
d. A utility function (also called an objective function or payoff function), which give
a numeric value for the terminal states. In chess, the outcome is a win, loss, or
draw,with values +1,-1,or 0. he payoffs in backgammon range from +192 to -192
.

4. Whatis meant by forward pruning?

5. Why do we need optimal decision making in games?
6. What are the Advantages of MCTS?
 PART- B
1.Solve crypt arithmetic problem for the below Problem:
SEND
+MORE
MONEY
2.Explain Alpha-beta pruning with an example.

3.Identify the role of optimal decisions in multilayer games.

4.Explain in detail about Partially Observable game with an example.
5.Explain the Minimax algorithm in detail with an example of tic-tac-toe game.