τν

:
Copyright , 2015
Creative Commons - 3.0.

9, 15780
www.kallipos.gr
ISBN: 978-960-603-031-4

......................................................................................................................... 4
- ................................................................................................. 10
............................................................................................................................................. 11
............................................................................................................................................ 12
................................................................................................................................................................... 12
....................................................................................................................................................................... 13
................................................................................................................................................ 15
................................................................................................................. 16
.............................................................................................................................................. 17
........................................................................................................................... 20
.......................................................................................................................................... 21
/ .................................................................................................................... 22
1 - ......................................................................................... 24
1.1 ........................................................................................................................... 24
1.1.1 .............................................................................................................................................. 24
1.1.2 ....................................................................................................... 25
1.1.3 ......................................................................................................................................... 26
1.1.4 ............................................................................................................................... 28
- ............................................................................................................................................... 28
............................................................................................................................ 34
1.1.5 ................................................................................................................................................ 34
1.2 ........................................................................................................................................................ 36
1.2.1 .............................................................................................................................................. 36
1.2.2 ........................................................................................................................ 39
1.3 ............................................................................................................................................. 41
1.3.1 .......................................................................................................................... 42
1.4 ...................................................................................................................................... 45
1.4.1. ............................................................................................................................... 45
1.4.2 ......................................................................................................................... 48
1.4.3 ..................................................................................... 51
1.4.4 ....................................................................................................... 52
1.5 ................................................................................................................................. 53
1.5.1 ......................................................................................................................................... 54
1.5.2 - .......................................................................................................................... 55
1.5.3. ...................................................................................................................... 57
1.5.4 ............................................................................................ 60
1.5.5 ............................................................................................................................ 61
1.5.6 - ..................................................................................................................... 63
/ .................................................................................................................... 66
....................................................................................................................... 67
2 - ........................................................................................ 69
2.1 ........................................................................................................................................................................... 69
2.1.1 .......................................................................................................................................................... 72
2.2 .............................................................................................................................................. 74
2.2.1 .................................................................................. 74
2.2.2 ...................................................................................................................... 75
2.2.3 ..................................................................................................................... 76
............................................................................................................................................... 76
....................................................................................................................................... 77
............................................................................................................ 78
2.2.4 .................................................................................................... 80
............................................................................................................................................... 80
................................................................................................. 85
....................................................................................................................................................................... 88
........................................................................................................................................................................ 88
......................................................................................................................................................................... 92
........................................................................................................................................................................ 94
................................................................................................................................................................... 96
/ .................................................................................................................... 99
..................................................................................................................... 100
3 - ........................................................................................... 102
3.1 ............................................................................................................................................................. 102
3.1.1 .............................................................................................................................................................. 102
3.1.2 .............................................................................................................................................................. 103
3.1.3 ............................................................................................................................................................ 104
3.2 ................................................................................................................................................ 105
3.2.1 ............................................................................................................................................ 105
3.2.2 .................................................................................................................... 107
3.3 ................................................................................................................. 108
3.4 ............................................................................................................................................ 110
3.4.1 ............................................................................................................................................ 111
3.4.2 ...................................................................................................................................................... 112
5
3.4.3 ................................................................................................ 113

3.4.4 ................................................................................................... 119
3.4.5 (General Problem Solver) ...................................................................... 123
/ .................................................................................................................. 124
..................................................................................................................... 125
4 .............................................................................................. 127
4.1 ................................................................................................................................................................... 127
4.2 ...................................................................................................................................... 128
4.3 ............................................................................................... 130
4.3.1 ............................................................................................................................................... 131
................................................................................................................................ 134
ID3 ...................................................................................................................................................... 135
........................................................................................................................................ 136
ID3 ........................................................................................................................................................ 139
.......................... 139
ID3 ....................................................................................................................... 143
........................................................................................................................... 147
......................................................................................................... 148
4.4 ......................................................................................... 149
4.4.1 /CBR ........................................................................................................................ 150
4.4.2 /CBR........................................................................................................................................... 150
4.4.3 /CBR ...................................................................................................................... 152
4.4.4 - ..................................................................................................................... 153
4.4.5 .................................................................................................................... 154
4.5 .................................................................................................................................................... 155
4.5.1 ................................................................................................................................................................... 155
4.5.2 ............................................... 157
4.5.3 ............................................................................................................................................. 159
4.5.4 ............................................................................................................................................ 159
..................................................................................................................................................... 161
........................................................................................................................................... 161
4.5.5 .......................................................................................................................... 163
Perceptrons ................................................................................................................................................................ 163
xor ........................................................................................ 164
....................................................................................................................................... 165
4.5.6 ................................................................................................................................................. 166
Perceptron ............................................................................................................................................ 167
.................................................................................................................................................. 168
6
................................................................................................................................................................... 169
................................................................................ 169
..................................................................................................................................................... 170
Kohonen ............................................................................................ 171
Kohonen .......................................................................................................... 172
- Hopfield ......................................................................................................... 174
4.5.7 .............................................................................................................................................. 175
4.5.8 ...................................................................................................................... 176
4.5.9 .................................................................................................................................................. 177
4.6 ............................................................................................................................................... 178
4.6.1 : ................................................................................................................ 178
4.6.2 ................................................................................................................................................. 179
4.6.3 .................................................................................................................. 180
4.6.4 .......................................................................................................... 181
4.6.5 ..................................................................................................................................................... 182
4.6.6 ....................................................................................................................... 183
4.6.7 ............................................................................................................................................... 184
4.6.8 ...................................................................................................................................................... 185
.......................................................................................................................................................... 185
4.6.9 .............................................................................................................................................. 189
4.6.10 ..................................................................................................................................................... 190
..................................................................................................................................... 190
........................................................................................................................ 191
...................................................................................................................................... 191
4.6.11 (Mutation) ..................................................................................................................................... 192
4.6.12 ........................................................................................................................... 194
4.6.13 ................................................................................................................................... 195
4.6.14 ............................................................................................................................................... 195
4.6.15 ............................................................................................................................ 196
4.6.16 ................................................................................................................. 196
/ .................................................................................................................. 197
..................................................................................................................... 198
5 - ........................................................................................... 200
5.1 ......................................................................................................................................................................... 200
5.2 ................................................................................................................ 201
5.3 ......................................................................................................................................... 202
5.4 ..................................................................................................................................................... 204
5.5 .................................................................................................................................................... 205
7
5.5.1 ......................................................................................................................................... 205

5.6 .............................................................................................................................................................. 206
5.6.1 ................................................................................................................................... 207
5.7 ..................................................................................................................................................................... 209
5.7.1 .................................................................................................................................................. 211
5.8 ....................................... 214
/ .................................................................................................................. 215
..................................................................................................................... 215
6 - .......................................................................................... 217
6.1 ................................................................................................................................................................ 217
6.2 .................................................................................................................................................. 218
6.3 ....................................................................................................................... 220
6.4 ........................................................................................................................................... 221
6.4.1 ...................................................................................................................................... 223
6.5 .......................................................................................................................... 223
6.6 ....................................................................................................................................... 224
6.7 ............................................................................................................... 225
6.7.1 .................................................................................................................................. 226
6.7.2 ............................................................................................................. 227
.............................................................................................................................................. 228
.............................................................................................. 229
........................................................................................................................................ 231
6.7.3 ......................................................................................................................................... 232
6.7.4 ............................................................................................................................................. 233
6.8 .................................................................................................................................. 233
6.8.1 ........................................................................................... 234
6.8.2 & .................................................................................................... 234
6.8.3 ................................................................................... 235
6.8.4 ........................................................................................................................ 237
6.8.5 .............................................................................................................................. 237
6.8.6 ............................................................................................................................. 238
6.8.7 ........................................................................................................................................ 238
6.9 ............................................................................................................................................. 239
/ .................................................................................................................. 239
..................................................................................................................... 240
7 - ............................................. 242
7.1 ................................................................................................................................................................... 242
7.2 ..................................................................................................... 242
8
7.3 .................................................................................................................................................. 243

7.4 ..................................................................... 246
7.4.1 ................................................................................................................................................................... 246
7.5 ................................................................................................................................................ 247
7.6 ............................................................................................................................................................... 247
7.6.1 ................................................................................................................ 248
7.6.2 ............................................................................................................................................. 249
7.6.3 ................................................................................................................................... 250
7.7 ..................................................................................................... 252
7.7.1 ....................................................................................................... 252
7.7.2 ............................................................................................................... 253
7.8 .......................................................................................................................................... 253
7.8.1 ......................................................................................................... 253
7.9 ........................................................................................................................................ 254
7.10 ............................................................................................................................... 255
7.11 ............................................................................................................................................... 255
7.12 ........................................................................................... 256
/ .................................................................................................................. 256
..................................................................................................................... 257
.............................................................................................................................. 259
ARTIFICIAL INTELLIGENCE
AmI
AMBIENT INTELLIGENCE
ANN
ARTIFICIAL NEURAL NETWORKS
BB
BRANCH AND BOUND SEARCH
BDI
AGENTS WITH BELIEFS-DESIRES-INTENTIONS
BestFS
BEST FIRST SEARCH
BFS
BREADTH FIRST SEARCH
CBR
CASE-BASED REASONING
CI
COMPUTATIONAL INTELLIGENCE
DFS
DEPTH FIRST SEARCH
DGG
DEFINITE CLAUSE GRAMMARS
EHC
EINFORCED HILL CLIMBING
ES
EXPERT SYSTEMS
FIPA
FOUNDATION FOR INTELLIGENT PFYSICAL AGENTS
GA
GENITIC ALGORITHMS
GPS
GENERAL PROBLEM SOLVER
HC
HILL CLIMBING SEARCH
IDS
ITERATIVE DEEPENING SEARCH
KBS
KNOWLEDGE BASED SYSTEMS
NLP
NATURAL LANGUAGE PROCESSING
NLU
NATURAL LANGUAGE UNDERSTANDING
RBS
RULE-BASED SYSTEMS-
&
BASIC BRANCH AND BOUND SEARCH
--
10

-
1950. ,
,

,
, , . , ,
, ..
, ..
, ,

. , ,
... , .
. ,
,
.
, .
,
.
.
.
,
. ,
.
,
. ,
-
, .
. ,
,
, ,
, ,
, . ,
.

. , ,
, , .
, , ,
.
.
, 2015
11

- (Artificial Intelligence - AI)
Dartmouth College 1956, ,

(McCarthy, Allen Newell, Herbert Simon Marvin Minsky),
1950,
(1912-1954), :
;. , , ,
,
(15961650) ,

. , 60
(.. 2001: ).

(Turing test).
, .
,
,
.
1 1
,
. 1950, Computing Machinery and Intelligence2
2000 ,
, , ,
, , 30%.
1
2
Turing, Father of the Modern Computer, http://www.rutherfordjournal.org/article040101.html

http://loebner.net/Prizef/TuringArticle.html
12
,

, .
,
Loebner Prize in Artificial Intelligence3.
, ,
, ,
. ( )
,
(machine vision) (robotics).
2 chatbot Eugene Goostman 2014 - http://www.zdnet.com/article/computerchatbot-eugene-goostman-passes-the-turing-test/
2014, , Eugene Goostman,

, 2014
Royal Society 4, 33%
(Schofield, 2014 ).

;
, , , ,
.. ,
.
Patrick Winston (1992), ,

, , .
.

, .
, , ,
, :

,
(, , ,
, .).
3
4
http://www.loebner.net/Prizef/loebner-prize.html
http://www.zdnet.com/article/computer-chatbot-eugene-goostman-passes-the-turing-test/
13
:

(Rich & Knight,
1990).

:
;
, ,
.
()
, .
, (.. ),
, .
,
. ,
, ,
.
,
.

(symbolic Artificial Intelligence):

.
TN
(, , ), ,
( , .).
.
,
,
, , ,
.
1
(Cognitive Science),
, .
,
, !
14
,

. , ,
.
, :

, , ,
.

() ,
. - (Computational Intelligence-CI),
TN ,
. :

, , ,
. .
J. Bezdek (1992)
International Journal of Approximate Reasoning. ,
Bezdek ABCs :
A = Artificial
Non - Biological (Man-Made)
B = Biological
Physical + Chemical + (??) = Organic
C = Computational Mathematics + Man-Made Machines
R. Marks (1993) :
15
,
,
.
,
, :
(adaptation),
- (self-organization),
- (learning-evolution).
.
(pattern recognition).
():
(artificial neural networks),

(expert systems),
(artificial life),
(genetic algorithms),
(fuzzy logic).

(384-322 ..),

( ). , 1854,
George Boole , 1879, Gottlob Frege

(predicate calculus).
:
1943-56
1943
McCulloch Pitts
.
1950
Alan Turing, , ( )
.
1951
Minsky Edmonts , SNARC (Stochastic Neural
Analog Reinforcement Calculator), 40 3000 .
1956-70 .
1956 Dartmouth College ,
(McCarthy, Allen Newell, Herbert Simon, Marvin Minsky)

.
1958
Lisp McCarthy.
1966
, Weizenbaum
ELIZA.
1970-80 .
1977
: DENDRAL (1971), MYCIN (1975), Prospector
(1977).
16
. Colmerauer Roussel R.
Kowalski
PROLOG.
. Winograd .
1975 &1977 M. Minsky .
1976
Newell & Simon
.
1970 - .
:
1973
Rechenberg
.
1975
Holland .
1992
Koza, (Genetic Programming).
1995
Fogel (Evolutionary Computation).
1980-90 .
1986 Rumelhart and McClelland
.
1987
1 IEEE (Institute of Electrical and Electronics
Engineers).
1960 - : .
1965 &1968 Zadeh (Fuzzy Sets, 1965)
(Fuzzy Algorithms, 1968).
1983
Sugeno .
1992
1 .
1990 -
(.. )
: ,
, .
1972

,
, ,
.
.
17
18
,
, ,
, ,
. (intelligent agents),
(intelligent search machines), (data mining
systems), (recommender systems)
(ambient intelligence systems).
19
,
, .

,
, ,
,
(Ambient Intelligence-Aml)
(intelligent intuitive interfaces),
.
4 5

,
. ,
(Ducatel
.. , 2001). , :
5
Disappearing Computer e-gadgets

20
: , , ,
, /, (pervasive-ubiquitous
computing).
: , , , ,
, , ,
..
5 Aml6

,
.
,
, ,
, ,
.
,
, , .
6
www.seminarsonly.com
21
,
,
.
.
/
Bezdek, J. C. (1992). On the Relationship between Neural Networks, Pattern Recognition and Intelligence.
Int. J. Approximate Reasoning, 6(2), 85-107.
Boole, G. (1854). An Investigation of the Laws of Thought on which are founded the mathematical theories of
logic and probabilities. : Walton & Maberly. http://historycomputer.com/Library/Boole.pdf
Colmerauer, A. , & Roussel, P. (1996). The birth of Prolog. T.J.Bergin & R.G.Gibson (.) History of
programming languages-II (.331-367). : ACM Press.
Ducatel, K., Bogdanowicz, M.,Scapolo, F.,Leijten, J. & Burgelman, J-C. (2001) . Scenarios for Ambient
Intelligence in 2010. ftp://ftp.cordis.europa.eu/pub/ist/docs/istagscenarios2010.pdf.
Fogel, D. B. (1995). Evolutionary Computation: Toward a New Philosophy of Machine Intelligence.
Piscataway, : IEEE Press.
Frege,G. (1879). Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens.
Hallea. S.: Louis Nebert.
Hodges, A. (1995). Alan Turing: a short biography.
http://www.turing.org.uk/publications/dnb.html
Holland, J.H. (1975/1992). Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan
Press /, :MIT Press.
Kohonen, T. (1982). Self-organized formation of topologically correct feature maps. Biological Cybernetics,
43, 59-69.
Koza, J. R. (1992a). Genetic Programming: On the Programming of Computers by Means of Natural
Selection. , M: MIT Press.
Marks, R. (1993). Intelligence: Computational versus Artificial. IEEE Transactions on Neural Networks, 4(5),
737-739. McCarthy, J. (1960). Recursive Functions of Symbolic Expressions and Their Computation
by Machine (Part I). Communications of the ACM, 3(4),184-195. http://wwwformal.stanford.edu/jmc/recursive.pdf
McCulloch, W.S., & Pitts,W.H.(1943). A logical calculus of the ideas immanent in nervous activity. Bulletin
of Mathematical Biophysics, 5, 115-133.
http://www.minicomplexity.org/pubs/1943-mcculloch-pitts-bmb.pdf
Minsky, M. (1975). A Framework for Representing Knowledge. P.H.Winston (.), The Psychology of
Computer Vision . : McGraw-Hill.
Minsky, M. (1977). Frame theory. P.N. Johnson-Laird & P.C.Wason (.), Thinking: Reasings in
Cognitive Science ( 355-376). : Cambridge University Press.
Newell, A., & Simon, H.A.(1976). Computer science as empirical inquiry: symbols and search.
Communications of the ACM,19 (3), 113-126.
22
Rechenberg, I.(1973). Evolutionsstrategie: Optimierung technischer Systeme und Prinzipien der biologischen
Evolution. : Frommann-Holzboog.
Rich, E., & Knight, K. (1990). Artificial Intelligence (2 ). McGraw-Hill Higher Education.
Rich, E. Knight, K. & Nair, S.B. (2009). Artificial Intelligence (3 ). :Tata McGraw-Hill
Higher Education.
Rumelhart, D. E., & McClelland, J. L. (1986). Parallel Distributed Processing: Explorations in the
Microstructure of Cognition (2 ). , : MIT Press.
Schofield, J. (2014). Computer chatbot 'Eugene Goostman' passes the Turing test.
http://www.zdnet.com/article/computer-chatbot-eugene-goostman-passes-the-turing-test/
Sugeno, M. (1983). Fuzzy theory IV ( ), J. SICE 22, 554-559.
Turing, A. (1950). Computing Machinery and Intelligence, Mind, 59, 433-460.
http://www.loebner.net/Prizef/TuringArticle.html
Winston, P. H. (1992). rtificial Intelligence ( 3 ). Reading, : Addison-Wesley.
http://courses.csail.mit.edu/6.034f/ai3/rest.pdf
Zadeh, L.A. (1965). Fuzzy sets, Information and Control, 8 (3), 338353.
Zadeh, L.A. (1968). Fuzzy Algorithms, Information and Control, 12, 99-102.
23
1 -

,
.
,
. , ,

.

.
1.1
,

.
(search)
. (search algorithm)
.
,
, .

.
, , ,
,
.
1.1.1
,
(:
)
(:

- ).
,
( ).

.
( ,
) (
, ,
,
, ).
:
24
1.
: ..
.
2.
: ..
.
3.
: ..
, .
4.
: .. .

. (problem goal)

.
.
,
, ( 1.8)
, .

.
, ,
.
1.1.2
,

,
, .
(problem state)
(state space)
,
.
.

,
.
.
(.. ) (.. ). ,

( ).
= () ( )
,

.
(game playing)
, ,
(, , .) 1
25
, 2 . -
, ( )
, ,
. , ,

. ,
. ,
, , , ,
, .
, ,
.
,
.

, ,
. ,
, , .
(problem formulation)
.
,
.
1.1.3
, .
(problem world)
, .
, 6 ,
1.1, 6 , ,

, , .
26
1.1 6
(closed world), ,
,
(open world),
,
, .
4
:
(start state input state), .

(goal),
.
- (goal state) .
.
(successor function)
, ,
x ,
(, ),
x (successor)
x
. (transition operators)
.
(state space)
.
27
(
1.3).
( 1.1).
, () P=(I,G,T,S), :
: ,
G: ,
T: ,
S: .
,
(function of path cost),
1.1.2.
,
, 3 , , 8 , 2
.. ,
,
( 2).
1.1.4

, -
.
-
3 .
3 :
. ,
. , .
1.2 3
: . , 13
(6 , 6
2 1
).
: .
: :
(move-to-cube)
28

(move-to-table). 1.3.
: .
3 , ,
:
1.1 3
:
Move-to-cube: x y.
: x & y .
: x y, y
.
Move-to-table: x .
: x
y.
: x , y
.
29
1.3 3
1.3 3 ,
move-to-cube move-to-table.
- .
: (farmer)
(goose), (seeds) (wolf)
. 3
, . ,
- -,
.
1.1
30
:
1.4.
: .
:
4: (f), (g), (w),
(s). ,
( 1.2).
: .
,
:
1.2
:
f: x y.
: x. x
/ .
: y.
g: x y.
: x.
: y. .
w: x y.
: x. x
.
: y. .
s: x y.
: x. x
.
: y. .
31
1.4
, - 8 (8 Puzzles), 2 , 8
, ..
8 (8 Puzzles): 3x3 8 ,
1 8, .
, .
. N .
1.5 8
2 : , 4
3 ,
. 2 .
32
,
, ,
.
1.6 2
8 : 8
, 8 ,
, , .
, ,
, .
1.7 8
:
.
.
, ,
.
.
33
1.8
:
. .
.
.
1.9

.
,
(travelling salesperson problem-TSP),
( 1.1). ,
, , .
1.1.5
, P=(I,G,T,S), t1, t1, t2, , tn,
:
G= tn((t2(t1(I)))..)
: :
34
(input)= ---
G (goal)=---
(transitions)={
F(armer):
.
W(olf):

.
G(oose):
.
S(eeds):
.
}
S 1.4, ,
:
:

,
.
(partial solution)
,
:
G F S
G F S G
G F S G W

. P = (I, G, T, S), (search space)
K. i
,
K i.
,
,
. ,
, ,
, ,
1.10 (
,
).
35
1.10
1.2
,
, (search algorithm).
,
,
.
.
.
.
.
,
.
1.2.1

(search tree). ,

. ,
, (search
path).
(search queue
fringe).
.
,

.
, .
, ,
, , .
, ,
, .
36
,
-.
, 10
.
. ,
.
1.11 ,
10
:
=
G=
={
x y
}
S= 1.11
1.11

.
, -
-. ,
, , -- 12,73 .
( 1.12).
37
1.12
(exhaustive search),
,
( ),
( 1.13).
38
1.13
1.2.2

. .
(parent node).
(successor nodes).
, ,

.

. , , (path
cost). (path depth).
, 1.14 12,73 4.
39
1.14 4 12,73
(fringe front)
, ,
.
, (
) ,
1.15 . , , .

(closed set). 1.15, , ,
, , , .
1.15
40

1.16:
1.16
1.3

.
.
:
(),
(V),
(F),
(GS).
, Ps (problem solution)
:
= (, , , )
,
. (complete),
. (incomplete).
41
,
,
( ),
,
,
.
, :
( )
( )
, .
. (
) , , ,
() .
1.3.1

:
.
, .
, , ,
1 .

.
,
, , , .
,
( ) , , ,
. , ,
. ,
, .
,

10 ( 1.11).
:
: <>
: ()
: <()>
: {}
1 :
: <, , >
: <( ), ( ), ( )>
42
: {}
`<` `>` ,
`(` `)` ,
.
2 ,
.
,
:
2 :
: <, , >
: <( ), ( ), ( )>
: {, }
1.17 .
1.17 2
1.1 -

-. ,
,
.
:

1.
2.
3.
4.
.
,
, , .
,
, TEO.

, 2.
43
5.
6.
7.
8.
9.

,
.
,
, .
,

.
.
2.
, 5
, 6 7 .

, .
popup 1.1 -
,

, :
1. .

.
2. ,
, , .
3. ,
, TEO.
4.
, 2.
5.
, -
.
.
6. ,
-, .
,
-,
.
7. ,

.
8. - .
9. 2.

.
44
popup 1.2 -
:
.
. ,
.
,
.
1.4
(blind search methods)

,
.
, , .
( )
.
:
,
,
,
.
1.4.1.
,
(Depth-First Search - DFS)
, .
, .
,
,
, .
1.18 ,
,
.
.
45
1.18 DFS

1.2 - DFS

:
1.
2.
3.
4.
5.
6.
7.
8.
.
,
, , .
,
, TEO.

, 2.

,
.
,
, .
.
2.
1.3
DFS .
46
1.3 DFS
DFS 7,
-.
() , 4,
(chronological backtracking).
DFS .
.
.
,

, -
.
.
,
,
-, .
,
-,
.

,
.
1.3 - DFS

1.4
DFS .
47
1.4 DFS
DFS
.
DFS , ,
.
DFS
.
.
DFS , .
1.4.2
(Breadth-First Search - BFS)
. ,
. , .
,
,
, .
1.19 ,
-
, .
.
48
1.19

BFS :
1.
2.
3.
4.
5.
6.
7.
8.
.
,
, , .
,
, TEO.

, 2.

,
.
,
, .
.
2.
1.4 - BFS

1.5 BFS
.
49
1.5 FS
BFS .
.
.
,

, -
.
.
,
, -,
. ,
-,
.

,
.
1.5 - FS

1.6 BFS
.
1.6 BFS
50
FS
, ,
.
( ).
.
BFS
. ,
,
.
2 , DFS BFS,
. , BFS,
. , DFS ,
.
1.4.3
(Iterative Deepening Search - IDS)
DFS,
, .
. ,
, 1 0, .. 0, 1, 2, .
:
1.
2.
3.
4.
5.
( 0).
DFS .
, .
( 1).
2.
1.20,
3 .
1 : 0 - .
2 : 1,
,,,.
3 : 2 ,
, , E , . .
51
1.20
n=2
1.6 - IDS
8 n=2
IDS
.
1 IDS ,
.
DFS BFS
.
.
IDS:
1.4.4
(idirectional Search)
. ,

(reversible) . ,
.

.
, .
1.21
, F,
- K F, A, C, F, J, K.
52
1.21
,
, :
;
, ;

;
;
;
DFS BFS
,
, .

.
1.5

, .
,
.
(heuristic) ,
.
. ,
, , ,
- .
(heuristic search)
.
.
,
, .
.
, .

:
Best-First,
53
Hill-Climbing,
Beam Search,
Basic ranch & ound Search,
- - *.
, 2 :
-,
-.
1.5.1
(heuristic function) .
.

.
(heuristic value)
.
-, -

-.
:
,
, ,
.
Manhattan
, 1.22.
1.22 Manhattan
, 8

Manhattan
.
54
1.23 Manhattan 8
1.23, 3, 8 1
. Manhattan
2, 3, 3 , 0.
, Si S ,
8, Manhattan.
3
Manhattan Distance S:
() = | | + | | = 2 + 3 + 3 = 8
8
. S 1.23,
3 , 3, 8 1, 3: () = 3.
1.5.2 -
- (Best First Search - BestFS)

.

.
BestFS
.
.
,
55

, -
.
.
,
,
-. ,
-.

.

,
.
1.24 BestFS
6 ( 1.1), ,
F .
F.
,
. , F ,
, ,
. , C,
.
. .
C, F.
, C D.
C, (A C), C, (A B C), D. D
C , , .
,
(A B D F).
56
1.24 BestFS ,
1.1
1.7 - BestFS

1.8 - BestFS 8
BestFS
.
.
.
BestFS
,
, .
,
,
.
1.5.3.
(Hill-Climbing - HC)
BestFS .
(steepest ascent),
.
:
.
,

( )
, ,
.
,
.
,
. -
, .

...
,

.
57
.

.
...
1.25 6
( 1.1), , ,
Manhattan .
Manhattan .
1.25 ,
1.1
1.9 - HC

(greedy local search),
, .
, , ,
. ,
:
(local maxima),
(plateau),
(ridges).
, ,
,
. , ,
( 1.26).
58
1.26
: ,

. .

, .
:
. ,
.
,
.
: (
), , ,
( ).

.
, ,
:
,
,
,
,
.

, ,
. (Enforced Hill
Climbing EHC). EHC . EHC
,
59
. 1.27 1.25,

, ,
.
1.27 EHC
(Simulated Annealing Algorithm)

,
.
(Taboo Search Algorithm),
, ,

( , ).
1.5.4
(Basic Branch & Bound search - &)
.
.
B&B

-,
, -.
60

-
.

1.28 B&B
10 .
. - ,
, --- 12,73, A-E-
5,24.
1.28 &B
1.5.5
(eam search)
-.

- ,
,
, .
.
61
.
.
.
.
...
-
,
,
.
.

.

...
1.29,
10 ,
. 2 0
.
1
.
2 ,
, .
3 , , ,
.
4 , , H,
.
5 H , ,
. ,
, .
62
1.29

1.5.6 -
- (*) BestFS, :
() = () + ()
() ,
,
()
, BestFS.
* , ()
, * .
63
1.30 * IS FS,
S
...
,

.
,
( )
( )
-.

...
, 8 * :
() = () + ()
:
64
g(S) = S
() = S,
S 4 :
, S ( 0),
:
(_) = 0 + 4 = 4
* 1.31
-.
65
1.31 * 8
1.10 - * 8puzzles
/
Russell, S. J. & Norvig, P. (2007). : . :.
, ., , ., , ., , ., , . & , . (2011).
(3 ). : .
66

1
:
1.
2.
3.
A.
.
B.
.
C.
.
/
: 1C, 2B, 3A
2
( ):
. - ,
.
-
. ,
-,
. ,
-
/
C.
3
,
, ;
.
.
C.
D.
/
D.
4
():
67
. ()
. ()
C. (G)
D. ()
E. (S)
F. (S)
/
, C, D, F.
68
2 -
, ,
,
, , ,
.
,
, , , .
, .

.
2.1
,
. 1,
. , , , ,
,
.
,
:
E (intelligence) , ,
.
, ,
,
. ,
, .
,
,
. ,
,
:
69
2.1
, moai ,
, ,
.
2.2
,
, glass
, , , .
, ,
, .

, .. sun glasses.
70
2.3 glass
, ,
, ,
. ,
:
, .

.
, (representation)

,
.
, ,

.
, , ,
.
( 2.1).
(data) .
(information) .
.
(knowledge) .
(wisdom) , -,
.
71
2.1
2.1.1
:
(declarative knowledge)
(objects-data), (facts) (events),
(procedural knowledge)
,
, .
, .
, .
, /.
(semantic knowledge),
() ,
(episodical knowledge),

.
72
2.2
,
,
,
.
,
11 2001,
.
, , (general knowledge, common

sense) (domain-specific knowledge) . ..

8
,
.
:
:
.
, .
:
- .
.
:
:
, .
.
:
, .
escape, .
73
2.2
. , ,
,
,
,
.
, ,

.
(knowledge representation)

:
.
(
- ).
2.4 - http://aitopics.org/
2.4, ,
, ,
, (10/12, not the but later) )
. ,
, ,
,
. ,
, ,
.
2.2.1
74
,
.
, ,
!
,

o , ,
o ,
o ,
o .
.
.
2.2.2
,
, , ,
( ), , , ,
( ).
:

o ,
o ,
o .

o ,
o ,
o ,
o .

, 2.3.
75
2.3

. ,
,
.
2.2.3
,

:
,
,
.

(propositional calculus)
(declarative sentences) (true) (false), .
:
.
.
.
(truth value)
.
(compound
propositions), 5 (logical connectives):
( not ):
( and ):
( or ):
76
... ( if ... then ):

( if and only if ):
:
. ()
, . ()
... .
(... P, Q, R) (atoms)

, ..:
P: .
Q: .
R: .
(well-formed formulas)
:
P Q ( , . )
P Q R ( (P) (Q), (R).)

:
2.1

(predicate calculus) , ,
.

.
:
(symbols) (constants)
(objects) : .. Maria.
(functional symbols)
,
77
, .. father_of(MARIA),
date(10,June,1999).
(predicates),
.
.. on ,
,
n(,).
,
, .. on(x, ) x
.
father , , ..
father(Maria, Jim), father(Maria, x)
father(George, x) Ann George ,
.
(well-formed formulas).
, ,

(logical connectives): (), ( ), ( ), (),
(), (), ( ).
..
:
x: on(x, table) red(x)
:
x: mushroom(x) (purple(x) poisonous())
:
x: (mushroom(x) purple(x)) poisonous(x)

. ,
(first-order predicate calculus).
.
, x y
x y .
PROLOG ,
:
,,W: father (X,W) father (Z,W) brothers (X,W):
father(john, peter)
father(mary, peter)
father(ann, takis)
? brothers(john, mary)
yes
? brothers(mary, ann)
no
78
,
,
.

, ,
. ,
, , , .
PROLOG .
PROLOG:
6 , (g), (b) 2 (w),
, :
2.4 6
, PROLOG,
:
6 :
isabove(g, b1)
isabove(b1, w1)
isabove(w2, b2)
isabove(b2, b3)
6 :
color(g, gray)
color(b1, blue)
color(b2, blue)
color(b3, blue)
color(w1, white)
color(w2, white)

:
79
isabove(X, Z) if isabove(X, Y) and isabove(Y, Z)

:
?isabove(b2, w1)
no
?color(w1, )
X=white
?color(X, blue)
X=b1, X=b2, =b3
, b1, b2, b3
.
2.2.4

. ,
,
.
, ,
.
:

o "-" (has-part aggregation),
o "" (is-a specialization),
o .
, ,
o (inheritance),
o .

Collins & Quillian (1969, 1970)
.
(semantic networks)
(.. , ).
,
, , .
.
, .
, .
- -.
.
80

,
: :
/ ,
,
, .
(concepts), ( ) ,
(events), ,
(characteristics), ,
(values), .
(branches).
, - - (parent node)
- (child node).
- (root node).
(leaves).
,
(ascendant) (descendant).
-
-.
-
:
a_kind_of ( AKO)
AKO
. AKO
.
is_a ( ISA)
ISA AKO,
, ,
,

.
instance_of ( INSTANCE_OF)
instance_of
.
( 2.5) (
2.6).
(hierarchical semantic networks)
.
81
2.5
2.5,
(.. , , ).
.
, , , , , ,
.

,
, ,
, . .
ISA is_a , -
, , ,
,

.
82
2.6
(non-hierarchical neural network)

,
.
2.6 ,

.
/ (
-.) ( -.).
-., ISA
/
.
/,
:
.
, .
,
(null pointer NIL).

2.5:
( ( ())
( ( ) ( ) ( ) ( )
( ))
( ( ) ( ) ( ) ( )
( )
( ( ) ( ))
( ( ) )
( ( ) ( ) ( ) )
( ( ) ( ) )
83
)
2.7 ,
,
PROLOG LISP.
2.7
2.5
Lisp.
(defun *mammal* ()
'((dog (kind_of mammal)
(tail YES)
(feet YES)
(intelligence YES)
(boss YES))
(cat ((kind_of mammal)
(tail YES)
(feet YES)
(moustaches YES)
(boss YES))
(terrier
(is-a dog)
(tail short))
(canis
(is-a dog))
(Rits
(instance canis)
(tail no)
(boss Costas))
(Rallou
(instance cat)
(boss Maria))))
Lisp assoc
.
84
,
,
.
,
, .

. . ,
,
.
o ,
. ,

.
- (concept map) (
, ) , .
2.8
()
,
.
85
2.9
, (mind map)
. ,
(spider diagram - ree like diagram)
.

.
2.10
J. D. Novak (Novak & Gowin, 1984,

Novak, 1991) D. Ausubel (1968). ,
.
86
, (knowledge models),
.
2.11 7
:
.
().
.
(),
( ).
5. .
1.
2.
3.
4.
,
,
Caas
Novak (2006).
87
o ,
o ,
o ,
o .
, :
,
,
,
,
:
o ,
o ,
o ,
o ,
o ,
o .
(schema)
, , ,
.

,
.

E. Kant (1724-1804), J. Piaget (1896-1980)
1970 1980 ( Rumelhart & Ortony
1977, Rumelhart, 1980), (..
, , ) () ,
.
R.
Schank R.P. Abelson (1977), D.E. Rumelhart (1975). Marvin Minsky
(1975)
, .
(frames) :
(class): (..
)
(instance frames): (..
MyCourse).
,
(record) .
88
2.2
(slots) .
:
, , , , , ,
, , ,
,
(..
daemons),
, .
,
:
: ()
1: (default yes)
2: (default yes)
3: (default no)
: ()
:
:
:
: GOLDEN ()
EINAI:
:
:
: yes
,
,
a_kind-of ,
,
EINAI is_a ISA
.
89

.
.

.
. ,
2.5 (
) :
:
1:
2: 1
:
:
:
: NAI
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:
:

.
(default) . ,,
4,
, 2
0.
.
,
:
90

.
.
.
, ,
.

, .
, :
, - ,
, -,

.

1
.
PROLOG:
fruit,
apple golden.
:
frame(fruit, [[edible, [default, yes]],
[nutrition, [default,yes]],
[digestable, [default,yes]],
[essential, [value, yes]]])
: fruit [edible,[default,yes]], [nutrition,[default.yes]],
[digestible,[default,yes]], [essential,[value,yes]], food
(.. edible) (default)
(value).
, Prolog ,
:
frame(apple,[[link,[value,fruit]]])
Common LISP:
, , :
(define-frame fruit
(edible
:default-values
(nutrition
:default-values
(essential
:default-values
(digestible
:default-values
(define-frame apple(:is fruit)
(season winter)
91
(
(
(
(
yes))
yes))
yes))
yes)))
(taste tasteful))
(define-instance GOLDEN
(color yellow)
(smell nice)
(season automn))
(:is apple)
LISP:
fruit food:
(defclass food () (.))
(defclass fruit (food)
((color :initarg :color)
(price :initarg :price)))
(defclass apple (fruit) ()
(:default-initargs :color 'red))
(:default-initargs :price 2))
(make-instance 'apple :digestable no)
:
.
.
:
o

o ,
(defaults) (exceptions).

.
(
slots)

.
(scripts) R. Schank (1975)

(script theory)
. Schank , ,
.

.
,
. Schank (1991)
. ,

:
92
, ,
,
, ,
, ,
, (.. )
,

.
.
.
: (: )
,
. , , ,
.
, :
:
: ,
:

:

/
()
:
PTRANS:
ATTENDS:
MBUILD:
TRANS:
ATRANS:
INGEST:
COMPUTE:
1:
PTRANS
ATTENDS
93
MBUILD
PTRANS
2:
( )
TRANS ( )
MBUILD
TRANS
PTRANS
TRANS
PTRANS
TRANS
( )
3:
TRANS
TRANS
INGEST
(: 2 4)
4:
COMPUTE ( )
PTRANS
ATRANS
ATRANS
PTRANS
ATRANS
PTRANS
(rules)
-.
.
.
, :

. , , ,
, ,
. :
/IF-/THEN :
IF A
premises ()
and antecedents (,)
and ... preconditions ()
THEN X
conclusions ()
and Y consequents ()
94
and ...
actions ()
(deductive rules): IF
, .
(productive rules): IF
.
(active rules): IF
THEN,
.
2.3
:

:

:

(rule-based systems)
, :
95
, , ,
,
, .

.
,
. .

. ,
.
(ontology)
. ,
,
.
(Semantic Web)
(World Wide Web - WWW),

- / ,

. ,
:
,
/,
,
,
.
:
,
(Gruber, 2009)
,
.

, .. -- , , , , ,
, , , , , , , , ,
. ( 2.12)
96
2.12
, , ,

( 2.13).
97
2.13
(.. cube)
, .. cube (b1),
, .. is (b1 cube). (taxonomy)
,
(inheritance),
,
AKO ISA .
,
, , ,
.
:
(classes): ,
,
:
.
(relations): , a_kind-of
is-a.
(functions): -
-1 .
: --
, ,
.
(axioms) : .
: , .
98
(instances) : .
: ( ).
/
Ausubel, D. P. (1967). Learning Theory and Classroom Practice. : The Ontario Institute For Studies
In Education.
Ausubel, D. P. (1968). Educational Psychology. A Cognitive View. : Holt, Rinehart & Winston,
Inc.
Caas,A.J., & Novak, J. D. (2006). Re-examining the foundations for effective use of concept maps. A. J.
Caas & J. D. Novak (.), Concept Maps: Theory, Methodology, Technology. Proceedings of the
Second International Conference on Concept Mapping ( 1, . 494-502). , :
Universidad de Costa Rica.
http://www.ihmc.us/groups/acanas/wiki/bcb07/Alberto_J_Caas_Publications.html
Collins, A. M., & Quillian, M. R. (1969). Retrieval time from semantic memory. Journal of Verbal Learning
and Verbal Behavior, 8 (2), 240247.
http://matt.colorado.edu/teaching/categories/cq69.pdf
Collins, A. M., & Quillian, M. R. (1970). Does category size affect categorization time?. Journal of Verbal
Learning and Verbal Behavior, 9 (4), 432438. A.M. Collins
http://allancollins.northwestern.edu/pubs-more.html
Gruber, T. (2009). Ontology . L. Liu & M. T. zsu (.), he Encyclopedia of Database Systems.
: Springer-Verlag. http://tomgruber.org/writing/ontology-definition2007.htm
Minsky, M. (1975). A framework for representing knowledge. P. H. Winston (.), The Psychology of
Computer Vision (. 211-277). New York: McGraw-Hill.
http://courses.media.mit.edu/2004spring/mas966/Minsky1974Frameworkforknowledge.pdf.
Novak, J.D., & Gowin, D.B. (1984). Learning How to Learn. & , .: Cambridge
University Press.
Novak, J.D. (1991). Clarify with Concept Maps: A tool for students and teachers alike. The Science Teacher,
58 (7), 45-49.
Rumelhart, D. E., & Ortony, A. (1977). The representation of knowledge in memory. R. C. Anderson and
R. J. Spiro (.), Schooling and the Acquisition of Knowledge (. 99-135) . Hillsdale, :
Erlbaum. http://www.cs.northwestern.edu/~ortony/Andrew_Ortony.html.
Rumelhart, D. E. (1975). Notes on a schema for stories. D. Bobrow & A. Collins (.), Representation
and understanding (. 237-272). N : Academic Press.
Rumelhart, D. E. (1980). Schemata: The building blocks of cognition. R. J. Spiro, B. C. Bruce, & W. F.
Brewer (.), Theoretical Issues in Reading Comprehension (. 33-58). Hillsdale, :
Erlbaum.
Schank, R.C. (.) (1975). Conceptual Information Processing. : Elsevier.
Schank, R. C., & Abelson, R. P. (1977). Scripts, Plans, Goals and Understanding: An inquiry into human
knowledge structures. Hillsdale, : Erlbaum Assoc.
99
Schank, R.C. (1991). Tell Me a Story: A New Look at Real and Artificial Intelligence. : Simon &
Schuster.
, ., , ., , ., , . & , . (2011).
(3 ). : .

1
(.. Java, C
++);
. (states),

.
. (states)

.
. .
/
.
2
: :
.
.
, .
.
/
2 1.
3
(.. , )
:
. , .
. , .
.
.
. .
. , .
/
100
, , .
4
:
. ,
. ,
. ,
. .
/
,, ,
5
;
. ,
. ,
. ,
. ,
. .
/
, ,
6

;
. ,
. ,
. .
/
.
101
3 -

.

.
,
.
.

3.1

,
.
.
(reasoning), ,
( )
.
:
,
,
.
3.1.1
(induction)
.
, .
:
,
,
.
, :
.
.
,
, . ,
:
102
.
,
.
,
,
.
,
, 4. ,

.
.
:
: .
: , .
3.1.2
(abduction)

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

. ,
:
: , .
: .
: .
: , .

(Case-Based Reasoning -/CBR)
( kj 4).
103
3.1.3
, (deduction), ,
.
:
:
, . ()
.()
. ( )
,
, . ,
, . ,
, ,
, , , ,
. ,
,
,
.

Modus Ponens Modus Tollens.

. , .
:
, . ()
. ( )
. (
)
:
Modus Ponens:

3.1 Euler Modus Ponens
104
3.1 - Euler (Modus Ponens)

Modus Tollens: ,

3.2 Euler Modus Tollens
3.2 - Euler (Modus Tollens)

,
(inference mechanisms)
:
(goal-driven top-down),
(data-driven bottom-up).

( 3.4 ).
3.2
-
(Knowledge-Based Systems - KBS),
. /KBS

(Rule-Based Systems-/RBS) .
3.2.1
, ( /IF)
( /THEN)::
<>
<>/<>
, .
, ,
,
105
3.6.
.
:
< >
< >
(pattern matching),
:
(pattern) (matches) (fact),
(bindings) , ,
( ) ,
.
,
.
.
:
< ?X >

, ,
"?".
Lisp. , Prolog
.
, then ,
if . then
,
if then .
(unification). :
: < >
:
AN < ?X >
TOTE < ? >
, , ? if
, ? then
< >. if
.
, , ?
? <
> < >.
:
AN < ?X >
< ? >
TOTE < ? >
106
, AND OR.
,
. ,
,
, ,
:
<is Farmer ?side>
<is Goose ?side>
<opposite ?side ?otherside>
<is Farmer ?side>, <is Goose ?side>
<is Farmer ?otherside>
<is Goose ?otherside>
, <is Farmer left> <opposite left
right> , ?side left
?otherside right, .
,
, :
<is Farmer left>
<is Goose left>
<opposite left right>
<is Farmer left>, <is Goose left>
<is Farmer right>, <is Goose right>
3.2.2
2 ,
:
,
(Deduction Systems).

, (Production Systems).
3.3
107
,
- (IF-THEN),
(inference mechanism).
. (fact)
, .. , ,
.

(facts) (active memory) (working memory).
,
.

. IF ,
AND OR,
, ( 3.1 3.2)
.
AN ,
, ,

modus ponens. TOTE /
, .
(Rules Base)
(Knowledge Base) .
(inference mechanism)
(inference engine) , ,
,
. (rule firing).

, .
3.4
3.4
3.3
(deduction systems)
, ,
.
108

(inference rules) :

,
,
.
, :
: {< >, < >}
: {R1: < > < >
< >}
,
R1, . <
> ,
,
.
:

.
.
3.5
109
3.6
3.6,
( ):
flies(),
lays(,),
has(, )
:
isa(,)
isa(,)
:
flies() lays(,) isa(,)
isa(,) has(, )
isa(,)
,
.
3.4
110
(production systems),
:

, ,
, , :

,
.
(production rules).
:

3
3

. (production memory).

, , .
3.7
3.4.1

:
111

.
:
1.
(facts)
(pattern matching).
2. (
)
(conflict set).
3.
, .
4.
(conflict resolution strategy).
5.
.
6. 1.
3.8
3.3 -
3.4.2
, , ,
.

(conflict set).
:
,
.
IF ,
,
.
IF ,

.
112

(conflict resolution) .
,
:
,
,
,
,
.
,
.
:
(pattern matching),
,
,
,
,
,
(forward vs backward chaining).
(forward chaining)
(backward chaining) .

Modus Ponens,
Modus Tollens ( ).
3.4.3
(forward chaining)
modus ponens,

(deduction) .
modus ponens:

:
(data-driven),
(bottom-up),
, .
113

,
(
)
>= 1 ,
( )
.

then .

:
, :

, :
R1:
IF ?X
THEN ?
R2:
IF ?X
THEN "" ?
,
(pattern matching)

.
:
) R1, ? ,
,
(binding) ? (? = )
) R1, ? ,
,
(binding) ? (? = ).
, :
: {R1(?=), R1(?=)}
(conflict resolution)
. ,
. ,
, R1(?=),
" " ( 3.1).
114
.
3.1
, ,
,
:
1
(): ,
: {R1(?=), R1(?=)}
( ) : R1 (? = )
( ):
2
(): , ,

: {R1(?=), R2(?=) }
( ) : R2 (? = )
:
3
(): , ,

: {R1(?=)}
: R1(?=)
( ):
4
(): , ,
115
,
: {R2(?=)}
: R2 (? = )
:
:
(): , ,
,
: {}
( ): ,
: ,
3.2

3.4 -
( ., 2011).
: 10x10
( 1.9)
, , .
, .
, ,
, .
,
1.9, :
:
robot_at(6,4)
direction(e)
choice(w) choice(e) choice(n) choice(s)
obstacle_at(2,3) obstacle_at(3,8) obstacle_at(4,2)
object_at(4,4) object_at(4,7) object_at(7,2)
object_at(8,5) object_at(10,6)
:
robot_at ,
direction ,
116
4 choice ,
( ),
obstacle_at ,
object_at .
:
1: detect_object:
if robot_at(X,Y) and object_at(X,Y)

then output(object is found), exit
2: move_west:
if robot_at(X,Y) and direction(w)

then delwm(robot_at(X,Y)), NX=X-1,
addwm(robot_at(NX,Y))
3: move_east:
if robot_at(X,Y) and direction(e)

then delwm(robot_at(X,Y)), NX=X+1
addwm(robot_at(NX,Y))
4: move_north:
if robot_at(X,Y) and direction(n)

then delwm(robot_at(X,Y)), NY=Y+1
addwm(robot_at(X,NY))
5: move_south:
if robot_at(X,Y) and direction(s)

then delwm(robot_at(X,Y)), NY=Y-1
addwm(robot_at(X,NY))
6: avoid_obstacle_south: if robot_at(X,Y) and NY=Y-1

and obstacle_at(X,NY) and direction(s)
and choice(ND)
then delwm(direction(s))
addwm(direction(ND))
7: avoid_obstacle_west:
if robot_at(X,Y) and NX=X-1

and obstacle_at(NX,Y) and direction(w)
and choice(ND)
then delwm(direction(w))
8:avoid_obstacle_north:
if robot_at(X,Y) and NY=Y+1

and obstacle_at(X,NY) and direction(n)
and choice(ND)
then delwm(direction(n))
9:avoid_obstacle_east:
if robot_at(X,Y) and NX=X+1

and obstacle_at(NX,Y) and direction(e)
and choice(ND)
then delwm(direction(e))
1 , 5 , 3
move_east 9 avoid_obstacle_east,
robot_at(6 4) choice(w), robot_at(6 4)
choice(e), robot_at(6 4) choice(n) , , robot_at(6 4)
choice(s) :
117
:
{3: move_east (X=6 =4)
9:avoid_obstacle_east (X=6
=4
=4
=4
=4
ND=w),
ND=n),
ND=s),
ND=e) }

() avoid_obstacle_east move_east,
,
,
avoid_obstacle_east.
,
. ()
9 avoid_obstacle_east (ND=n), , ,
(delwm(direction(e))
(addwm(direction(n)).
,
1 detect_object.
.
118
3.3
3.4.4
(backward chaining)
.
:
119
(goal-driven).
(top-down).
.
.
,
: .
,

, .
,
-. ,
-
.

.
, ,
.

Then

"

"
>= 1

( )

.

.
, , . ,
, .
,
.
,
, , .
, ,
. ,
120
, R1,
.
()

R1:
IF
AND AND AND
THEN " "

R2:
IF
AND NOT
THEN ,
R3:
IF
AND NOT
THEN ,
R4:
IF
AND NOT
THEN ,
R5:
IF
AND NOT
THEN ,
R6:
IF
AND NOT
THEN
( R1) :
, ,
, , ,
R1, . ,

. , ,
:
1
: , ,

: , ,
:
R2 ( )
R4 ( )
R5 ( )
R2 .
:
2
121
: , ,

: ,
:
R4 ( )
R5 ( )
R4, .
R4:
:
R6 ( ), R4, R5
R6 .
:
3
: , ,

: ,
:
R4 ( )
R5 ( )
R4 .
:
4
: , ,

:
:
R5 ( )
R5, .
R5:
:
R6 ( ), R5
R6 .
:
5
: , , ,
,
:
:
R5 ( )
R5 .
:
122
6
: , , ,
,
: :
R1 ( )
R1
: " "
3.5 -
3.4.5 (General Problem Solver)

Newell & Simon (1972)
,
:

,
.
, .

.
(basic problem solution space).
,
.
,

.
1959
- (General Problem Solver - GPS)
(Newell .., 1959).
/GPS
.
Means-Ends Analysis (MEA),
.
:
1.
2.
3.
4.
.
, .
.
, ,
.
/GPS :

123

, /GPS,
.
,
,

.
,
.

,

.
/
Negnevitsky, M. (2005). Artificial Intelligence: A Guide to Intelligent Systems (2 ). : AddisonWesley.
Newell, A., Shaw, J.C. & Simon, H.A. (1959). Report on a general problem-solving program. UNESCO Proc.
the Int. Conf. on Information Processing ICIP 1.6.8. (pp. 256264). : Unesco House.
http://bitsavers.informatik.uni-stuttgart.de/pdf/rand/ipl/P1584_Report_On_A_General_Problem-Solving_Program_Feb59.pdf
Newell, A. & Simon, H. A. (1972). Human problem solving. Englewood Cliffs, : Prentice-Hall.
Russell, S. J. & Norvig, P. (2007). : . :.
, ., , ., , ., , ., , . & , . (2011).
(3 ). : .
, ., & , . (1998). , Lisp. : . .
124

1

1.
2.
3.
4.
A.
B.
C.
D. .
1 , 2 , 3 D, 4 C
2
:
, .
1.
2.
3.
4.
, .
, .
, .
, .
/
1, Modus Ponens, 4,
Modus Tollens.
3
;
. ,
then .
. ,
, .
.
.
/
.
4

;
/
/
125
. .
, .
5
;
. .
. .
. .
/
,

, .
.
6
,
:
. ,
. ,
. ,
. .
/
,
.
, .
,

.
126

.
(Machine Learning) (Inductive Learning).
,
, (Decision Trees),
, (Case-Based
Reasoning), , (Neural
Networks), , (Genetic Algorithms).

, .
4.1
(Learning) .

, . , ,
, ,
, (Machine Learning).
:

, .
,
, , ,
.
Mitchell (1997):

, ,
, .
(Inductive Learning), (induction)

() (mental model). , o

(mental patterns),
o.
,
.
, :
;. ,
: ,
;. :

;.
127
,
:

.
,
.
,
, ,

. (
),
,
.
,

. ,
, ,
.
, ,
(Evolutionary Learning), .
.
.
,
: , ,
, , ,
(), (, ), .
4.2
, ,
: ,
. :
(Supervised Learning)
( )
,
. :
o
o
o
(Classification)
(Prediction)
(Interpretation)
(Unsupervised Learning),

. :
o (Association Analysis)
o (Clustering)
(Reinforcement Learning),
.
(Planning),
.
128

.

2

.
.

:

(Explanation-based Learning)
(Case-based Learning)

(Inductive Learning)
(Neural Networks)
4.1, .
,
(training set) , .
,
.
4.1
129
. ,
(recall)
(test data) , ,
. ,
, .
4.3

( )
.
(Inductive Learning algorithms)
.

.
(classification problems)
(regression problems).
. ,
, - ,
.
(supervised Inductive Learning)
, (predictor
function), , ,
.
:
, ,
(instance), .
(attributes)

.

(training set) .
(test set)
.

(goal function).

, (goal variable).
,
(error function)
.
(instances)
o (examples)
(attributes)
o (features), (qualifications),
(variables), (independent variables),
(input variables), (covariates)
(goal variable)
130
(goal predicate),
(dependent variable), (classification class)
(error function)
o (objective function),
(loss function).
o
h ,
f ,
D ,
x q .
, , x f(x) .

D = {(x, f(x))}
h(x; q)
x f.
h(x; q) f(x) x ,
q h(..).
, q(x1 x2 x3)
x:
(; ) = (1 2 ) ( 3 )
E :
() = [(; ), ]
distance
f x .
D.
:
(DecisionTrees),
(Explanation-Based Learning),
(Case-Based Learning),
(.. Backpropagation Neural Networks),
(.. Bayes),
(Boosting) ..
4.3.1
- (Decision Trees)
: ,
, ,
131
, , , .
(classes).

(classification rules) :

;
:
(features set - FS)

:
= { , , , || }
(classes C)
, ,
(conclusions)
:
C = {c1 , c2 , c3 , c|C| }

(training set - S).

, ,
, ,
.

,
. ,
,
.
, :

: , ,
.
,

, :
, , , ,
, .
,

. , ,
, ,
132
. 4.1
.
4.1
, ,
. ,
3 (, , ), 3 (, , ),
2 (, ) 2 (, ).
(3x3x2x2=36). , 8
,
22%:
8
= ~ 0.22 22%
36
,

.
4.2.
133
4.2
, ,

. (decision
tree)
, .

.
, 2.2
:

10
, 4.2,
4.2,

, (, ).
:

.

.

.
.
,
, :
134
TS
TS C,
TS
c.
TS
FS TS, Fi
v1, v2, v3,
vn TS
TS1, TS2,
TS3, TSn
TS
Fi n
, v1, v2, v3, vn.
TS1, TS2,
TS3, TSn
TSj
TSj
.
,
TSj

FS=FS-{Fi}
FS ,
TSj
c
TSj
C
TS
FS TS,
Fi v1, v2, v3, vn
TS TS1, TS2, TS3, TSn
,
.
ID3 (Quinlan,
1986).
ID3
ID3 (Iterative Dichotomizer 3) J.
Ross Quinlan Concept Learning System (CLS)
.
ID3 .
,
135
.
, ID3 . ,
n ( n = ) ,
.
,
.
ID3 :

.

.
(Shannon's Information Statistic,
), .
ID3, ,
.
.
, .

. ,
.

, ID3
.
(information entropy)
S: S:
() =
1=
p1,p2,pi .
ID3
,
.
,
.
, 1.
, , :
() = (1 ) (1 )
, N N(p)
N(1-p). :
, p=1 (1-p)=1, =0
136
, p=(1-p)= (
50%) =1 ()
4.3
S 14 5 9 ,
:
2
() = =
1=
5
5
9
9
14
14 14
14
= 0,360,36 0,640,64 = 0,94
4.4
n c
S. :
(, ) = () ()
1
4.5
, 4.1:
137
4.5
(, )
= () (3,2) + () (4,0) + ()
5
4
5
(2,3) =
0.971 +
0.0 +
0.971 = 0.693
14
14
14

S ,
(information gain) :
(, ) = () ( ) ( )
=1
E(...)
m i A S
fs(i) S Ai
SAi S i
:
(, ) = () (, )
138
ID3,
, :

.
.
.
ID3
ID3
, (FS) :
= {, , }
= {, , }
= {, }
= {, }
(C) :
= {, }
4.2.
4.2

139
1:
() = (5,9)
= (0.36, 0.64)
= (0.360.36) (0.640.64)
= 0.94
2: To .
:
,
,
.
(, )
= () (3,2)
+ () (4,0)
+ () (2,3)
5
4
5
=
0.971 +
0.0 +
0.971
14
14
14
= 0.693
.
(Gain).
(, )
= () (, )
= 0.940 0.693 = 0.247

( 4.6).
4.6
140
3: .
,
.
,
.
4.7
4:
0, , .
,
.
4.8 .
4:
0, ,
. 4.8
.

,
141
: , .
, :
= {1, 2, 8, 9, 11} = 5 1 =
( , ) = 0.970
( , ) = 0.570
( , ) = 0.019
. ,
( ),
4.9.
4.9. .
5:
ID3
, .
142
4.10
4.1 -
,

.
6:
(recall)
,
.
,
.
, .
ID3
.
,

()
.
143

(Russel & Norvig, 2003).
.
(FS) :
:
:
/:
:
:
:
:
:
:
:
(/);
(/)
(/)
(/)
(, , )
($, $$, $$$)
(/)
(/)
(-fre, -ital, -thai, fast)
(0-10, 10-30, 30-60,> 60)
4.3.
4.3
1 o ,
.
, /
( 4.11).
144
4.11

, . ,
.

.
4.12.
145
4.12
, ID3 . , ,
,
,
.
4.13
.
146
4.13

,
-.
147
, ,
ID3 5 ( .14).
4.14
,
,
if-then ,
.

( 20-39,
40-59, 60-79).
.
,
.
148

,
,
.
4.4
- (Case-Based Reasoning-CBR)
(cases)
, .

. /CBR (Analogical Reasoning)
( )
.

. /CBR
:
: .
. ,
.
/CBR

.
/CBR : (interpretation)
(problem-solving). /CBR ,
, ,
, , DNA
,
. , /CBR ,
, .
, /CBR Roger Schank (1982)
, (episodes, cases),
.
/CBR .
,
, (Leake, 1996).
, ,
,
.
, /CBR
.
, /CBR
,
,
-.
, , /CBR
.
, ,
. , . ,
149
ID3 ,
,
, ,
,
. , ,
, , .
/CBR, ()
.
. , /CBR
. ,
, .
, /CBR

, .
4.4.1 /CBR
/CBR :
(case library),

(case retrieval)
.
(case adaptation),
, , ,
, (case
verification),
(case learning),

.
/CBR .
4.4.2 /CBR
/CBR 4 :
(retrieve) ,
(reuse) ,
,
(revise) ,
(retain)
.

, ,
,
.
(Aamodt &Plaza, 1994).
4.15 .
.
150
4.15
4.2 - CBR
( 4.15)
(New Case). (RETRIEVE)
(Previous Cases). (Retrieved Case)
- (REUSE)
(Suggested Solution) . (REVISE),
(Solved Case)
(Tested Case) , , (Confirmed Solution). ,
(Repaired Case). ,
(RETAIN), (Learned Case)

, .
4.15,
, /CBR. (
) , /CBR.
,
.
/CBR :
,
.
,
.
151
,
.
.
,
.
.

,
. ,
,
(Maher .. , 1995, .4).

.
, .
.
,

.
4.4.3 /CBR
/CBR , ,
.

.

. /CBR
,
.
. /CBR
.
/CBR
:
( , )
( , )
(
,
.
, /CBR
.
/CBR (Aamodt&Plaza, 1994):
(Exemplar-based reasoning
(Instance-based reasoning)
(Memory-based reasoning)
(Analogy-based reasoning)
152
/CBR , /CBR
. ,
,
. ,

.
: , ,
.
4.4.4 -
/CBR (..
) :
/CBR .
,
. ,
,

, /CBR
.

.
,
,
. ,

. ,
, .
,
,
. ,
.
, /CBR:
,

.
,
.

.

.

.
153

.
.
/CBR ,
(planning), (diagnosis)
(design) . ,
, . /CBR
,
,
. , /CBR
/CBR (Interpretive CBR).
4.4.5

(Knowledge-Based System-KBS).
/CBR
.
, ,
, ,
, .

.
,
. ,
, .
,
. , ,
,
.
154
4.5
4.5.1
(Neural Networks, Connectionist Networks, Parallel Distributed Processing
odels) ,
,
.
19
, (neurons), .
. 10 .
, . ,
,
1000 10.000.
4.1
4.16
155
3 ( 4.16):
(dendrites), ,
(cell body),
- (axon), .

(synapse).
,
( 4.17).
.
( ), (
) ,
.
4.17
,
. (
40 mV 75 mV),
. .
:

, .
.
.

,
.

,
156
.

,
(
, )

.
4.5.2
, ,

, . - (Artificial Neural NetworksANN) ().
xi y. xi
wi (summation function) F:
(transfer function),
(threshold value) ,
:
> 0

( 4.18).
157
4.18 (Perceptron)
Perceptron
(basic Perceptron), Perceptron
x=(x1, x2,.., xn) g :
= ( )
=1
(layers) .
(hidden layers)
.
(units) (nodes)
,
.

.

,
.
(input layer)

(output layer) .
158
,
( ) ,
,
( ),
,
,
( ) ,
.
4.5.3
:
1943: McCulloch & Pitts
1949: ebb
,
.
1957: Rosenblatt- Perceptron.
1969: Minsky & Papert- o
.
1982:
.
1986: Werbos & Rumelhart (backpropagation)
.
4.5.4
, :
(feed forward)
(feed backward)
,
, ,
( 4.19). ,
.
(backpropagation).
159
4.19
, (recurrent ANN),

. ,
(autoassociated memories) ,
(heteroassociated memories) ( 4.20) .
4.20
160
() .
,
.

. (fully connected),
, 4.19,
(partially connected), 4.21.
, ,
, ,
(feed forward) (feed backward recurrent).

.
4.21 2

(transfer functions) (
4.22), :
(threshold functions),
(sign functions),
(hard limiter functions),
(ramping functions).
..
161
4.22
Perceptron ( 4.18).
, , ,
(sigmoid functions) (Gaussian functions) ( 4.23).
162
4.23
4.23, j
cj 4.23 0,
:
2
( )
( ) = (
)
2 2
4.5.5
Perceptrons
163
Perceptron (Rosenblatt,1962)
, 4.18,
Perceptrons .
, Perceptrons
, or ( 4.24 ).
4.24
4.25 Perceptron or . Perceptron

. 0 1
0 1 .
4.25 O Perceptron or
4.3 - or
Perceptrons ,
xor ( 4.24 ),
Perceptrons .
xor
164

xor ( 4.24), 4.26,
.
, . .
0 1 0 1 .
4.26 xor
4.4 - xor

,
, : (training) (recall)
( 4.27).
,
.
, ( )
.
165
4.27
4.5.6
,
.
, (
4.2).
,
( ),
.
,
.
,
.

.
(supervised learning),
(unsupervised learning).
, Kohonen. 4.4
.
166
4.4

, (training algorithm)
. :
(backpropagation),
(competitive learning),
(random learning).
,
.
perceptron,
.
Perceptron
Perceptron
(training set), (x, f(x))
:
y x .
, .
, :
o ,

.
o ,

.
,
.
167
Perceptron ,
1:
w(0)=0.
2:
n, Perceptron x(n)
d(n).
3:
Perceptron:
() = [() () ]
4:
Perceptron.
( + 1) = () [() ()] ()
:
() = {
+,
,
()
()
5: 2.

. ,
Perceptron .

(learning rules)
,
.
(Delta rule),
:
= ( )
:
ai: i,
aj: i ,
d: (d>0) ,
wi: i,
wiold: i.
d .
.
,
.
ebb (Hebbian rule):
168
Irate : ,
au, ai : u i.
au.ai>0 ( + -),
. , .
o k , p,
:
= (k,p k,p )
k
:
=
1
2
(k,p k,p )

k p:
1
2
=
(k,p k,p )
=1 =1
,
.

,
(error back-propagation).
, Backpropagation (Backpropagation ANN).
Backpropagation ,

( 4.28).

,
.
.
169
4.28

. ,
.
k k p
Perceptron, :
= (k kp )
k (uk),
,
:
= (kp kp ) g( )
To i
k wik, :
= g( ) wik k
1

. ,

.
170
i i,
:
= aj
, i j
i, j o (learning rate) d.
2 :
(incremental training),

(batch training),
,
.
( )
(training epoch).
Kohonen
1984 Khonen

.
.
Khonen ,
.
:
.
Khonen : 1 2
Khonen (Khonen layer),
, : ,
, n x m
. ,
Kohonen. k
, k x n x m . 4.29 .
Kohonen
(pattern) Kohonen
(
).
(cluster)
. ,
Kohonen, . ,
. ,

.
( ),
,

. ,
(mexican hat function).
171
, Kohonen -
(self-organizing maps).
4.29 Kohonen
Kohonen
Kohonen 4.30
, 2 . 2
, Kohonen 9 .
172
4.30 Kohonen
2 .
1 : 1
2 : ,
.
, 1
1 . , ,
Kohonen,
. 11 12 21.
7
, ( 4.31).
2 , 1
2 .
173
4.31 1 Kohonen
Kohonen (data mining)

.
- Hopfield
Hopfield - (autoassociative memory)
.
, . Hopfield
(recurrent) .
Hopfield :
, ().
,
. 0 1,
.
,
.
.
174
4.32 Hopfield
Hopfield n , n x (n-1) ,
, ( 4.32).
, . ,
, i j
wij wji. , Hopfield wij=wji,
.
Hopfield
.
. , ( 0 1
) .
.
Hopfield .
4.5.7
,
, :
.
() .
,
.
:
175
.
.

.
,

, .
, - .
- ,
-.
, , (
)
(..
).

.
(hardware)
. ,
,
.

VLSI (Very-Large-Scale Integration)
, ,
.
4.5.8
.
:
.
.
.

.
5.
.
6.

1.
2.
3.
4.
176
4.5.9
-
(, , ):
,
,
(planning),
,
(Scheduling),
.
, ,
, , ,
, .
177
4.6
4.6.1 :
(Genetic Algorithms-GA)
,
(Evolutionary Learning). ,

. (chromosomes),
(genes).
4.2 - http://aliengrip.pblogs.gr/
.

, :

.

.
.

. ,
,
.
. ,
,
,
.
178
H (
) .

(Evolutionary Algorithms) ,
.
, ,
( ),
.
. H
( ),
, , ,
. :
. /
(offsprings/children) .
,
.

.
(evolutionary cycle). 4.33 .
4.33
4.6.2
() John Holland (1975)
,
. , ,
(Evolutionary Computation),

( 4.34).
179
4.34

1960. 1975, John Holland Adaptation in Natural and
Artificial Systems Kenneth DeJong, Holland,
Analysis of the behavior of a class of genetic adaptive systems.
. DeJong ,
,
.
1985.
Holland, David Goldberg,
. , Goldberg
1989 Genetic Algorithms in Search, Optimization and Machine Learning,
,
.
,

, Holland ,
.
4.6.3
()
, ,
, ,
.
, 2 :
180
, ,
.

, . ,
,
,
.
,
.

.
,
.
.
,
.
:
,
,
.
.

.

, ,
.
(strings)
, ( ),
.

, .

,
,
.

, (fitness function),
,
.

(t): t.
4.6.4
:
, ,
, ,
,
.
181
,
,
.
, ,
, 3
:
,
r ,
m .
.
Genetic Algorithms in Search, Optimization and Machine Learning (1989),
Goldberg
(canonical genetic algorithm):
:

.
,
.
:
.

g(x).
,
.
:
r ,
-.
m
.
- .
.

, 2.
4.6.5
,
.
(string) n, .
,
. (genotype) .
.
Holland {0,1}.

182
, . ,
. ,

, , , .

.
(phenotype). ,

. , ,
.
:
: 01101
: 13
() ( )
. ,

.
4.6.6

.
.
.

.

.

, , .
,
, .
,
.

5 ,
. off on
0 1 ( 4.35).
183
4.35 5
5 ,
5 .

5 . , 4,
( 0=
1=):
01101
11000
01000
10011
Goldberg Genetic Algorithms in Search,
Optimization & Machine Learning .
4.6.7

.
(schema) (prototype resemblance)
.
, ,
,
.
01101 01010 .
bits 01. ,
01*** , .
, 0 1. 0 1
bits. ,
{0, 1, *}, .
2 , n
. , 01*** 8 ,
, [01100, 01000, 01110, 01111, 01001, 01010, 01011,
011101]. , ***** .
, (defining length)
bit . ,
01***01***, bit ( 0) 1
bit ( 1) 7. , 7 - 1 = 6. (order)
bits. 01***10*** 4
, 4.
:
184

.
, bits,
.
,
.
.

.
4.6.8

.
,
. (Reproduction)

, ,
,
.
,
,
'
. , (.. ),
. ,
, .

.
, o
, (altitude)
. ( )
. ,

.

.
.
(roullete wheel
selection),
.

.
.
n 0 .
185

n.
.
,
,

.
.

4.6.6
g, g (x)=x2, (
4.5) .
4.5
g
, .
01101:
: 01101
: 13
: (13) = 132 = 169
169
(): =
100 = 14.4
1170
3
.
4.5,
4.36,
:
186
4.36
,
4 ( ).
:
.
.
n 0 .
,
, n.
.
, 169,
14.4% . , 14.4%
0 169.
, 0-169,
0.144. 576, 49.2%
. ,
170 745 (170+ 576) 49.2% .
,
170-745, 0,492. .

4.6.
187
4.6
4.5 -
4.7

*
4.7
,
,
.
(tournament selection).
,
,
. ,
( ).
,
() (rN).
, ,
rN rN/2 .
(1-r)N ,
(r1).
188
,
( 4.37).
4.37
4.6.9
(genetic operators),
, ,
.
:
.

. , , .
,
. ,
189

, .
4.6.10
,
(Crossover) .

. , ,
, .

.

(allele) .
.

(single point crossover),
( 4.38),
( 4.39).
.

.
4.38
,
,
4.39, 5 {2
3 4 5 6}, . 2
1 (5,3,4,6,2) 2 (3,4,2,6,4),
1 , 5 & 3, 3 , 4,2 & 6,
2 2 .
.
190
4.39

.

. (two-points crossover)
.
, .

. , .
,
.
, ,
.
4.40

, , (uniform
crossover), :
. ,
.
191
4.41

,
, ,
.
.
4.42
4.6.11 (Mutation)
,
. , .
(mutation) , ,
. ,
,
. , ,
.
192
, m
. m (< 10%)
. m , ,
.
, .
, , .
.
.
( 4.43),
, 1 0
.
4.43
,
( 4.44).
4.44 3
,
. ,
, 4.45.
scrabble lists (scrabble lists mutation)
,
. , (uniform mutation),
.
( 50%)
. 4.45, x1
2,3,5,6 ,
193
8,4,7,1.
,
.
4.45
, .
,
. ,
,
.
4.6.12
,
,
(generational replacement). 3 :
(total replacement):
.
(partial replacement):
( )
( ).
194
(steady state replacement):

( )
.

, : .
(selective pressure)
, . ,
.
(generational diversity)
. , ,
.
,
. ,

.
, .
4.6.13
, , (Elitism).

,
.

.

:
,
,
,
.
4.6.14

,
.
. ,

. ,
195
,
.
, .
. ,

.
, :
,

,
, .. 500 .
4.6.15
:

.
,
,
. , ,
.
,
.

.
,
.
, .
,
.
4.6.16
,
.
:
,
,
( , ,
),
(++ ),

(Genetic Programming),
/ (IFTHEN-ELSE, WHILE .)
.
196
/
Aamodt, A., & Plaza, E. (1994). Case-Based Reasoning: Foundational Issues - Methodological Variations,
and System Approaches. Artificial Intelligence Communications-IOS Press, 7(1), 39-59.
http://ibug.doc.ic.ac.uk/media/uploads/documents/courses/CBR-AamodtPlaza.pdf
Beale, R., & Jackson, T. (1990). Neural Computing: n ntroduction. ..: Adam Hilger.
Colin, . (1996). Building Decision Trees with the ID3 Algorithm. Dr Dobbs Journal of Software Tools for
Professional Programmer, 21(6), 107-109.
De Jong, K. (1975). An Analysis of the Behavior of a Class of Genetic Adaptive Systems (
, Michigan, ).
http://deepblue.lib.umich.edu/handle/2027.42/4507
Goldberg, D. (1989).Genetic Algorithms in Search, Optimization & Machine Learning.Wokingham, :
Addison-Wesley.
Qu, R. (2002). Case-Based Reasoning for Course Timetabling Problems (
Nottingham). http://www.cs.nott.ac.uk/~rxq/files/PhDThesis.pdf
Quinlan, J. R. (1993).C4.5 : Programs for Machine Learning. : Morgan Kaufmann.
Holland, J. H. (1992). Adaptation in Natural and Artificial Systems (2 ). , MA: MIT
Press.(1 1975 University of Michigan Press)
Leake, D. B. (1996).Case-Based Reasoning: Experiences, Lessons and Future Directions. Menlon Park, CA:
AAAI/MIT Press
Maher, M., Balachandran, B.,&Meizhang, D. (1995). CBR in Design. New Jersey: Lawrence Erlbaum
Publishers.
Mitchell, T.M. (1997). Machine Learning. Maidenhead, ..:McGraw-Hill International Editions.
Nordlund, J., & Schafer, H. (2006).Case-Based Reasoning in a Support system (Master in CS,
Umea). http://www8.cs.umu.se/education/examina/Rapporter/NordlundSchafer.pdf
Pao,Yoh-Han (1989). Adaptive Pattern Recognition and Neural Networks. Wokingham, : AddisonWesley.
Russel, S. J. , & Norvig, P. (2003). Artificial Intelligence-A Modern Approach (2 ). Upper Saddle
River, : Pearson Prentice Hall (1 1995).
Utgoff, P. E. (1989). Incremental Induction of Decision Trees. Machine Learning, 4, 161-186.
http://people.cs.umass.edu/~utgoff/papers/mlj-id5r.pdf
Whitley, D. (1994). A Genetic Algorithm Tutorial. Statistics and Computing, 4, 6585.
http://www.cs.colostate.edu/~genitor/MiscPubs/tutorial.pdf
, ., , ., , ., , ., , . & , . (2011).
(3 ). : .
197

1
;
1.
2.
3.
4.
,
,
,
.
/
2 4.
2
;
1. ,
2. ,
3. , .
2.
3
;
1. .
2. .
3. , ,
.
4. ,
.
4
:
1. , .
2. , .
3. , ,
.
4. ,
.
198
1.
5

;
1.
2.
3.
4.
5.
,
,
,
,
.
2, 4 5
6
2 1=001111000 2=100001111
4.
;
1.
2.
3.
4.
1=001011000 2=100101111
1=100011000 2=001101111
1=001101111 2=100011000
1=001001111 2=100110000
3.
7
, ,:
1.
2.
3.
4.
.
.
.
.
1 4.
199
5 -

(Rule-Based Expert Systems).
, , .

.

, .
5.1
- (Expert System - ES)
()
. ,
.
,
.

- (Knowledge Based Systems - KBS).
, .
5.1

.
, ,
, .
, .
, :
( K 2).
200
(knowledge acquisition)
:
,

.
5.2
- (Rule-Based Expert Systems-RBES)
(production system model),
Newell Simon Carnegie-Mellon
70.

(long-term memory)
(short-term memory) ( 5.2).
5.2
, :
(DataBase) (Working Memory)

,
(RuleBase) (KnowledgeBase)
(Productive Memory) ,
(Inference Mechanism)
(Inference Engine) .
(Interface)
.
(Explanations
Facilities).
201
5.3
,
. , .
, ,
,
( 3).

.
.

. ,
, .
,

.

.

.
,
.
5.3
, , . ,
.
,
. , .
, , , .
202
(heuristics),
. , ,
, .
.
, ,
. ,
.
, , .
, , ,
, ,
.
, (
).
(expert system shell),
. . ,

.
,
.
.
,
,
:
= +
= +
5.1
.
5.1
203
5.4
5 :
,
,
,
,
.

. 5.4 .
5.4
(domain expert)
. ,
. , :
/,
/
.
.
(knowledge engineer) ,
. , .
, ,
204
.
,
. / ,
.
(programmer) ,
.
,
LISP Prolog,
.
(project manager) ,
. /
, , ,
.
(end user) , .
.
, - .
.
5.5
(Knowledge acquisition)

(Buchanan et al, 1983) , , :
7. ,
8. ,
9. .
/ ,
.
5.5.1
(Knowledge elicitation)
, , ,

. ,
, (intelligent expert system).
,
. ,
3, .
(knowledge
engineering) , ,
, (facts)
(rules).
= +
Knowledge = Facts + Rules
,
. ,
, .

205
.
,
,

. ,
.

,
. , .

( 4, ).

.
,
. , , ,
,

. ,
. ,
,
: ,
, .
,
,
, ..
, .
5.6
(Uncertainty) .
,
. ,
.
(heuristics):

. ,
, ,
. ,
,
. ,
,
.
, ,
.
:
,
:
( ;)
,
:
206
( ;)
:
( ;)
,
:
,
.
5.6.1
,
.
,
.
, [IF <premises> THEN <conclusions>]

. , ,

.
5.5 100%
( 1.0) 80%
( 0.8). ,
, 80%.
.
5.5 1.0

.
(certainty factors-CF) ,

, -1 +1. - ,
MYCIN, :
=

(, )
MB = (measure of belief)
MD = (measure of disbelief).
207
MB MD .
,
,
.
, .
,
, .
( ... )
.
() =
( ... )
.
() =

.
=
:
(CF=0.4)
(CF=0.2)
(CF=0.9)
= =
=
. . = .

, .. 0.2. ,
.
.

,
:
= ( , , )
:
1:
2:

( 0.85)

( 0.75)
208
3:

( 0.75)
4:

( 0.8)
(0.8)
(0.6)
(0.9)
(1.0)
:
1) 2 ( ):
= =
(. . . ) . = . . = .
2) 4 (
):
= = . . = .
0.36.
5.7
(fuzziness) .
.
. ( -, -, -)
. ,
.

, Zadeh (1965).
, 3
6. , (fuzzy sets)
, ..

: ,
, , , ,
; , , ,
.
(fuzzy rules).
, ..
209
,

.
(fuzzy logic),
,
.
(membership function)
. F [0,1],
F(x)=0 x ,
F(x)=1 x ,
x
.
.
,
,
, , ", .
,
:
5.6
: F(8)=1.0,
F(10)=0.2,
F(10)=0.8, F(40)=0.0
F(22)=1.0
F(40)=1.0
, :
() = ( (), ())
, 10
:
() = ((), ()) = (. , . ) = .
210
:
() = ( (), ())
() = ( (), ()) = (. , . ) = .
(sigmoid),
(triangular) (trapezoid) .
5.7.1
, )
:
A

R(x,y)
(implication relation).
:
1:
11 12
1
2:
21 22
2
n:..
(truth value)
. max-min ,
:
= [((F11, F12, )) , (F21, F22, ), ]
max-min , .

max-min ,
,
:
1:

(PL)
211
2:

(PM)
3:

4:

(ZR)

(N)
:
: 90
: 650Pa

,
.
5.7 90
212
5.8 650Pa
, 2 3.
2:

(, )
= ( (), ())
= (. , . ) = .
3:

(, )
= ( (), ())
= (. , . ) = .
, max -min :
= [ ( (0 ) , ()) ,
( (), ())]
= [. , . ] = .
0.48
.
5.9
, 2
, (PM).
.
, 4 ( 5.10)
3 :
1: ( )
.
213
2:
.
3: .
4: .
5.10 4
5.8
.
: --
, --".
.
. .
.
-.
.

. ,
.
.
.
.
-,
, , .

.
.

214
. (>100 )
, , .
. ,
.
, ,

.
.
/
Buchanan, B.G. (1983). Partial bibliography of work on expert systems. Sigart Newsletter, 84, 45-50.
http://infolab.stanford.edu/pub/cstr/reports/cs/tr/82/953/CS-TR-82-953.pdf
Negnevitsky, . (2005). Artificial ntelligence: A Guide to Intelligent Systems (2 ). , :
Pearson Education.
Russel, S. & Norvig P. (2003). - (2 ). :
.
Zadeh, L.A. (1965). Fuzzy Sets. Information and Control, 8, 338-353.
http://www.cs.berkeley.edu/~zadeh/papers/Fuzzy%20Sets-Information%20and%20Control1965.pdf
, ., , ., , ., , ., , ., & . (2011).
(3 ). .

1

1.
2.
3.
4.
5.
.
.
.
.
.
/
2,3 5.
2
, :
1. (facts).
215
2. .
3. .
4. .
/
3.
216
6 -
( )

.

, .

, , , .
6.1
(agents) (intelligent agents)
, ,
.
, ,
, ,
.
6.1 -
,
, . ,
,
. ,
.

. , ,
,
(sensors), ,
(effectors)
(Russel &
Norvig, 2009).
217
6.2 Russel Norvig
, , ,

, Russel Norvig
.
, ,
. , .. ,
,
- . ,

,

.
,
, , .
, ,
, . .
,
(
) , .
,

.
.
6.2
Russel Norvig (2009)
. ,
, .

, .
Pattie Maes, Media Lab MIT,
. :
, . Maes
(Maes, 1995), ,
:
,
.
.
218
6.3 Maes
,
Hayes-Roth (Hayes-Roth, 1995), :
:
, , , ,
, , ,
.
6.4 Hayes - Roth
, SodaBot MIT
AI Lab Michael Coen 1994. Coen
(interactivity):
,
.
6.5 Coen
219
6.3
.
, .
:
(autonomy):
, ()
.
(social ability):
.

.
(rationality):
,
.

, :
(reactiveness):

.
(pro-activeness):
,
(, ).
(knowledge):
, ,
.
(beliefs ): (view)
, .
(desires):
, , ,
. ,
.
(intentions): ,
.
, ,
.
(obligations):
,
.
(adaptivity):
( ).

, :
(mobility):
.
(cooperation) :
o (veracity): .
220
(benevolence):
,
.

,
,
( 6.3).
6.6
,
, , - .
,
, . ,
, ,
, .
6.4

, , .
221

. :
6.7
,
, .
(biological agents) ,
, , ,
, .
(artificial agents)
, .
(robotic agents robots)
.
6.8
(computational agents) (software

agents), .

222
, .
(task-specific agents),
(entertainment agents) (viruses). ,
(artificial life agents) , , ,
, .
6.9
,

.
, .
.
6.4.1
(rational agents)
. (knowledge base),
(logic formulae),
, . ,
, .
:
10. ,
11. ,
12. , , ,
.

. , ,
() ,
. ,
( )
, .
6.5
, ,
. :
.
.
223
.
-
, .
,
. ,
. :
: ,
,
(software) (hardware).
.
: , ,
,
, , , .
6.6
.
,
. Russel & Norvig (2009) :
(Fully Observable / Partially Observable):

, .
,
. ,
,
.
. ,

,
.
,
.
(Deterministic / Stochastic):

, ,
.

. , ,
. , ,

.
(Episodic / Sequential):
, .

.
,
. ,
.
224
,
,
.
(Static / Dynamic):
, ,
. ,
, (semi-dynamic).
.
(Discrete / Continuous):
.
, ,

(). , ,

.
( Single Agent / Multiagent ):
,
, .
.
,
.
,
.
.
6.7
,
, . ,
:
, ;
,
,
.

,

.
(modules) ,
,
.
,
, (reactive agents)
(internal state agents).
-
225
,
.

, ,
.
6.10
6.7.1
(reactive agents)
. ,

, . , .
: ,
.
6.1

,
(activator).
226
(simple reactive agent)

, .

.
6.11
(model-based reactive agent)

.
.
6.12
6.7.2
227

. ,
.
6.13
,

,
(deliberated agents).

: ,
- ( 6.10).

(goal-based agent),
,
. (goal)
.
,
,
.

.
228
6.14

BDI (BDI agent)
(Weiss, 1999). ,
: , .
(beliefs)
, (
). , ,
, ( 3),
.
(, ,
).
(desires) .
. ,
: ,
.
o :
.
(intentions) .
. ,
.
o (plans)
.
: ,
.
, ,
.
BDI
:
229
(events) .
,
.
, ,
.
BDI, , :
1. , ,
.
2. ()
() .
3. ()
.
(utility).
(utility function)
.
, .
, .
6.15 BDI
BDI,
, .
. ,
, . ,

, . ,
.

.
230
t = 0 :
o ,
o P ,
o .
t = 1 :
o (),
o ( ),
o ().
,
.

, ,
. ,
:
.

.

.

, .

, ,
. ,

.
231
6.16
6.7.3
(hybrid agents)
.

.
, (
6.17). ,
. , ,
.
6.17
232
6.7.4
(mobile
agents).
.
(software processes),
.

(server) ,
.

. ,

, ,
, ,
. ,

, ,
, .
, .
,
,
, , . ,
,
, , . , ,
, .
6.8
(multi-agent system)
, .
, :

.

,
.
233
6.2 ,
6.8.1
(coordination).
, :
O
.
:
(Negotiation)
(Cooperation)
.
.
.
6.8.2 &

, :
( ),
( ),
234
( ).
;
;
;

.
, ,
, . ,

,
.
6.8.3
, ,
.

(blackboard systems) (message passing systems).

( ).
6.18
, 6.19:
(knowledge sources), (modules)

,
(control component),

,
(blackboard),
,
.
235
6.19

.
,

.
.
.
6.19
.
.
.
236
6.8.4

.
,
, (Huhns
Stephens, 1999).
.
, ,
, , ,
, .
,
(cardinality).
. :
1 1,
1 ,
.
6.8.5
,
. , ,
,
.
(coordination) ,
.

(cooperation),
(cooperation protocols), (negotiation),
(negotiation protocols).

.
.

.
:
,
,
,
,
,
.
237
, _
_,
, :
_: _.
_: :
o _.
o _.
o _.
o _.
6.8.6
.
,
,
, ,
,
.
.

, .
6.8.7
.
:
, (syntax)
(format of messages),
, (semantics)
(meaning of information).
1990
KQML FIPA ACL. FIPA ACL
(Foundation for Intelligent Physical Agents - FIPA) 1999
. FIPA ACL
KQML, .
.
FIPA ACL S/SL8 , ,
, , . ,
ACL , ,
.
FIPA ACL
. , ,
,
. , 2005 FIPA ACL FIPA
IEEE.
8
S/SL (Syntax/Semantic Language) Cordy, Holt Wortman 1982

. ,
.
238
6.9
, ,
: , , , ,
, , .
(personal assistants) .
,
Word
(Calendar Agent, Calendar Aprentice).

,

, .
,
,
, .
:
Buyer agent or shopping bot .

o MySimon bot
User or personal agents
Monitoring-and-surveillance agents ( predictive agents)
.
Data-mining agents
.
, (Web of Data)

, ,
.
/
Buchanan, B.G. (1983). Partial bibliography of work on expert systems. Sigart Newsletter, 84, 45-50.
Coen,M. (1994). SodaBot: A Software Agent Environment and Construction System [Technical Report 1493].
:MIT AI Lab.
Hayes-Roth, . (1990). Architectural foundations for real-time performance in intelligent agents. Real-Time
Systems, 2 (1-2), 99-125
Hayes Roth, B. (1995). An architecture for adaptive intelligent systems. Artificial Intelligence (Special Issue
on Agents and Interactivity), 72, 329-365.
Huhns, M. & Stephens, L. (1999). Multiagent systems and societies of agents. G.Weiss (.), Multiagent
Systems. A Modern Approach to Distributed Artificial Intelligence (.79-122). , :
MIT Press .
http://www.uma.ac.ir/files/site1/a_akbari_994c8e8/gerhard_weiss___multiagent_systems___a_moder
n_approach_to_distributed_artificial_intelligence.pdf
239
Maes, P.(1995). Artificial Life Meets Entertainment: Life like Autonomous Agents. Communications of the
ACM, 38 (11), 108-114.
Poole, D. & Mackworth, A. (2010). Artificial Intelligence: Foundation of Computational Agents. ,
: Cambridge University Press.
http://artint.info/html/ArtInt.html
Russel, S. & Norvig, P, (2009). Artificial Intelligence: A modern approach (3 ). Upper Saddle
River, :Pearson Education. http://51lica.com/wpcontent/uploads/2012/05/Artificial-Intelligence-A-Modern-Approach-3rd-Edition.pdf
Zadeh, L.A. (1965). Fuzzy Sets. Information and Control, 8, 338-353.
Weiss, G. (1999). Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence.
, : MIT Press.
, ., , ., , ., , ., , . & , . (2011).
(3 ). : .

1
:
1. ,
2. ,
3. .
/
2 3.
2
;
1. .
2. .
3. .
/
2 3.
3
;
1.
2.
3.
4.
,
,
,
,
240
5. .
/
2 4.
4
;
1.
2.
3.
4.
5.
,
,
,
,
.
/
2 5.
5
;
1. ,
.
2. ,
.
3. ,
.
/
2.
241
7 -
.
,
, . , (
), ,
,
. (:
, )

.

,
7.1
(natural
language processing-NLP) (natural language understanding-NLU),
. , , ,
- (human-computer interaction). ,

(, , ..) .
. ,
,
.
(information management),
NLP
. , ,
, .
(database searching).
,
(special query language-SQL).
,
. ,
. ,
.
7.2

(ambiguity of language) : .
, (ambiguity at syntactic level) .

,
, . :
242
.
;
, (ambiguity at lexical level),

. :
.
; ,
.
, (ambiguity at referential level),

, . :
, . ,
;
, (ambiguity at semantic level), ,

,
. :
.

;
, (pragmatic level),
, .
:
. ;
. ,
, :
, .
""
, (
).
, , .

.
.
7.3
1950-1960,
, .
1960 , ELIZA Weizenbaum

(finite state automata, FSA)
(.., ). ,
243
Schank (semantic networks)

(conceptual dependencies).
1968-1970, Winograd, SHRDLU , Lisp,
.
1970 Montague ,
. 19
20 , Frege

(compositional semantics).
1977 Schank Abelson
(scripts)
.

,
. , ELIZA,
,
-. , :

: -
;
,
;

,
;
,
;

;

;

;
,
244

;

;

;
L :
. (templates) , ..
1:
XXX ?
2:
XXX ?
3:
XXX ?
. -
, ..:
, , , , ...
. -
, ..:
1:
ZZZ XXX ZZZ ;
2:
ZZZ ZZZ;
:
:

;
245

;
-, .
, , ,
, :

7.4
: ,
. (well formed)
(ill formed) , .
, :
;
:
.
: ,
.
.
. .
. . .

. ,
.
,
,
.
7.4.1
.
,
(morphological analysis):
, , , , ( - inflectional morphology).
, (.. -)
( - derivational morphology).
( - compounding).
,
. :
246

o
o ( )

.
(ontologies ).
7.5
(syntactic analysis)
.
,
,
, ..
< ** **>
** ,
: , , . ,
,
, , .., .
,
. ELIZA
(Weizenbaum, 1966) , ,
.
(parsing),
.
:
,
, ,
.
(transition
networks) (augmented transition networks) ().
,

.
7.6
(grammar) .

247

. , :
1 :
2 :
, 2 , 1 ,
, , 2 :

:
,
- ,
.
(terminals)
(lexicon). , .
, , 4 ( , ,
, ), :
[]:
[]:
[]:
[]:
- (non-terminals)
:
, (.. ,
),
, (..
-, -, ),
,
.
(production rules or syntax rules) ,

, .
:

, (.. )
(.. )
,
, .
7.6.1
248
- (Definite Clause
Grammars-DCGs).
,
:
, ,
.
,
.
,
.
:
1
( | )

|
|
:
[]:
[]:
[]:
[]:
[]:
[]:
[]:
[]:
[]:
1, ,
[ ] , -
.

, .
.

.
7.6.2
1
. (parser) (parsing)
, ,
(parse tree). ,
.
- .
.
249
-
, , .
, -
.

,
, (context)
.
7.1
.
7.1
, . ,
.
.
7.6.3
(transition network)
.
, (finite state automaton-FSA),
,
.
,
. .
- , .
7.2 1.
250
7.2
: ,
.
, , .
,
. ,

.
-
.

.
,
.
,
7.3.
251
7.3
7.7
.
,
:
,
,
.
(closeness)
. :
,
.
7.7.1
(letter-based model), :
/ ,
,
.
24
, 8 9x24
, 8 , 8x23 7
, 415 .

. , .
, :
1 : , , ,
2 : , , .
.
:
252
2

!!!
,
.
7.7.2
(sound-based model), ,
, , ,
. , ,
, .
,
, . ,
.
7.8
(semantic analysis)
, .
, .

(ambiguity) .
: .. , , ,
.
:
(,,) ()
(,,)
(,,) ()
(,,)
(,,)
(,,)
(,,)
,
,
. :
.
T ,
.
7.8.1

, .
253
,
:

.
, , ,
. ,
.
, , . ,
, ) )
:
.

.
.
7.9
.

(context) , .
, ,
. :
.
:
, ,
. .
,
.
.
,
.
.
,
.
.
,
.
.
.

.
254
,
(
) , ,
, (scripts) ().
,
,
.
.
7.10

(natural language generation) , , ,
, .
:

. (text
planning) (planning).
, ,
,
.
, :
, .
.
7.11
(speech recognition),
-
.
:
13. : (spectrogram)
.
14. : (phonemes) ,
(templates) .
15. :
.
255
7.12
. ,
:
(information retrieval): , , ,
.
(document retrieval).
(information extraction).
(Data Mining).
:
.
(text categorization):
.
(automated synopsis):
, / .
.
/ (machine translation).
(part-of-speech tagging),
(parsing),
(Word Processing Applications): ,
.
/,
: .
(Wolff, 1984).
,
.
, /
. .
/
Jurafsky, D. & Martin, J. H. (2000). Speech and Language Processing. :PrenticeHall.
http://www.deepsky.com/~merovech/voynich/voynich_manchu_reference_materials/PDFs/jurafsky_
martin.pdf
Jurafsky, D. & Martin, J. H. (2009). Speech and Language Processing (2 ). : PrenticeHall.
Montague, R. (1970a). English as a formal language. B. Visentini ., (.), Linguaggi nella societa e
nella tecnica (.189224). M: Edizioni di Communita.
Montague, R. (1970b). Universal grammar. Theoria, 36, 373398.
256
Montague, R. (1973). he proper treatment of quantification in ordinary English. J. Hintikka, J. M. E.

Moravcisk P. Suppes ( .), Approaches to Natural Language (. 221242). Dordrecht: D.
Reidel.
Schank, R.C. (1969). A Conceptual Dependency Representation for a Computer-Oriented Semantics
( ), , .
Schank, R. C., & Abelson, R. P. (1977). Scripts, Plans, Goals and Understanding: An inquiry into human
knowledge structures. Hillsdale, : Erlbaum Assoc.
Thomason, R.H. (.).(1974). Formal Philosophy: Selected Papers of Richard Montague. New Haven,
: Yale University Press.
Weizenbaum, J. (1966). ELIZA - A Computer Program For the Study of Natural Language Communication
Between Man and Machine. Communications of the ACM, 9(1), 36-45.
Winograd, . (1972), Understanding Natural Language. : Academic Press.
Cognitive Psychology, 3(1), 1-191.
Wolff, S. (1984). The use of morphosemantic regularities in the medical vocabulary for automatic lexical
coding. Methods of Information in Medicine, 23,195 -203.
, ., , ., , ., , ., , . & , . (2011).
(3 ). : .

1
;
5.
6.
7.
8.
9.
10.
11.
,
,
,
,
,
,
.
1, 3, 5, 6 7.
2
;
1.
2.
3.
4.
5.
,
,
,
,
.
257
3, 4.
3
;
1.
2.
3.
4.
5.
.
.
.
.
.
3, 4.
258

(ambiguity at syntactic level),
242
(pragmatic level), 243
(ambiguity at semantic
level), 243
(ambiguity of language), 242
(fuzzy rules), 209, 211
(fuzzy sets), 209
(fuzzy logic), 210
(atoms), 77
(incremental training), 171
(finite state
automaton-FSA), 250
- (self-organizing maps),
172
(autoassociated memories),
160
(uncertainty), 206
(eam search), 61
(search algorithm), 24, 36

(Taboo Search
Algorithm), 60
(ANN training algorithm), 167
(evolutionary algorithm), 179
(inductive learning algorithm),
130
ID3 (Iterative Dichotomizer 3), 135
(Simulated Annealing
Algorithm), 60
(speech recognition), 255
(search), 24
- (*), 63
(Hill-Climbing - HC), 57
(Basic
Branch & Bound search - &), 60
(idirectional Search), 52
(Enforced
Hill Climbing EHC), 59
(exhaustive search), 38
(Iterative Deepening
Search - IDS), 51
(heuristic search), 53
(Depth-First Search - DFS), 45
(Breadth-First Search - BFS), 48
- (Best
First Search - BestFS), 55
(reproduction) , 185
(representation), 71
(knowledge representation),
74
(recurrent ANN), 160
(open world), 27
(reactive agents), 225, 226

(model-based reactive agent), 227
- (axon), 156
(greedy local search), 58
(simple reactive
agent), 227
(knowledge acquisition), 201 205
(start state input state), 27
(fuzziness), 209
(ambiguity at referential
level), 243
(ambiguity at lexical level),
243
(path depth), 39
(Knowledge Base), 108 201
(DataBase), 201
(RuleBase), 108 201
(basic problem
solution space), 123

(threshold functions), 161
(biological agents), 222
(fact), 108
(generational
replacement), 194
(generational diversity), 195
(Genetic Algorithms-GA),
178
(genetic operators), 189
(Genetic Programming),
196
(general knowledge, common sense), 73
- (General
Problem Solver - GPS), 123
(Gaussian functions), 162
(attributes), 130
(knowledge), 71
(Cognitive Science),,
14
(genes), 178
(genotype), 182
- (Definite
Clause Grammars-DCGs), 249
259
(grammar), 247
(parsing), 247
(tournament selection), 188

(conflict resolution), 113
(layer), 158
Khonen (Khonen layer), 171
(training epoch), 171
(non-hierarchical
neural network), 83
(heteroassociated
memories), 160
(heuristic search), 53
(heuristic value), 54
(heuristic), 53
(intelligent intuitive
interfaces), 20
(intelligent agents), 217
(intelligent expert system),
205
(intelligence), 69
(data), 71
(test data), 130
- (Decision Trees), 131
(dendrites), 156
(search tree), 36
(decision tree), 134
(declarative sentences), 76
(declarative knowledge), 72
(procedural knowledge), 72
(successor nodes), 39
(successor state), 27
(negotiation), 237
(crossover), 190
(two-points crossover), 191
(problem formulation), 26
(project manager), 205
/CBR (Interpretive CBR), 154
Hopfield, 174
(sound-based model), 253
(hierarchical semantic
network), 81
(viruses), 223
(closeness), 252
(domain-specific knowledge), 73
(domain expert), 204
(Elitism), 195
- (Expert System - ES), 200
-
(Rule-Based Expert System-RBES), 201
(active rules), 95
(activator), 226
(active memory), 108
(reinforcement learning), 128
- (concept map), 85
(unification), 106
(single point crossover), 190
(information entropy), 136
(Enforced Hill
Climbing EHC), 59
(exhaustive search), 38
(evolutionary learning), 128, 178
(Evolutionary Computation),
179
(evolutionary algorithms), 179
(evolutionary cycle), 179
(induction), 102, 127
(inductive learning), 127
(episodical knowledge),, 72
(natural language
processing-NLP), 242
(supervised
Inductive Learning), 130
(supervised learning), 128
- (human-computer
interaction), 242
(selective pressure), 195
(ill formed sentences),

246
(well formed sentences),
246
(well-formed formulas), 77
78
(rule), 94
(Delta rule), 168
(learning rule), 168
(productive rule), 95
(production
rule), 111
(inference rule), 109
(deductive rule), 95
(syntax rule), 248
(classification rule), 132
ebb (Hebbian rule), 168
(canonical genetic
algorithm), 182
(natural language
understanding-NLU), 242
(problem state), 25
- (goal state), 27
(predicates), 78
(predicate calculus), 77
(first-order
predicate calculus), 78
(classes), 132
(expert system shell,
203
260
(information gain), 138

(mobile agents), 233
(closed set), 40
(closed world), 27
(problem world), 26
(path cost), 39
(hidden layers), 158
(cell body), 156
(mind map), 86
(goal), 27
(uniform crossover), 191
(uniform mutation), 193
(ontology), 96
(ontologies ), 247
(feed backward), 159
(rational agents), 223
, 26
(search queue fringe), 36
(lexicon), 248
(logical connectives), 78
(software agents), 222
(problem solution), 34, 35
(deduction), 104
(natural language
generation), 255
(production memory), 111 201
(parent node), 39
(Ambient Intelligence-Aml),
20
(frames), 88
(information), 71
(multi-agent system), 233
(ambiguity), 253
, 254
(agents), 217
(deliberated agents), 228
(task-specific agents), 223
(internal state agents),
225, 228
- (BDI
agents), 228, 229
(goal-based agents), 228
(robotic agents robots), 222
(artificial life agents, 223
(artificial agents), 222
o (hybrid agents), 232
(entertainment agents), 223
(programmer), 205
(forward
chaining), 113
(backward
chaining), 119
(feed forward), 159
(propositional calculus), 76
(pattern), 106
(prototype resemblance), 184
(Depth-First Search DFS), 45
(Breadth-First Search BFS), 48
(rule firing), 108
(batch training), 171

(learning), 127
(inductive learning), 127
(error backpropagation), 169
(unsupervised learning), 128
(partial problem solution),
35
(goal variable), 130
(mutation), 192
scrabble lists (scrabble lists mutation), 193
, 193
(measure of belief), 207
(fringe front), 40
(defining length) , 184
- (non-terminals), 248
(knowledge engineering), 205
(Machine Learning), 127
(machine vision), 13
(knowledge engineer), 204
(inference
mechanism), 108 201
(working memory, 108 201

(long-term memory), 201
(short-term memory), 201
(units) (nodes), 158
(search path), 36
, 104
(knowledge model), 87
(production system model),
201
(letter-based model), 252
(morphological analysis), 246
(neurons),, 155
(Neural Networks, Connectionist
Networks, Parallel Distributed Processing
odels), 155
(mental patterns), 127
(mental model), 127
(robotics), 13
(robotic agents robots), 222
261
(roullete wheel selection),

185
- (Knowledge-Based
Systems - KBS), 105 200
(Deduction Systems),
107 108
(blackboard systems), 235
(Production Systems), 107 111
(autoassociative memory), 174
(planning), 255
(text planning), 255
(implication relation), 211
(schema), 88, 184
(slots), 89
(script), 92
(semantic networks), 80
(semantic analysis), 253
(semantic knowledge),, 72
(sigmoid functions), 162
(wisdom), 71
(instance), 130
Perceptron (basic Perceptron), 158
(goal), 228
(problem goal), 25
(conflict resolution
strategy), 112, 113
(knowledge elicitation), 205
(reasoning), 102
- (Case-Based
Reasoning-CBR), 149
(Analogical Reasoning), 149
(symbols), 77
(symbolic Artificial
Intelligence):, 14
(inference engine), 108 201
(inference rules), 109
(summation function), 157

(ramping function), 161
(hard limiter function), 161
(successor function), 27
(fitness function), 181
(function of path cost), 28
(error function), 130
(transfer functions), 157 161
(predictor function), 130
(sign function), 161
(goal function), 130
(membership function), 210
(utility function), 230
(functional symbols), 77
(synapse), 156
(deductive rules), 95
(cooperation), 237
(training set), 129

(training set), 130
(test set), 130
(conflict set), 112
(syntactic analysis), 247
(parse tree), 249
(syntax rules), 248
(parser), 249
(certainty factors-CF), 207
(message passing systems),

235, 236
(Rule-Based Systems/RBS), 95 105 107
(pattern matching), 106

(order) , 184
(transition operator), 27
(end user), 205
(terminals), 248
(Turing test), 12
- (Artificial Neural
Networks-ANN), 157
Backpropagation (Backpropagation ANN), 169
Khonen (Khonen ANN), 171
Perceptron, 164
- (Artificial Intelligence-AI), 12
(artificial agents), 222
(truth value), 76
(threshold value), 157
T (Interface), 201
(Explanations Facilities), 201
(blind search methods), 45
o (hybrid agents), 232

- (Computational
Intelligence-CI), 15
(computational agents), 222
(phenotype), 183
(chronological backtracking),
47
(chromosomes), 178
(search space), 35
(state space), 25, 27
262
263

τν

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

τν

Uploaded by

Copyright:

Available Formats

:

Creative Commons - 3.0.

3.4.3 ................................................................................................ 113

5.5.1 ......................................................................................................................................... 205

7.3 .................................................................................................................................................. 243

ARTIFICIAL NEURAL NETWORKS

BRANCH AND BOUND SEARCH

AGENTS WITH BELIEFS-DESIRES-INTENTIONS

BEST FIRST SEARCH

BREADTH FIRST SEARCH

DEPTH FIRST SEARCH

DEFINITE CLAUSE GRAMMARS

EINFORCED HILL CLIMBING

FOUNDATION FOR INTELLIGENT PFYSICAL AGENTS

GENERAL PROBLEM SOLVER

HILL CLIMBING SEARCH

ITERATIVE DEEPENING SEARCH

KNOWLEDGE BASED SYSTEMS

NATURAL LANGUAGE PROCESSING

NATURAL LANGUAGE UNDERSTANDING

BASIC BRANCH AND BOUND SEARCH

Turing, Father of the Modern Computer, http://www.rutherfordjournal.org/article040101.html

2 chatbot Eugene Goostman 2014 - http://www.zdnet.com/article/computerchatbot-eugene-goostman-passes-the-turing-test/

2014, , Eugene Goostman,

(artificial neural networks),

Disappearing Computer e-gadgets

(start state input state), .

(Simulated Annealing Algorithm)

, , (general knowledge, common

... ( if ... then ):

isabove(X, Z) if isabove(X, Y) and isabove(Y, Z)

(non-hierarchical neural network)

J. D. Novak (Novak & Gowin, 1984,

(scripts) R. Schank (1975)

3.1 Euler Modus Ponens

3.1 - Euler (Modus Ponens)

3.2 Euler Modus Tollens

3.2 - Euler (Modus Tollens)

if robot_at(X,Y) and object_at(X,Y)

if robot_at(X,Y) and direction(w)

if robot_at(X,Y) and direction(e)

if robot_at(X,Y) and direction(n)

if robot_at(X,Y) and direction(s)

6: avoid_obstacle_south: if robot_at(X,Y) and NY=Y-1

if robot_at(X,Y) and NX=X-1

if robot_at(X,Y) and NY=Y+1

if robot_at(X,Y) and NX=X+1

THEN " "

3.4.5 (General Problem Solver)

(features set - FS)

= 0,360,36 0,640,64 = 0,94

4.25 Perceptron or . Perceptron

Kohonen (data mining)

(steady state replacement):

(DataBase) (Working Memory)

6.2 Russel Norvig

6.4 Hayes - Roth

(computational agents) (software

(Fully Observable / Partially Observable):

(simple reactive agent)

(model-based reactive agent)

(knowledge sources), (modules)

S/SL (Syntax/Semantic Language) Cordy, Holt Wortman 1982

Buyer agent or shopping bot .