Copyright © 2007 by Gordon S. Novak Jr.
Permission is granted for individuals to make copies of these notes for personal use, or for instructors to make copies for classroom use.
Note: Many of these pages use math symbols such as: &forall &exist . Microsoft Internet Explorer will not display the math symbols, but Netscape or Firefox will.
abduction 220
abstraction spaces 122
add list 200
admissible 96
affix 266
albedo 428
algernon 253
alpha-beta search 115
anaphora 264
and node 106
and/or graph 106
answer extraction 194
antecedent 378
aphasia 410
artificial intelligence 2
ask 213
assert 213
assumption-based tms 216
atms 216
atn 292
atom 151
augmented transition network 292
average branching factor 75
axon 405
axon terminal 405
backward 143
backward search 102
bayes theorem 368
bayesian network 372
beam search 101
bidirectional search 102
bigram 270
blind search 78
bottom-up parser 290
bound 169
bounded depth-first 79
bounded depth-first search 81
brain anatomy 407
breadth-first 79
breadth-first search 86
brocas area 410
case 303
case relation 304
case theory 303
certainty factor 376
certainty factor combination 381
chaff 168
chain rule 371
chart parser 291
checkers 119
chess 118
chomsky hierarchy 283
clause 174
clos 244
closed 87
closed world assumption 217
cnf 161
combinatoric explosion 75
complete 184
compositional semantics 325
conceptual island 401
conditional probability 368
conflict resolution 365
conjunction 151
conjunctive normal form 161, 174
consistent 152
context free 285
context sensitive 286
context-free 273
convolution 422
counterexamples 110
credit assignment problem 119
criticality number 205
cwa 217
cycl 253
davis-putnam 168
de morgans laws 153
decision tree 389
deduction 220
deduction theorem 162
deep case 303
default 231
definite determiner 311
delete list 200
dendral 132
dendrite 405
depth bound 81
depth-first search 80
determiner 311
diameter 75
difference 120
differences 120
disambiguation 307
disjunction 151
effective branching factor 98
evaluation function 91
evolution 123
facet 231
feature detection 423
finite automaton 284
fire 361
first-order logic 169
fluent 250
fmri scan 411
forward 143
frame axiom 199
frame problem 196
free 169
game tree 112
genetic algorithms 123
gps 120
grammar notation 280
grammatical ambiguity 263, 277
ground literal 154
herbrand base 176
herbrand universe 176
herbrands theorem 176
heuristic dendral 132
heuristic function 92
heuristic search 92
hidden markov 271
hierarchical planning 204
high-pass filter 421
hill climbing 85
homograph 277
horizon effect 118
hough transform 424
ida* 100
if-added 231
if-needed 231
if-removed 231
implication 151
inconsistent 152
indefinite determiner 311
induction 220
information theory 260
inherit 231
inheritance 241
instance 241
instantiate 202
interpretation 152
invalid 152
isaac 343
isomorphism 140
iterative deepening 82
iterative-deepening 100
joint probability distribution 370
jtms 214
justification-based tms 214
kif 253
kl-one 253
kleene closure 280
klone 253
knowledge base 142
knowledge representation 138
knowledge retrieval 138
knowledge source 404
knowledge-based strategy 352
lambert cosine law 428
lambertian 428
language generation 274
lexical ambiguity 263, 277, 301
lexical features 268
lexicon 267
line detection 413
linear planning 204
linear resolution 186
local maximum 85
logical consequence 162
ma* 101
machine translation 342
machine vision 418
matching problem 146
max 112
mental rotation 416
message 242
meta-dendral 135
metonymy 264
min 112
minimax 114
model 152
model checking 154
modus ponens 153
monotone 98
monotonic logic 219
morphological analyzer 266
morphology 266
motion vision 430
multiple inheritance 235
n-gram 270
natural deduction 190
natural language 257
negation 151
neuron 405
non-monotonic logic 219
non-terminal 273
nonlinear planning 204
nonterminal symbol 281
object 241
ontology 252
oop 241
open 87
open world assumption 217
operators 56
ops-5 360
or node 106
pandemonium model 360
pet scan 411
phrase structure 281
plan monitoring 206
pragmatics 262
precondition 200
predicate calculus 169
preference 308
prefix 266
prenex normal form 171
pretend its english 315
problem reduction search 104
production memory 360
production system 360
prolog 218
pronoun reference 309
property list 226
propositional database 208
propositional logic 151
propositional variable 151
ramdom restart 85
reason maintenance 213
reasoning 138
recognize-act cycle 361
recognizer 282
recognizing automaton 282
recursively enumerable 279
reference 311
referent 312
regular language 284
representation hypothesis 139
resolution 159
retract 213
retrieval 146
rhetorical relation 318
root word 266
rule 356
rule induction 391
rule subsumption 385
rule-based system 356
samuel 119
sat 168
satisfiability 168
search 53
segmentation 426
selection restriction 306, 307
semantic grammar 322
semantics 262, 264, 299, 319, 325
sensitivity analysis 388
sentence symbol 281
set of support 185
shadow 234
shape from shading 427
simula 241
simulation 140
situated action 256
situation calculus 197
skolem constant 173
skolem function 173
skolemization 173
slot 231
sma* 101
solution graph 108
solution tree 112
sombrero function 423
sound 184
specular 428
splitting 190
standard form 174
start symbol 281
state space 56
states 56
static evaluation function 113
static value 114
strips 200
sublis 179
subproblem 104
substitution 179
successor 87
suffix 266
suffix-stripping 266
sumo 254
super 232
superclass 234
synapse 405
syntactic ambiguity 301
syntax 262
table of connections 120
terminal 273
terminal symbol 281
top-down filtering 289
top-down parser 289
transposition table 116
truth table 154
two-pointer method 185
type 270
unification 180
unification algorithm 182
uniform-cost search 88
unigram 270
unit preference 186
unsatisfiable 152
valid 152
visual cortex 413
vocabulary 281
walksat 168
wernickes area 410
working memory 360
zipfs law 261