Module 1 Lecture NotesAIML

Module – 1 Artificial Intelligence & Machine Learning (18CS71)
MODULE – 1
1) What is Artificial Intelligence ?
➢ Artificial Intelligence is the study of how to make computers do things which, at the
moment, people do better.
(1.1)The AI Problems
✓ Much of the early work in the field of AI focused on Formal Tasks, such as game playing
& theorem proving.
✓ Another early attempt that the AI focused is on the problem solving, often called
commonsense reasoning. It includes reasoning about physical objects & their
relationships to each other, as well as reasoning about actions & their consequences.
✓ As the research in AI progressed, the techniques for handling larger amounts of world
knowledge were developed, such as Perception (vision & speech), Natural language
understanding, and problem solving in specialized domains such as Medical diagnosis
& chemical analysis.
✓ The ability to use language to communicate a wide variety of ideas is perhaps the most
important thing that separates humans from the animals.
✓ The problem of understanding spoken language is a perceptual problem & is hard to

solve. But, we can simplify the problem by restricting it to written language.
✓ In addition to these mundane tasks i.e ordinary tasks, people can also perform one or
may be more specialized tasks.
✓ Some of the tasks that are the targets of work in AI are listed as follows;
Mundane Tasks
▪ Perception
- Vision
- Speech
▪ Natural language
- Understanding
- Generation
- Translation
▪ Commonsense reasoning
▪ Robot control
Department of CSE Page 2

Formal Tasks
▪ Games
- Chess
- Backgammon
- Checkers-Go
▪ Mathematics
- Geometry
- Logic
- Integral calculus
- Proving properties of programs
Expert Tasks
▪ Engineering
- Design
- Fault finding
- Manufacturing planning
▪ Scientific analysis
▪ Medical diagnosis
▪ Financial analysis
(1.2) The underlying assumption
✓ As a part of the research in AI, in 1976 Newell & Simon has come up with a “Physical
Symbol system hypothesis” & they gave a definition for “physical symbol”.
✓ Later they had come with a hypothesis about the “Physical symbol”.
✓ It was just an assumption & there is no proof or evidence to claim their hypothesis on
“physical symbol” is True. To claim it is True, the only way was to conduct an
experiment.
✓ The importance of the physical symbol hypothesis is twofold;
• Is a significant theory of the nature of human intelligence.

• Is of great interest to psychologists.
✓ It also forms the basis of the belief that it is possible to build programs that can perform
intelligent tasks now performed by people.

(1.3) What is an AI technique ?
✓ AI technique is a method that exploits knowledge that should be represented in such a

way that;
1) The knowledge captures generalizations. i.e it is not necessary to represent each

individual situation separately, instead situations that share important properties can
be grouped together.
2) It can be understood by people who provide it.
3) It can easily be modified to correct errors & to reflect changes in the world.
4) It can be used in many great situations even if it is not totally accurate (or) complete.
5) It can be used to narrow the range of possibilities to avoid bulkiness.
✓ Although AI techniques must be designed by considering the constraints imposed by AI

problems, it is sometimes possible to solve AI problems without using AI techniques.
Example: Tic-Tac-Toe game, Question Answering (In politics program, answers were
constructed by considering both the Input Text and a separate model of beliefs &
actions of various political entities.)
(1.4) The level of the model
✓ Before we produce some programs to make intelligent things work, we should know
exactly what we are trying to do.
✓ Efforts to build programs that perform tasks the way people do can be divided into two
classes;
Class 1: Programs in this class attempt to solve problems that do not really fit our
definition of an AI task.
They are the problems that a computer could easily solve, although that easy solution
would exploit mechanisms that do not seem to be available to people.
Class 2: Attempt to model human performance are those that do things that follow
more clearly within our definition of AI task.
(1.5) Criteria for Success
✓ In any scientific (or) engineering research project, we should be able to know whether
the machine that was built is really intelligent or not.

✓ In 1950, Alan Turing proposed a method for determining whether a machine can think.
His method is now known as “Turing Test”.
✓ To conduct this test, we need 2 people & the machine to be evaluated.
✓ One person plays the role of the interrogator, who would be in a separate room from
computer & other person.
✓ The interrogator can ask questions to either the person or the computer, by typing
questions & receiving typed responses.
✓ However, the interrogator knows them only as A & B, and aims to determine which one
is the person & which one is the machine based on the response they get.
✓ The aim of the machine is to fool the interrogator into believing that it is the person.
✓ If the machine succeeds, then we will conclude that the machine can think.
✓ The machine is allowed to do whatever it can to fool the interrogator.
✓ It will be a long time before a computer passes the Turing Test.
2) Problems, Problem Spaces & Search
➢ To build a system to solve a particular problem, we need to do four things;

1) Define the problem precisely.
2) Analyze the problem
3) Isolate & represent the task knowledge that is necessary to solve the problem.
4) Choose the best problem-solving technique(s) & apply it to the particular problem.
(2.1) Defining the problem as a state space search
✓ Suppose if we consider the problem statement “Play Chess”, in order to build a program
that could “Play chess”, we would first have to specify the starting position of the chess
board, the rules that define the legal moves, and the board positions that represent a
Win for one side or the other.
✓ If we write the rule for each board positions, then we will have to write a very large
number of them for roughly around 10120 possible board positions.
✓ In order to minimize the problems, we should look for a way to write the rules describing
the legal moves in as general a way as possible.

Rule – 1
Rule – 2
✓ The rule-2 defines the problem of playing chess as a problem of moving around in a
state space, where each state corresponds to a legal position of the board.
✓ This state space representation seems natural for chess because the set of states,
which corresponds to the set of board positions is artificial & well-organized.
✓ In order to provide a formal description of a problem, we must do the following;
1) Define a state space that contains all the possible configurations of the relevant
objects.
2) Specify one or more states within that space that describe possible situations from
which the problem solving may start. These are called as “Initial State”.
3) Specify one or more states that would be acceptable as solutions to the problem.
These states are called “Goal State”.
4) Specify a set of rules that describe the actions available.

(2.2) Production Systems
✓ Helps in structuring AI programs in a way that facilitates in describing & performing the
search process.
✓ Search forms the core of many intelligent processes.
✓ A Production system consists of the following;
i) A set of rules
- each consists of a left-side(pattern) that determines the applicability of the rule.
- a right-side that describes the operation to be performed if the rule is applied.
ii) Knowledge/Database
- will store the information of a particular task.
- Some parts of the database may be permanent, while other parts of it may
pertain only to the solution of the current problem.
iii) Control Strategy

- that specifies the order in which the rules will be compared to the database.
- and a way of resolving the conflicts that arise when several rules match at once.
iv) Rule applier
✓ In order to solve a problem, we must first reduce it to one for which a precise statement
can be given. This can be done by defining the problem’s state space & a set of
operators for moving in that space.
✓ The problem can then be solved by searching for a path through the space from an
initial state to a goal state.
[2.2.1] Control Strategies
❖ To decide which rule to be applied next during the process of searching for a solution to
a problem;
- The first requirement of a good control strategy is that it causes motion.

- The second requirement of a good control strategy is that it should be systematic.
❖ For example:
One systematic control strategy for the water jug problem is as follows;
i) Construct a tree with initial state as its root.
ii) Generate all the offspring of the root by applying each of the applicable rules to the
initial state.
iii) Now for each leaf node, generate all its successors by applying all the rules that are
appropriate.

iv) Continue this process until some rule produces a goal state.
-> This process is called the Breadth-First-Search.
❖ Other systematic control strategies are also available like Depth-First-Search & also we
do a process called backtracking too during this search.
[2.2.2] Heuristic Search
❖ Heuristic is a technique that improves the efficiency of a search process, possibly by

sacrificing claims of completeness.
❖ Some heuristics help to guide a search process without sacrificing any claims to
completeness that the process might previously have had.
❖ On an average, heuristics will improve the quality of the paths that are explored.
❖ Using good heuristics, we can hope to get good solutions to hard problems.
❖ There are some good general purpose heuristics that are useful in a wide variety of
problem domains.
❖ In addition, it is possible to construct special-purpose heuristics that exploit domain-

specific knowledge to solve particular problems.
❖ In many AI problems, however it is not possible to produce reassuring bounds for two
reasons;
1) For real world problems, it is often hard to measure precisely the value of a particular
solution.
2) It is impossible to define a knowledge can be implemented through mathematical
analysis.
❖ A heuristic function is a function that maps from problem state descriptions to measures
of desirability, usually represented as numbers.
❖ Well-designed heuristic functions can play an important part in efficiently guiding a

search process towards a solution.
❖ The purpose of a heuristic function is to guide the search process in the most profitable
direction by suggesting which path to follow first when more than one is available.

(2.3) Problem characteristics
➢ Heuristic search is a general method applicable for large class of problems and their
specific techniques will be effective for a small class of problems.
➢ In order to choose the appropriate method for a particular problem, it is necessary to

analyze the problem along several key dimensions such as;
1) Is the problem decomposable into a set of independent smaller or easier sub-problems?
Example: Suppose we want to solve the problem of computing the expression;
It can be decomposed as follows;
2) Can solution steps be ignored or at least undone if they prove unwise?
-> The solution steps can be either;

1) Ignorable
2) Recoverable
3) Irrecoverable
Example: 8 Puzzle
Start Goal
1 2 3 1 2 3
4 8 - 4 5 6
7 6 5 7 8 -

Blank space can move either UP, DOWN, LEFT, RIGHT
{ (1,2,3), (4,8,0), (7,6,5) }
DOWN
{(1,2,3), (4,8,5), (7,6,0) }
LEFT
{(1,2,3), (4,8,5), (7,0,6)}
UP
{(1,2,3), (4,0,5), (7,8,6)}
RIGHT
{(1,2,3), (4,5,0), (7,8,6)}
DOWN
{(1,2,3), (4,5,6), (7,8,0)}
8-Puzzle is Recoverable, and Chess is Irrecoverable.
3) Is the problem’s universe predictable?
After each move, are we able to predict the next state or not ?
4) Is a good solution to the problem obvious without comparison to all other possible
solutions?
i.e We cannot be sure whether the current path is correct without trying other possible
path.
Example: Travelling Salesman Problem(to find the shortest path)
5) Is the desired solution a state of the world or a path to a state?
Consider the problem of finding a consistent interpretation for the sentence;

“The bank president ate a dish of pasta salad with the fork”.
There are several components of this sentence, each of which in isolation may have more
than one interpretation.

6) Is a large amount of knowledge absolutely required to solve the problem, or is

knowledge important only to constrain the search?
Example: in chess, if we follow the rules about legal moves & some simple control
mechanism is good. Additional knowledge will help to speed up the execution of program.
7) Can a computer that is simply given the problem return the solution (or) will the solution
of the problem require interaction between the computer and a person?
Programs need frequent interaction with the Human User? Then, accordingly we need to
program it.
(2.4) Production System Characteristics
➢ Production systems are a good way to describe the operations that can be performed in
search for a solution to a problem.
➢ A monotonic production system is a production system in which the application of a rule

never prevents the later application of another rule.
➢ Whereas non-monotonic is just the reverse of monotonic.
➢ A partially commutative production system is a production system with the property that if
the application of a particular sequence of rules transforms state x into state y; then any
permutation of those rules that is allowable also transforms state x into state y.
➢ A commutative production system is a production system that is both monotonic & partially
commutative.
➢ There is no relationship between kinds of problems & kinds of production systems since all
problems can be solved by all kinds of systems.
➢ The four categories of production systems are;
Monotonic Non-monotonic
Partially commutative Theorem proving Robot navigation
Not partially commutative Chemical synthesis Bridge
a) Partially commutative, monotonic production systems are useful for solving ignorable
problems.
Department of CSE, AJIET, Mangaluru Page 11

b) Partially commutative, monotonic production systems are important from an implementation

standpoint because they can be implemented without the ability to backtrack to previous states
when it is discovered that an incorrect path has been followed.
c) Partially commutative, monotonic production systems are good for problems where things
do not change, new things get created.
d) Partially commutative, non-monotonic production systems are useful for problems in which
changes occur but can be reversed & in which, order of operations is not critical.
e) Not-partially commutative production systems are useful for many problems in which
irreversible changes occur.
(2.5) Issues in the design of Search Programs
➢ Every search process can be viewed as a traversal of a tree structure in which each node
represents a problem state & each arc represents a relationship between the states
represented by the nodes it connects.
➢ Some important issues that arise in search techniques are;
(i) The direction in which to conduct the search. (Forward Vs Backward reasoning)
→ We can search forward through the state space from the start state to a goal state, (or) we
can search backward from goal.
(ii) How to select applicable rules. (matching)

➔ Production systems typically spend most of their time looking for rules to appy.
(iii) How to represent each node of the search process.

➔ The knowledge representation problem
➔ The frame problem
(2.6) Additional Problems
a) The missionaries & Cannibals problem
→Number of missionaries on either side of the river is never less than the number of cannibals
who are on the same side.
→The boat can hold only two people at a time.
→How can everyone get across the river without missionaries risking being eaten.
b) The tower or Hanoi
c) The monkey & bananas problem
➔ Hungry monkey in a room.

➔ Bunch of bananas is hanging from the ceiling.
➔ A chair & a stick is available.
➔ What is the best sequence of actions for the monkey to take to acquire lunch?
3) Heuristic Search Techniques

➢ Heuristic search methods which are the general purpose control strategies for
controlling search is often known as "weak methods" because of their generality and
because they do not apply a great deal of knowledge.
3.1) GENERATE-AND-TEST
✓ The generate-and-test strategy is the simplest of all the approaches. It consists of
the following steps:
Algorithm:
1. Generate a possible solution. For some problems, this means generating a
particular point in the problem space. For others, it means generating a path
from a start state.
2. Test to see if this is actually a solution by comparing the chosen point or the
endpoint of the chosen path to the set of acceptable goal states.
3. If a solution has been found, quit. Otherwise return to step 1.
✓ If there exists a solution for one problem then this strategy definitely finds the
solution. Because the complete solution must be generated before they can be
tested.
✓ To implement this generate and test usually, we will use depth-first tree.
✓ This is not an efficient (mechanism) technique when the problem is much harder.
It is acceptable for simple problems.
Example: Water Jug Problem

3.2) HILL CLIMBING

✓ Hill climbing is a variant of generate-and-test in which feedback from the test
procedure is used to help the generator decide which direction to move in the
search space.
✓ Searching for a goal state = Climbing to the top of a Hill
✓ Climbing is = Generate-and-test + direction to move
[3.2.1] Simple Hill Climbing

✓ Algorithm:
1. Evaluate the initial state. If it is also goal state then return it, otherwise
continue with the initial states as the current state.
2. Loop until the solution is found or until there are no new operators to be
applied in the current state
a) Select an operator that has not yet been applied to the current state and
apply it to produce new state
b) Evaluate the new state
i. If it is a goal state then return it and quit
ii. If it is not a goal state but it is better than the current state, then
make it as current state
iii. If it is not better than the current state, then continue in loop
✓ The key difference between this algorithm and generate-and-test algorithm is the
use of an evaluation function as a way to inject task-specific knowledge into the
control process.
[3.2.2] Steepest-Ascent Hill Climbing

✓ A useful variation on simple hill climbing considers all the moves from the current
state and selects the best one as the next state. This method is called steepest-
ascent hill climbing or gradient search.
✓ Algorithm
1. Evaluate the initial state. If it is also a goal state then return it and quit.
Otherwise continue with the initial state as the current state.
2. Loop until a solution is found or until a complete iteration produces no
change to current state:
a. Let SUCC be a state such that any possible successor of the current state
will be better than SUCC.
b. For each operator that applies to the current state do:
i. Apply the operator and generate a new state.
ii. Evaluate the new state. If it is a goal state, then return it and quit. If not
compare it to SUCC. If it is better, then set SUCC to this state. If it is not
better, leave SUCC alone.
c. IF the SUCC is better than current state, then set current state to SUCC.
✓ Both the basic and steepest-ascent hill climbing may fail to find a solution.
✓ Either algorithm may terminate not by finding a goal state but by getting a state
from which no better states can be generated. This will happen if the program has
reached a local maximum, a plateau or a ridge.
✓ A local maximum is a state that is better than all its neighbors but it not better
than some other states farther away.
✓ At the local maximum, all moves appear to make things worse.
✓ A plateau is a flat area of the search space in which a whole set of neighboring
states has the same value. In this, it is not possible to determine the best direction
in which to move by making local comparisons.
✓ A ridge is a special kind of maximum. It is an area of the search space that is higher
than surrounding areas and that itself has a slope.
✓ There are some ways of dealing with these problems, although these methods are
by no means guaranteed:
▪ Backtrack to some earlier node and try going in a different direction. This is
particularly reasonable if at that node there was another direction that

looked as promising or almost as promising as the one that was chosen

earlier. This is a fairly good way to deal with local maxima.
▪ Make a big jump in some direction to try to get to a new section of the
search space. This is a good way of dealing with plateaus.
▪ Apply two or more rules before doing the test. This corresponds to moving
in several directions at once. This is a good strategy for dealing with ridges.
[3.2.3] Simulated Annealing

✓ Simulated annealing is a variation of hill climbing in which, at the beginning of the
process, some downhill moves may be made.
✓ Simulated annealing as a computational process is patterned after the physical
process of annealing, in which physical substances such as metals are slowly
cooled to make them reach a state of low energy where they are very strong.
✓ The rate at which the system is cooled is called the annealing schedule.
✓ The idea of simulated annealing is to do enough exploration of the whole space
early on.
✓ By doing so, we can lower the chances of getting caught at local maxima, plateau
and ridge.
✓ Easy to code for complex problems also, and gives a good solution.
✓ It is a slow process, and can’t tell whether an optimal solution is found, so for
finding a solution some other method is also required.
✓ It checks all neighbors.
✓ Moves to worst states may be accepted.
3.3) Best-First Search

✓ Best-First Search is a method which combines the advantages of both depth-first
search & breadth-first search. Into a single method.
[3.3.1] OR Graphs
✓ A graph is called OR Graph, since each of its branches represents
alternative problems solving path.
✓ At each step of the best-first search process, we select the most promising
of the nodes we have generated so far. This is done by applying an
appropriate heuristic function to each of them.
✓ We then expand the chosen node by using the rules to generate its
successors. If one of them is a solution, then we can quit. Otherwise the
process continues by adding new node to the set of nodes generated so
far.
✓ In DFS, it allows to find a solution without all competing branches having
to be expanded. In BFS, it does not get trapped on dead-end paths.
✓ One way of combining the two methods DFS and BFS is to follow a single
path at a time, but switch paths whenever some competing paths looks
more promising than the current one does.
[3.3.1] A* Search Algorithm
[3.3.3] Agendas
✓ An agenda is a list of task a system could perform.
✓ Associated with each task, there are usually two things;
i) A list of reasons why the task is being proposed.
ii) A rating representing the overall weight of evidence suggesting that the
task would be useful.
✓ One important question that arises in agenda-driven systems is how to
find the most promising task on each cycle. One way to do this, is
maintain the agenda sorted by rating.
✓ When a new task is created, insert it into the agenda in its proper place.
✓ When a task has its justifications changed, recomputed its rating and
move it to the correct place in the list.
3.4) Problem Reduction
➢ Problem reduction helps in planning to solve a problem that can be recursively

decomposed into sub-problems in multiple ways.

➢ There can be more than one decompositions of the same problem. We have to
decide which is the best way to decompose the problem so that the total solution
(or) cost of the solution is good.
[3.4.1] AND-OR Graphs
✓ The AND-OR graph (or tree) is useful for representing the solution of
problems that can be solved by decomposing them into a set of smaller
problems, all of which must then be solved.
✓ This decomposition or reduction generate arcs that we call AND arcs.
✓ One AND arc may point to any number of successors nodes all of which must
be solved in order for the arc to point to a solution.
✓ An example of an AND-OR Graph can be shown as below;
✓ OR node represents a choice between possible decomposition.
✓ AND node represents a given decomposition, which means that you need to
choose whatever is given.
✓ If we are given a graph in AND-OR, then we should not look only at the
minimum f(n) value at each node. This is explained as below with an example;

[3.4.2] AO* Algorithm

✓ AO* Algorithm is a generalized algorithm, which will always find minimum
cost solution.
✓ It is used for solving cyclic AND-OR graphs The AO* will use a single structure
GRAPH representing the part of the search graph that has been explicitly
generated so far.
✓ Each node in the graph will point both down to its immediate successors and
up to immediate predecessors.
✓ The top down traversing of the best-known path which guarantees that only
nodes that are on the best path will ever be considered for expansion.

[3.5] Constraint Satisfaction

✓ Many problems in AI can be viewed as problems of Constraint Satisfaction in
which the goal is to discover some problem state that satisfies a given set of
constraints.
✓ Constraint Satisfaction is a Search procedure that operates in a space of
Constraint sets.
✓ A goal state is any state that has been constrained enough.
✓ Constraint satisfaction is a 2-step process:

▪ Constraints are discovered and propagated as far as possible.
▪ If there is still not a solution, then search begins. A guess about is made
and added as a new constraint.
[3.6] Means – End Analysis
✓ In AI, there are many strategies which will try to find out a solution for an AI
problem either Backward or Forward direction.
✓ The Means-End Analysis is a method in which we can find the solution in both
forward as well as backward direction.
✓ We apply a suitable operator at a particular state in order to proceed to the
next state.
✓ The kind of backward chaining in which the operators are selected, then the
sub-goals are set up to establish the preconditions of the operators are called
“Operator Subgoaling”.
✓ If we don’t get a proper solution at the sub-goal, then that means we need to
prioritize either to find solution for the Big problem or Sub problem. During
that time, we use Means-End analysis to switch over from one to another in
finding the solution.
✓ The first AI program that used this Means-End analysis was the General
Problem Solver (GPS).

✓ Just like other problem solving techniques, Means-End analysis relies on a set
of rules that can transform one problem state into another state.
✓ These rules are not represented with complete state descriptions on each
side. Instead they are represented as;
Left Side: describes the conditions that must be met for the rule to be
applicable (Pre-conditions)
Right Side: describes those aspects of the problem that will be changed by
the application of the rule.
✓ A separate data structure named as “Difference Table” indexes the rules by

the difference that they can be used to reduce.
✓ Let us see an example to understand the implementation of Means-End

Analysis in order to move an object from one room to another room as
follows;
The steps are as follows;
1) DELETE from the initial state.
So, now it will be

2) MOVE from inside the circle to outside.
So, now it will be
3) EXPAND the “diamond” to make it little big as per the expectation at Goal
State.
So, finally we get the Goal state after going through several sub-problem’s
solutions.
✓ Another Example is a Simple household Robot domain, where the

requirement is to make the robot move a desk from one room to another
room, and also the object which was already there on the table.

The Robot’s Operators
The Difference Table

Module 1 Lecture NotesAIML

Uploaded by

Document Information

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

Module 1 Lecture NotesAIML

Uploaded by

Copyright:

Available Formats

Module – 1 Artificial Intelligence & Machine Learning (18CS71)

1) What is Artificial Intelligence ?

✓ The problem of understanding spoken language is a perceptual problem & is hard to

Department of CSE Page 2

(1.2) The underlying assumption

✓ The importance of the physical symbol hypothesis is twofold;

• Is a significant theory of the nature of human intelligence.

Department of CSE Page 3

(1.3) What is an AI technique ?

✓ AI technique is a method that exploits knowledge that should be represented in such a

1) The knowledge captures generalizations. i.e it is not necessary to represent each

2) It can be understood by people who provide it.

5) It can be used to narrow the range of possibilities to avoid bulkiness.

✓ Although AI techniques must be designed by considering the constraints imposed by AI

(1.4) The level of the model

(1.5) Criteria for Success

Department of CSE Page 4

✓ To conduct this test, we need 2 people & the machine to be evaluated.

✓ The machine is allowed to do whatever it can to fool the interrogator.

✓ It will be a long time before a computer passes the Turing Test.

2) Problems, Problem Spaces & Search

➢ To build a system to solve a particular problem, we need to do four things;

(2.1) Defining the problem as a state space search

Department of CSE Page 5

✓ In order to provide a formal description of a problem, we must do the following;

4) Specify a set of rules that describe the actions available.

Department of CSE Page 6

(2.2) Production Systems

✓ Search forms the core of many intelligent processes.

✓ A Production system consists of the following;

iii) Control Strategy

iv) Rule applier

[2.2.1] Control Strategies

- The first requirement of a good control strategy is that it causes motion.

Department of CSE Page 7

-> This process is called the Breadth-First-Search.

[2.2.2] Heuristic Search

❖ Heuristic is a technique that improves the efficiency of a search process, possibly by

❖ In addition, it is possible to construct special-purpose heuristics that exploit domain-

❖ Well-designed heuristic functions can play an important part in efficiently guiding a

Department of CSE Page 8

(2.3) Problem characteristics

➢ In order to choose the appropriate method for a particular problem, it is necessary to

1) Is the problem decomposable into a set of independent smaller or easier sub-problems?

Example: Suppose we want to solve the problem of computing the expression;

It can be decomposed as follows;

2) Can solution steps be ignored or at least undone if they prove unwise?

-> The solution steps can be either;

Department of CSE Page 9

Blank space can move either UP, DOWN, LEFT, RIGHT

{ (1,2,3), (4,8,0), (7,6,5) }

8-Puzzle is Recoverable, and Chess is Irrecoverable.

3) Is the problem’s universe predictable?

5) Is the desired solution a state of the world or a path to a state?

Consider the problem of finding a consistent interpretation for the sentence;

Department of CSE Page 10

6) Is a large amount of knowledge absolutely required to solve the problem, or is

(2.4) Production System Characteristics

➢ A monotonic production system is a production system in which the application of a rule

➢ Whereas non-monotonic is just the reverse of monotonic.

➢ The four categories of production systems are;

Partially commutative Theorem proving Robot navigation

Not partially commutative Chemical synthesis Bridge

Department of CSE, AJIET, Mangaluru Page 11