Professional Documents
Culture Documents
Artificial Intelligence
l Herbert Simon: We call programs intelligent if they exhibit behaviors that would be
regarded intelligent if they were exhibited by human beings.
l Elaine Rich: AI is the study of techniques for solving exponentially hard problems in
polynomial time by exploiting knowledge about the problem domain.
l Elaine Rich and Kevin Knight: AI is the study of how to make computers do things at
which, at the moment, people are better.
l Avron Barr and Edward Feigenbaum: Physicists ask what kind of place this universe
is and seek to characterize its behavior systematically. Biologists ask what it means
for a physical system to be living. We in AI wonder what kind of information-
processing system can ask such questions.
l Douglas Baker: AI is the attempt to make computers do what people think computers
cannot do.
2 Mahesh Maurya,NMIMS
What is AI?
General definition:
3 Mahesh Maurya,NMIMS
What is AI?
Tighter definition:
4 Mahesh Maurya,NMIMS
What is AI?
§ understanding language
§ perception
§ learning
§ reasoning
5 Mahesh Maurya,NMIMS
What is AI?
Self-defeating definition:
6 Mahesh Maurya,NMIMS
What is AI?
Self-fulfilling definition:
7 Mahesh Maurya,NMIMS
• Definition of AI
9 Mahesh Maurya,NMIMS
What is intelligence?
10 Mahesh Maurya,NMIMS
somewhere, something went wrong
11 Mahesh Maurya,NMIMS
What is AI?
12 Mahesh Maurya,NMIMS
Rationality:
13 Mahesh Maurya,NMIMS
Applications of AI
14 Mahesh Maurya,NMIMS
Machine translation
15 Mahesh Maurya,NMIMS
AI applications (contd.)
16 Mahesh Maurya,NMIMS
AI in electrical gadgets
17 Mahesh Maurya,NMIMS
Decision support systems
18 Mahesh Maurya,NMIMS
AI pioneers
l Alan Turing(1912-1954)
– Father of computer science
– Turing test for AI
l Marvin Minsky (MIT)
– Built first Neural network computer SNARC
l John McCarthy ( Stanford University )
– Developed LISP, AI programming language
19 Mahesh Maurya,NMIMS
What is AI?
20 Mahesh Maurya,NMIMS
What is AI?
21 Mahesh Maurya,NMIMS
Acting Humanly: The Turing Test
(1950)
22 Mahesh Maurya,NMIMS
Acting Humanly: The Turing Test
24 Mahesh Maurya,NMIMS
Thinking Rationally: Laws of Thought
26 Mahesh Maurya,NMIMS
AI Foundations?
To investigate
human mind Theories of
reasoning and
learning
AI
Linguistic
Mathematics
The meaning and Theories of logic
structure of probability, decision
language CS making and computation
Make AI a reality
27 Mahesh Maurya,NMIMS
Pre-history of AI
the quest for understanding & automating intelligence has deep roots
4th cent. B.C.: Aristotle studied mind & thought, defined formal logic
14th–16th cent.: Renaissance thought built on the idea that all natural or
artificial processes could be mathematically analyzed and
understood
18th cent.: Descartes emphasized the distinction between mind & brain
(famous for "Cogito ergo sum")
19th cent.: advances is science & understanding nature made the idea
of creating artificial life seem plausible
n Shelley's Frankenstein raised moral and ethical questions
n Babbage's Analytical Engine proposed a general-purpose, programmable computing
machine -- metaphor for the brain
19th-20th cent.: saw many advances in logic formalisms, including
Boole's algebra, Frege's predicate calculus, Tarski's theory of
28 reference Mahesh Maurya,NMIMS
John McCarthy
29 Marvin
Mahesh Minsky
Maurya,NMIMS
History of AI
the history of AI research is a continual cycle of
optimism & hype à reality check & backlash à refocus & progress à
…
n first
neural net simulator (Minsky): could learn to traverse a maze
n GPS (Newell & Simon): general problem-solver/planner, means-
end analysis
n Geometry Theorem Prover (Gelertner): input diagrams, backward
reasoning
30 n SAINT(Slagle): symbolic integration, couldMahesh
pass Maurya,NMIMS
MIT calculus
exam
History of AI
33 Mahesh Maurya,NMIMS
History of AI
34 Mahesh Maurya,NMIMS
The Foundations of AI
35 Mahesh Maurya,NMIMS
The Foundations of AI
36 Mahesh Maurya,NMIMS
A Brief History of AI
38 Mahesh Maurya,NMIMS
History of AI
39 Mahesh Maurya,NMIMS
Development of AI
40 Mahesh Maurya,NMIMS
General problem solvers
n limitations:
n hardware capabilities
n sometimes called "weak solution methods"
41 Mahesh Maurya,NMIMS
Examples of General Problem
Solvers
n LOGIC THEORIST
n could prove 38 of the first 52 theorems in the Principia
Mathematica
n Journal of Symbolic Logic declined publishing an article with Logic
Theorist as a co-author
42 Mahesh Maurya,NMIMS
Power
43 Mahesh Maurya,NMIMS
Romantic period
44 Mahesh Maurya,NMIMS
Examples of Romantic Period
45 Mahesh Maurya,NMIMS
SHRLDU
48 Mahesh Maurya,NMIMS
Knowledge based approaches
49 Mahesh Maurya,NMIMS
Knowledge based approaches
50 Mahesh Maurya,NMIMS
Biological and Social Models
n Software agents
n Semi-autonomous agents, with little knowledge of other agents
solve part of a problem, which is reported to other agents.
n Through the efforts of many agents a problem is solved.
51 Mahesh Maurya,NMIMS
Neural networks
52 Mahesh Maurya,NMIMS
Neural networks
53 Mahesh Maurya,NMIMS
Genetic algorithms
54 Mahesh Maurya,NMIMS
Genetic algorithms
55 Mahesh Maurya,NMIMS
Philosophical extremes in AI
Neats vs. Scruffies
57 Mahesh Maurya,NMIMS
Different views of AI
Strong view
n The effort to develop computer-based systems that behave
as humans.
n Argues that an appropriately programmed computer really is
a mind, that understands and has cognitive states.
n “The study is to proceed on the basis of the conjecture that
every aspect of learning or any other feature of intelligence
can in principle be so precisely described that a machine can
be made to simulate.” (From Dartmouth conference.)
58 Mahesh Maurya,NMIMS
Different views of AI
Weak view
n Use “intelligent” programs to test theories about how
human beings carry out cognitive operations.
n AI is the study of mental faculties through the use of
computational models.
n Computer-based system that acts in such a way (i.e.,
performs tasks) that if done by a human we would call it
‘intelligent’ or ‘requiring intelligence’.
59 Mahesh Maurya,NMIMS
Criteria for success
n long term: Turing Test (for Weak AI)
n as proposed by Alan Turing (1950), if a computer can make people
think it is human (i.e., intelligent) via an unrestricted conversation,
then it is intelligent
n Turing predicted fully intelligent machines by 2000, not even close
n Loebner Prize competition, extremely controversial
§ short term: more modest success in limited domains
§ performance equal or better than humans
e.g., game playing (Deep Blue), expert systems (MYCIN)
61 Mahesh Maurya,NMIMS
Turing test
AI system
Experimenter
62 Control
Mahesh Maurya,NMIMS
Appeal of the Turing Test
n Provides an objective notion of intelligence, i.e., compare
intelligence of the system to something that is considered
intelligent, avoiding debates over what is intelligence.
Alan Turing
63 Mahesh Maurya,NMIMS
Weaknesses of the Turing Test
n The breadth of the test is nearly impossible to achieve.
Correct
Chinese Responses
Writing is given
to the person
Set of rules, in
English, for
transforming phrases
65 Mahesh Maurya,NMIMS
The Chinese Room Scenario
n An individual is locked in a room and given a batch of Chinese writing. The
person locked in the room does not understand Chinese.
n Next she is given more Chinese writing and a set of rules (in English which
she understands) on how to collate the first set of Chinese characters with
the second set of Chinese characters.
n If the person becomes good at manipulating the Chinese symbols and the
rules are good enough, then to someone outside the room it appears that the
person understands Chinese.
66 Mahesh Maurya,NMIMS
Does the person understand
Chinese?
n Why?
n Why not?
67 Mahesh Maurya,NMIMS
Branches of AI
68 Mahesh Maurya,NMIMS
Software intelligent agents
69 Mahesh Maurya,NMIMS
Some development environments and tools
l Emotional Intelligence –
– “I think therefore I am.” Renee Descartes, about 1640.
– “Descartes Error” is a book by Antonio R Damasio, 1995, in which he
proposes that traditional rational thought without emotional content
fails to create intelligent behavior.
75 Mahesh Maurya,NMIMS
Proposed AI Systems
– Genetic Algorithms
l represents behavioral rules as long strings, termed
“genomes.”
l Behavior is evolved as various genomes are tried
and evaluated.
l Higher rated genomes are allowed to survive and
“reproduce” with other high ranking genomes.
77 Mahesh Maurya,NMIMS
Ant Logic Example
l Traveling Salesman – based on biological ant foraging techniques.
s a
Goal – find the minimum
cost route to visit each city
exactly once, starting and
ending at the start city. b
c
Solution – Allow many agents
to wander, leaving markers d
that weaken over time. Build
a path over time with the e f
strongest markers.
78 Mahesh Maurya,NMIMS
Emergent Example
l Rules –
– Avoid collisions.
– Match velocity vector of local group.
– Move toward center of m ass of local group.
79 l Mahesh Maurya,NMIMS
http://www.codepuppies.com/~steve/aqua.
The State of the Art
80 Mahesh Maurya,NMIMS
Introductory Problem: Tic-Tac-Toe
; ;
R
81 Mahesh Maurya,NMIMS
Introductory Problem: Tic-Tac-Toe
Program 1:
Comments:
3. Difficult to extend.
83 Mahesh Maurya,NMIMS
Introductory Problem: Tic-Tac-Toe
84 Mahesh Maurya,NMIMS
Introductory Problem: Tic-Tac-Toe
Program 2:
Turn = 1 Go(1)
Turn = 2 If Board[5] is blank, Go(5), else
Go(1)
Turn = 3 If Board[9] is blank, Go(9), else
Go(3)
Turn = 4 If Posswin(X) ≠ 0, then
Go(Posswin(X))
85 Mahesh Maurya,NMIMS
.......
Introductory Problem: Tic-Tac-Toe
Comments:
3. Hard to generalize.
86 Mahesh Maurya,NMIMS
Introductory Problem: Tic-Tac-Toe
−
87 Mahesh Maurya,NMIMS
Introductory Problem: Tic-Tac-Toe
Comments:
88 Mahesh Maurya,NMIMS
Introductory Problem: Tic-Tac-Toe
Program 3:
1. If it is a win, give it the highest rating.
2. Otherwise, consider all the moves the
opponent could make next. Assume the
opponent will make the move that is worst
for us. Assign the rating of that move to the
current node.
3. The best node is then the one with the
highest rating.
89 Mahesh Maurya,NMIMS
Introductory Problem: Tic-Tac-Toe
Comments:
90 Mahesh Maurya,NMIMS
Introductory Problem: Question
Answering
Program 1:
1. Match predefined templates to questions to
generate text patterns.
2. Match text patterns to input texts to get
answers.
“What did X Y” “What did Mary go shopping
for?” “Mary go shopping for Z”
Z = a new coat
92 Mahesh Maurya,NMIMS
Introductory Problem: Question
Answering
Program 2:
Structured representation of sentences:
Event2: Thing1:
instance: Finding instance: Coat
Tense: Past colour: Red
agent: Mary
object: Thing 1
93 Mahesh Maurya,NMIMS
Introductory Problem: Question
Answering
Program 3:
Background world knowledge:
C finds M
C leaves L C buys M
C leaves L
C takes M
94 Mahesh Maurya,NMIMS
Intelligent Agents
l Sub Topics
– Agents and environments
– Rationality
– PEAS (Performance measure, Environment,
Actuators, Sensors)
– Environment types
– Agent types
Agents
l \input{tables/vacuum-agent-function-table
Rational agents
l \input{algorithms/table-agent-algorithm}
l Drawbacks:
– Huge table (10 150 entries for simple chess)
– Take a long time to build the table
– No autonomy
– Even with learning, need a long time to learn the
table entries
Agent program for a vacuum-cleaner
agent
l \input{algorithms/reflex-vacuum-agent-
algorithm}
l function Reflex-vacuum-agent ([ location,
status ]) returns an ACTION
l if status= DIRT then return SUCK
l else if location = A then return RIGHT
l else if location = B then return LEFT
Agent types
\input{algorithms/d-agent-algorithm}
function Simple-Reflex-agent ([ percept])
returns an ACTION
static : rules, a set of condition-action rules
Status - Interpret-input (percept)
Rule - Rule-match(state, rule)
Action - Rule-action[rule]
Return action
If car-in-front-is-braking then initiate-
breaking
Model-based reflex agents
Model-based reflex agents
\input{algorithms/d+-agent-algorithm}
function Reflex-agent-with-state ( percept) returns
an ACTION
static : state, a description of the current world state
rules, a set of condition-action rules
action, the most recent action, initially none
State - Update-state (state, action, percept)
Rule - Rule-match(state, rule)
Action - Rule-action[rule]
Return action
Goal-based agents
Utility-based agents
Cont…
12
4 Mahesh Maurya,NMIMS