.

,
, .
, ,
, , LISP
.

1943-1956

Gestation of AI

1952-1969

Early Enthusiasm, great expectations

II

1966-1974

A dose of reality

III

1969-1979

Knowledge based systems

IV

1980-1988

AI becomes an industry

1986-1990

The return of neural networks

VI

1987-1995

Modern events

VII

1990-2000

Recent events

VIII

2000-

Present

IX

(1943-1956)
1956: John McCarthy ( )
Dartmouth-
. 20 AI
MIT, Stanford, IBM , .
McCarthy-
. Artificial Intelligence .
(1952-1969)
1958: John McCarthy (1958)
Dartmouth- MIT- AI- LISP
.
(1966-1974)
. (exponential, microworld )
(1969-1979)
1971: Minsky & Papert
Perceptrons (1969) .

.
(1980-1988)
1982: McDermott (1982)
R1 expert system (ES) . DEC
40
.
(1986-1990)

. (, ..)

 (1987-1995)

(Planning) . Microworld-
,
.
MIT (1989): Genghis () .

(1990-2000)
1997: Deep Blue vs Harry Kasparov (3.5 : 2.5)
1998: AI . (Remote
Agent, Deep Space 1)
(2000-Present)
200: Hal (computer baby) . -

. 2001 18 . Virtual
Reality . Turing- 15
. it
he ,
.
?

4 :

: Turing test
Turing- :

Natural language processing

Knowledge presentation
Automated reasoning
Machine learning

:
.
. ?!
.
:
- . :
. . IX-XX
.

 : Rational agent
.
Rationality < = > .
.
(Early Versions)
. :

.
(solution)
.
:
. expanding .


(strategy) .
:

Completeness / /: ?
Time complexity / /: ?
Space complexity / /:
?
Optimality / /:
?

.
1. UNINFORMED.
2. INFORMED.
UNINFORMED:
. Blind search .

Breadth-first search
Uniform-cost search
Depth-first search
Depth-limited search
Iterative deepening search
Bidirectional search

b /branching factor/: .
.

d /depth/: .
m /maximum/: /state space/ .

INFORMED:

Alpha, beta prunning search

:
1. . .
.
2. .
3.
. (hash table)

Rationality ( ):
4 Rationality . :
1. Performance Measure
2. (persept history, percept
sequence)
3. ?
4. ?

.
4 . :
1.
2.
3.
4.

/Simple reflex agents /

/Agents that keep track of the world/
/Goal-based agents/
/Utility-based agents/

Environment
/Environment/ ,
/percept/ , /action/
. 5 . / /
= + +
1.
2.
3.
4.
5.

ACCESSIBLE, INACCESSIB
DETERMINISTIC, NONDETERMINISTIC
EPISODIC, NONEPISODIC
STATIC, DYNAMIC
DESCRETE, CONTINOUS

SINGLE-STATE problem ( )
MULTIPLE-STATE problem ( )
CONTINGENCY problem ( )

EXPLORATION problem ( )

Problem //:
. 4 :
1.
2.
3.
4.

Initial state
Operator .
Goal test .
Path cost .

Total cost: = (path-cost) + (search-cost)

.
/ABSTRACTION/ .

. / /

() -
,
.
:
,
, ( ),

:

(percept - )

- () .
.
.
- :
- (TELL).
(SK) . (SK) - - ,
-
.

: |
: true | false | P | Q | R |
: ()
|
| ~

 : | | |
--- ~, , , ,

1. Modus ponens :

2. Modus tollens:

, ~ ~

3. :

1 2 n i

4. :

1, 2 , , n 1 2 n

5. :

6. :

, ~

7. :

~~

8. Resolution:

, ~
~ , ~

, ,
. () - .
, .
.
.
( )
: |
:

(,) | =
: (, )
|
|
: | 1 | | ...
: | | s | ...

( )
: ()
|
| ~
| ,
: | | |
: |
1.

x ~P ~ x P

2.

~x P x ~P

3.

x P ~x ~P

4.

x ~P ~x ~P



. ,
.
(domain)

1. ( )
2.

(Adjoin)

(Union)

(Intersection)
3.
4. .

(, ..)
( )

.
:




.
.. .

.
2 :
(restricted language)

STRIPS

(Planner) -

.

( ): Buy(x)

( ) : At(p), Sells(p,x)

(, ) : Have(x)

:

.
FOL
.

 ,
.
0 .
1 .
:
.


= + .