Scribd
Upload
6 views

5 Problem characteristics

Uploaded by

Mythily Ganesh
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
6 views

5 Problem characteristics

Uploaded by

Mythily Ganesh
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/ 22

PROBLEM

CHARACTERISTICS
PROBLEM
CHARACTERISTICS
Inorder to choose the most appropriate
method for a particular problem, it is
necessary to analyze the problem along
several key dimensions
PROBLEM
CHARACTERISTICS
Is the problem decomposable into a set of independent
smaller or easier sub problems?
Can solution steps be ignored or at least undone if they
prove unwise?
Is the problem’s universe predictable?
Is a good solution to the problem obvious without
comparison to all other possible solutions?
Is the desired solution a state of the world or a path to a
state?
Is a large amount of knowledge absolutely required to solve
the problem or is knowledge important only to constrain the
search?
Can a computer that is simply given the problem return the
solution or will the solution of the problem require interaction
IS THE PROBLEM
DECOMPOSABLE
A very large and composite
problem can be easily solved if it
can be broken into smaller
problems and recursion could be
used.
Suppose we want to solve.
Ex:- ∫ x2 + 3x+sin2x cos 2x dx

This can be done by breaking it


into three smaller problems and
solving each by applying specific
rules. Adding the results the
complete solution is obtained.
CAN SOLUTION STEPS BE
IGNORED OR UNDONE?
Problem fall under three classes ignorable , recoverable and
irrecoverable. This classification is with reference to the steps of
the solution to a problem.
A knowledge of these will help in determining the control structure.
1. Ignorable problems Ex:- theorem proving- steps can be ignored.
2. Recoverable problems Ex:- 8 puzzle- steps can be undone
3. Irrecoverable problems Ex:- Chess - steps can’t be undone
IS THE PROBLEM UNIVERSE
PREDICTABLE?

Problems can be classified into those with certain outcome


(8-puzzle and water jug problems) and those with uncertain
outcome (playing cards) .
In certain – outcome problems, planning could be done to
generate a sequence of operators that guarantees to lead to
a solution.
IS GOOD SOLUTION ABSOLUTE
OR RELATIVE ?
There are two categories of problems.
any – path problems : Ex-8 puzzle
problems- satisfied with the solution,
unmindful of the solution path taken-by
heuristic methods we obtain a solution
and we do not explore alternatives
best-path problems : Ex TSP-not just
any solution is acceptable (We want the
best- finds the shortest path)- all
possible paths are explored using an
exhaustive search until the best path is
obtained.
Any-path problems can often be solved
in a reasonable amount of time by
using heuristics that suggest good
paths to explore.
Best path problems are computationally
harder.
CONSIDER THE PROBLEM OF ANSWERING QUESTIONS
BASED ON A DATABASE OF SIMPLE FACTS SUCH AS THE
FOLLOWING:

1. Alex was a man.


2. Alex was a worker in a company.
3. Alex was born in 1905.
4. All men are mortal.
5. All workers in a factory died when there was an accident in 1952.
6. No mortal lives longer than 100 years.

Suppose we ask a question: ‘Is Alex alive?’

By representing these facts in a formal language, such as predicate


logic, and then using formal inference methods we can derive an
answer to this question easily.
THERE ARE TWO WAYS TO ANSWER THE QUESTION
SHOWN BELOW:
Method I:

1. Alex was a man.

2. Alex was born in 1905.

3. All men are mortal.

4. Now it is 2019, so Alex’s age is 114 years.

5. No mortal lives longer than 100 years.

Method II:

1. Alex is a worker in the company.

2. All workers in the company died in 1952.

Answer: So Alex is not alive. It is the answer from the above methods.

We are interested to answer the question; it does not matter which path we follow.
If we follow one path successfully to the correct answer, then there is no reason to
go back and check another path to lead the solution.
IS THE SOLUTION A STATE OR A
PATH?

Finding a consistent interpretation for the


sentence “The bank president ate a dish of
pasta salad with the fork”.
We need to find the interpretation but not the
record of the processing.
Ex: Water jug : Here it is not sufficient to
report that we have solved , but the path that
we found to the state (2,0). Thus the a
statement of a solution to this problem must
be a sequence of operations ( Plan) that
produces the final state.
THE KNOWLEDGE BASE CONSISTENT ?

In some problems the knowledge base is consistent


and in some it is not.
For example consider the case when a Boolean
expression is evaluated. The knowledge base now
contains theorems and laws of Boolean Algebra which
are always true.
On the contrary consider a knowledge base that
contains facts about production and cost. These keep
varying with time.
Hence many reasoning schemes that work well in
consistent domains are not appropriate in inconsistent
domains.
WHAT IS THE ROLE OF KNOWLEDGE?

Playing chess : the rules for determining


legal moves and some simple control
mechanism is sufficient to arrive at a
solution.
But additional knowledge about good
strategy and tactics could help to
constrain the search and speed up the
execution of the program. The solution
would then be realistic.
News paper understanding : Consider the
case of predicting the political trend. This
would require an enormous amount of
knowledge even to be able to recognize a
solution , leave alone the best.
DOES THE TASK REQUIRES
INTERACTION WITH THE
PERSON.
The programs require intermediate interaction with
people for additional inputs and to provide
reassurance to the user.
There are two types of programs:
 Solitary- given a problem description and produce an answer
with no intermediate interaction
 Conversational: intermediate communication between a
person and the computer- Ex:- Problems such as medical
diagnosis

Decision on using one of these approaches will be


important in the choice of problem solving method.
PROBLEM
CLASSIFICATION
There are several broad classes into which the
problems fall.
These classes can each be associated with
generic control strategy that is appropriate for
solving the problems
Classification : ex: medical diagnostics, diagnosis
of faults in mechanical devices
Propose and Refine: ex: design and planning
ISSUES IN THE DESIGN OF SEARCH
PROGRAMS

The direction in which to conduct the search


( forward versus backward reasoning).
How to select applicable rules ( Matching)
How to represent each node of the search process (
knowledge representation problem)
SUMMARY

Four steps for designing a program to solve a


problem:
Define the problem precisely
Analyse the problem
Identify and represent the knowledge
required by the task
Choose one or more techniques for problem
solving and apply those techniques to the
problem.
ANALYSIS OF PROBLEM
CHARACTERISTICS
EX: WATER JUG PROBLEM

18
19

You might also like