AI Chapter1
AI Chapter1
An Introductory Course
Outline
1. Introduction
2. Problems and Search 3. Knowledge Representation 4. Advanced Topics
- Game Playing - Uncertainty and Imprecision - Planning - Machine Learning
2
References
Artificial Intelligence (1991)
Elaine Rich & Kevin Knight, Second Ed, Tata McGraw Hill
Introduction
What is AI?
The foundations of AI A brief history of AI The state of the art Introductory problems
What is AI?
What is AI?
Intelligence: ability to learn, understand and think
(Oxford dictionary)
What is AI?
Thinking humanly Thinking rationally
Acting humanly
Acting rationally
Human Interrogator
AI System
8
10
Obstacles:
11
Acting Rationally
Acting so as to achieve ones goals, given ones
beliefs.
12
The Foundations of AI
Philosophy (423 BC - present):
- Logic, methods of reasoning. - Mind as a physical system. - Foundations of learning, language, and rationality.
13
The Foundations of AI
Psychology (1879 - present):
- Adaptation. - Phenomena of perception and motor control. - Experimental techniques.
14
A Brief History of AI
The gestation of AI (1943 - 1956):
- 1943: McCulloch & Pitts: Boolean circuit model of brain. - 1950: Turings Computing Machinery and Intelligence. - 1956: McCarthys name Artificial Intelligence adopted.
15
A Brief History of AI
A dose of reality (1966 - 1974):
- AI discovered computational complexity. - Neural network research almost disappeared after Minsky & Paperts book in 1969.
16
A Brief History of AI
AI becomes an industry (1980 - 1988):
- Expert systems industry booms. - 1981: Japans 10-year Fifth Generation project.
Task Domains of AI
Mundane Tasks:
Perception
Vision Speech
Natural Languages
Understanding Generation Translation
Formal Tasks
Common sense reasoning Robot Control Games : chess, checkers etc Mathematics: Geometry, logic,Proving properties of programs Engineering ( Design, Fault finding, Manufacturing planning) Scientific Analysis Medical Diagnosis Financial Analysis
18
Expert Tasks:
AI Technique
Intelligence requires Knowledge Knowledge posesses less desirable properties such as:
Voluminous Hard to characterize accurately Constantly changing Differs from data that can be used
AI technique is a method that exploits knowledge that should be represented in such a way that:
Knowledge captures generalization It can be understood by people who must provide it It can be easily modified to correct errors. It can be used in variety of situations
19
21
X o
22
2.
3.
Use the computed number as an index into Move-Table and access the vector stored there.
Set the new board to that vector.
23
3. Difficult to extend.
24
1 2 3 4 5 6 7 8 9
25
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)) .......
26
27
8 3 4 1 5 9 6 7 2
15 - (8 + 5)
28
2. Human finds the row-scan approach easier, while computer finds the number-counting approach more efficient.
29
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.
30
31
Coat Red
34
Exercises
1. Characterize the definitions of AI:
"The exciting new effort to make computers think ... machines with minds, in the full and literal senses" (Haugeland, 1985) "[The automation of] activities that we associate with human thinking, activities such as decision-making, problem solving, learning ..." (Bellman, 1978)
36
Exercises
"The study of mental faculties, through the use of computational models" (Charniak and McDermott, 1985) "The study of the computations that make it possible to perceive, reason, and act" (Winston, 1992) "The art of creating machines that perform functions that require intelligence when performed by people" (Kurzweil, 1990)
37
Exercises
"The study of how to make computers do things at which, at the moment, people are better" (Rich and Knight, 1991) "A field of study that seeks to explain and emulate intelligent behavior in terms of computationl processes" (Schalkoff, 1990) "The branch of computer science that is concerned with the automation of intelligent behaviour" (Luger and Stubblefield, 1993)
38
Exercises
"A collection of algorithms that are computationally tractable, adequate approximations of intractabiliy specified problems" (Partridge, 1991)
"The enterprise of constructing a physical symbol system that can reliably pass the Turing test" (Ginsberge, 1993) "The f ield of computer science that studies how machines can be made to act intelligently" (Jackson, 1986)
39