Beruflich Dokumente
Kultur Dokumente
in
MODULE 1
Artificial Intelligence
Definition:
• AI is the study of how to make computers do the things, which at the moment,
people do better.
The AI problems:
• Some domains of AI
1. Mundane Tasks (Common tasks routine tasks, monotones, tiresome,
exciting etc.)
a. Perception
i. Vision
ii. Speech
b. Natural Language
i. Understanding
ii. Generation
iii. Translation
c. Common Sense Reasoning
i. Robot control formal tasks
2. Formal Tasks
a. Games
i. Chess
ii. Backgammon (ludo)
iii. Checkers-go
b. Mathematics
i. Geometry
ii. Logic
iii. Integral Calculus
iv. Proving properties of programs
3. Expert Tables
a. Engineering
i. Design
ii. Faull finding
iii. Manufacturing planning
b. Scientific Analysis
c. Medical diagnosis
d. Financial Analysis
What is the underlying assumption?
The heart of AI lies in the physical symbol system hypothesis (Newells simon).
The physical symbol system is defined as: It consists of a set of entities call
symbols which are the physical patterns which can occur as components of
another type of entity called an Expression (or symbol structure).
Dr. Satyanarayan Reddy K, Dept. of ISE, CITech, Bangalore Source : diginotes.in
P a g e | 2 | Module 1 Source : diginotes.in
A symbol structure is composed of a number of instances (or token) of
symbols related in some physical way.
At any instant of time the system will contain a collection of those symbol
structures, system also contains a collection of processes which operate an
expressions to produce other expressions, processes of creation,
modifications, processes of creation, modification, reproduction and
destruction.
The physical symbol system hypothesis:
A physical symbol system has the necessary and sufficient means for general
intelligent action.
What is an AI Technique?
Intelligence requires knowledge but the knowledge possess some less
desirable properties such as
It is voluminous
It is hard to characterize accurately.
It is constantly changing.
It differs from data which is organised in some way corresponding to the
way in which it will be used.
Thus we can define that an AI technique is a method which exploits
knowledge which should be represented in such a way that:
The knowledge captures generalizations: Each individual situation need not
be represented separately and the situations that share important
properties are grouped together.
Knowledge can be understood by people who must provide.
It can be modified easily to correct errors and to reflect the changes in the
world and in our world view.
It can be used in many situations even if it is not totally accurate or
complete.
By narrowing down the range of possibilities the sheer bulk of data can be
reduced, for being considered. The AI techniques must be designed
keeping in view the constraints imposed by AI problems.
How to build a system to solve a particular problem?
1) Define the problem precisely
a) What will be the specification of initial state and final state of acceptable
solution to the problem.
2) Analyse the problems:
a) Appropiate technique be selected for solving problem.
3) Isolate and represent the tasks knowledge which is necessary to solve the
problem.
4) Choose the best problem solving technique and apply it to solve the particular
problem.
Dr. Satyanarayan Reddy K, Dept. of ISE, CITech, Bangalore Source : diginotes.in
P a g e | 3 | Module 1 Source : diginotes.in
Now for each leaf node generate all the successors nodes by applying all
the rules that are appropriate.
Continue this process until application some rule produces a goal state.
This process is called the breadth first search.
3x2/2 ∫sin2x.cos2xdx
∫(1-cos2)cos2xdx
∫(cos2x-cos4)dx
∫cos2xdx - ∫cos4xdx
…
∫(1+cos2x)/2 dx …
1/2∫dx+1/2∫cos2xdx …
1/2x+1/2son2x/2 …
Dr. Satyanarayan Reddy K, Dept. of ISE, CITech, Bangalore Source : diginotes.in
P a g e | 10 | Module 1 Source : diginotes.in
Now consider the blocks world problem
Assume that the following operators are available :
1. CLEAR(x) [Block x has nothing on it]
ON(x,Table)[pickup x & put it on the table]
2. CLEAR(x) and CLEAR(y)
ON(x,y)[put x on y]
You can pick up a single block at a time.
Start state Goal state
C A
A B B
ON(C,A) C
ON(B,C)&ON(A,B)
Applying the technique of problem decomposition to this Blocks world example:
Solution:
CLEAR(A)
Move A to table
CLEAR(A)
ON(A,B)
Put A ON B
ON(A,B)
Solution steps:
ON(B,C)and ON(A,B) C A B
decompose ON(B,C)
ON(B,C) ON(A,B)
Put B ON C B Put B ON C
ON(B,C) C A
ON(A,B)
Put A ON B
A
B
C
2 8 3 1 2 3
1 6 4 8 4
7 5 7 6 5
2 8 3
1 4
7 6 5
2 3
1 8 4
7 6 5
Goal state