0% found this document useful (0 votes)
4 views

ai unit1

The document discusses heuristic search methods and their applicability to various problem types, emphasizing the importance of problem decomposition for effective solutions. It introduces the concept of Production Systems (PS) as a framework for structuring AI programs, which includes defining initial and goal states, databases, and production rules. An example, the Water Jug Problem, illustrates the application of production rules to achieve a specific goal state using defined operations.

Uploaded by

charan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

ai unit1

The document discusses heuristic search methods and their applicability to various problem types, emphasizing the importance of problem decomposition for effective solutions. It introduces the concept of Production Systems (PS) as a framework for structuring AI programs, which includes defining initial and goal states, databases, and production rules. An example, the Water Jug Problem, illustrates the application of production rules to achieve a specific goal state using defined operations.

Uploaded by

charan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 39

2.

Problem Characteristics
 Heuristic search is a very general method applicable to a large class of problem.
 In order to choose the most appropriate method (or combination of methods) for a
particular problem it is necessary to analyze the problem along several key
dimensions.
Is the problem decomposable into a set of independent smaller sub problems?
 Decomposable problems can be solved by the divide-and- conquer technique.
 Use of decomposing problems:
Each sub-problem is simpler to solve.
Each sub-problem can be handed over to a different processor. Thus can be
solved in parallel processing environment.
There are non decomposable problems.
For example, Block world problem is non decomposable.
1.Problem Solving
AI programs have a clean separation of
computational components of data,operations
& control.
Search forms the core of many intelligent
processes.

It is useful to structure AI programs in a way


that facilitates describing the search process.
• Production System – PS
PS is a formation for structuring AI programs which
facilitates describing search process.
It consists of
Initial or start state of the problem
Final or goal state of the problem
It consists of one or more databases containing
information appropriate for the particular task.
The information in databases may be structured
using knowledge representation schemes.
• Production Rules
PS contains set of production rules,
each consisting of a left side that determines the applicability
of the rule and
a right side that describes the action to be performed if the
rule is applied.
These rules operate on the databases.
Application of rules change the database.
A control strategy that specifies the order in which the rules will
be applied when several rules match at once.
One of the examples of Production Systems is an Expert System.
Example : Water Jug Problem:Given two jugs, a 4-gallon and 3-gallon having no
measuring markers on them. There is a pump that can be used to fill the jugs with water.
How can you get exactly 2 gallons of water into 4- gallon jug.
Solution:
State for this problem can be described as the set of ordered pairs of
integers (X, Y) such that
 X represents the number of gallons of water in 4-gallon jug and
 Y for 3-gallon jug.
Start state is (0,0)
Goal state is (2, N) for any value of N.
• Production Rules
 Following are the production rules for this problem.


• R6: (X, Y | X+Y >= 3 L X > 0) à (X – (3 – Y), 3)
• {Pour water from 4-gallon jug into 3- gallon jug until 3-gallon
jug is full}
• R7: (X, Y | X+Y <= 4 L Y > 0) à (X+Y, 0)
• {Pour all water from 3-gallon jug into 4-gallon jug }
• R8: (X, Y | X+Y <= 3 L X > 0) à (0, X+Y)
• {Pour all water from 4-gallon jug into 3-gallon jug }
• Superficial Rules: {May not be used in this problem}
• R9: (X, Y | X > 0) à (X – D, Y)

•{Pour some water D out from 4-gallon jug} R10: (X, Y | Y > 0) à

(X, Y - D)
• {Pour some water D out from 3- gallon jug}
Trace of steps involved in solving the water jug problem - First solution
Trace of steps involved in solving the water jug problem - Second solution
Note that there may be more than one solutions.

You might also like