Van Harmelen F., Lifschitz V., Porter B. Handbook of Knowledge Representation
Подождите немного. Документ загружается.
992 Subject Index
domain knowledge, 782, 798
domain theory, 363
domain-specific ontology, 939
DPLL, 92
clause learning, see clause learning
iterative, 95
recursive, 92
DPLL method, 21, 24, 30
DRS, 807
Ds values, 367
durational fluent, 718, 720
durative events, 683
dynamic backtracking, 186
dynamic Bayesian network, 472
dynamic epistemic logic, 891
dynamic fluent, 718, 721
dynamic logic, 890, 899
dynamics, 605, 615
dynamics, solid object, 616
E, 63
E, 697, 698, 700
EC, 680
ecosystem modeling, 384
effect axiom, 688, 689
effect constraint, 696
effect of actions, 799
effectively propositional, 809
effectively propositional reasoning solvers, 810
effectivity function, 910
egg cracking, 700
egg-yolk calculus, 571
EL, 162, 163
elaboration tolerance, 369, 684, 689, 696, 699
electronic circuit, 700
electronic circuit example, 372
electronic payment systems, 701
electronic systems, 601
elementary set, 337
EM, 496
emotion, 700
emptiness test, 159
empty clause, 23
enabling fluent, 738
ensconcement, 334
ensconcement-generated revision function, 335
entailment, 5, 10
filtered preferential, 731
preferential, 709
entailment constraints, 574
entropy-based test selection, 444
enumeration of defaults, 249
ENVISION, 601, 614
envisioning, 364, 380
epistemic actions, 891
epistemic disjunction, 287
epistemic entrenchment, 325
epistemic logic, 60, 891
epistemic state, 343
epistemic status, 257
epistemic value, 325
epistemological characteristics, 709
epistemology, 621
EPR solvers, 810
equality axioms, 37
equational system, 43
equivalence, 5, 10, 141
equivalence of EC and DEC, 683
E-RES, 699, 700
E-unification algorithm, 54
evaluation, 617
event, 601, 671
event calculus, 671, 810
event calculus answer set programming, 699
event calculus applications, 700
event calculus planner, 699
event calculus reasoning, 681, 699
event calculus versions, 672
event effect, 688
event occurrence, 674
event token, 674
event type, 674
event with duration, 683
exceptions, 63
execution as model building, 905
execution monitoring, 881
execution tree, 845, 852
existential graph (EG), 213, 215, 216, 218, 223,
236
existential restriction, 136, 140
exogenous actions, 872
expansion
stable, 256
strongly grounded, 274
expectation maximization, 496
experiential knowledge, 395
expert system, 66, 395, 929
explanation, 61
explanation closure, 710, 712
explicit beliefs, 330
explicit definition, 5, 13, 14
exploiting structure, 64
expressiveness/tractability tradeoff, 367
extended rewriting system, 51
extension, 140
def
ault logic, 243
existence of, 252
extensional, 561, 890
extensions of rewrite rules, 52
extra-logical factors, 323
extraneous event, 684
extraneous event effects, 685
Subject Index 993
FaCT, 139, 147, 166
FaCT++, 147, 168
factoring, 31
failure-modes-and-effects analysis, 401, 456
faithful assignment, 351
falling object example, 692
fat-tailed distribution, 113
fault detectability, 446
fault detection, 398, 409
fault diagnosis and isolation, 438
fault identification, 399, 415
fault localization, 399, 410
fault model, 413
FDIV bug, 60
feature, 713, 725
features and fluents, 686, 709
field ontologies, 374
filtering, 686
finite domain propositional logic, 762
finite-size scaling, 111
finite symbolic value systems, 366
finitely controllable theories, 22
first-order logic, 67, 685, 700
first-order meta-language, 890
first principles, 395
fixed point, 244, 252
fixed-point logic, 241
Fixedpoint Axiom for common knowledge, 631
fixed slot allocation schema, 787
FL
0
, 162, 163
flattening of terms, 52
fluent, 599, 649, 671, 713, 714, 870
durational, 718, 720
dynamic, 718, 721
enabling, 738
persistent, 718, 720
fluent dependency constraint, see dependency
constraint statement
FMEA, 401, 456
folk psychology, 888
forest model, 147
forgetting, 874
formal verification, 60
formula
control, 747, 751
TAL, see L(ND)
forward checking, 185
foundational approach, 330
foundational ontology, 939
frame axiom, 653
FrameNet, 814
frame of reference, 566
frame problem, 69, 70, 72, 240, 303, 653, 684,
710, 715, 759
frames, 138
free-fall motion, 692
free variable, 8
free variables in a clause, 28
FROB, 607, 614
full invariance property, 38, 49
full meet contraction function, 324
full mereogeometry, 570
full observability, 845, 847, 850
full set, 247, 259
function constant, 8
function variable, 16
functional fluent, 649
fusion operator, 559
fuzzy qualitative values, 367
G
+
DE, 435
GALEN ontology, 168
game theory, 888, 910
GARP, 367
GCI, 140
GDE, 410
GDE
+
, 414, 418
Gelernter’s geometry prover, 37
Gene Ontology, 165
general diagnosis engine, 410
Generalization Rule for common knowledge,
630
Generalization Rule for knowledge, 627
generalized diagnosis engine, 435
generalized quantifier, 234
generating defaults, 244, 247
generative Bayesian network, 494
genericity of models, 406
geographic information systems, 383
geometry, 569
goal, 700
goal narrative, 748
goal-sensitivity of a prover, 37
Golog, 877
Golog language, 906
gradual change, 692
granularity of models, 407
ground, 28
ground reducibility, 57
ground resolution, 24
grounded model, 266
grounded semantics, 904
groundedness, 243, 247
Halo, 617
HAMMR, 59
Handbook of Automated Reasoning, 22
HAPPS, 66
hardware bug, 60
hardware description languages, 60
hardware verification, 59, 60
Harper Identity, 322
heat flow example, 373
994 Subject Index
heavy-tailed distribution, 113
Herbrand interpretation, 28
Herbrand’s theorem, 29
heterogeneous distance system, 568
heuristic
value ordering, 186
variable ordering, 186
hierarchical event, 683
hierarchical model, 421
high-level programming, 877
high-level robotic control, 869
high-level specifications, 489
High-Performance Knowledge Bases, 62
higher-order concepts, 63
higher-order logic, 60, 218, 235
Hintikka set, 160
history, 614
hitting set, 412
HOL prover, 22, 56
Holds, 728
homogeneous distance system, 568
Horn clauses, 36, 65, 66, 189
Horn form, 66
HPKB, 62, 65
HTTP, 827
human intervention, 58
humanoid robot, 701
hybrid model, 431
hybrid temporal logic, see temporal logic, hy-
brid
hyper-resolution strategy, 35
Hypertext Transfer Protocol, 827
Hypothesis-Text, 806
hypothetical action, 671
I
+
, 371
I
−
, 371
ideal reasoner, 318
idealization, 599
ideally rational agent, 254
IMPACT system, 905
implementability, 902
implication graph, 97
implied action preconditions, 768
incision function, 332
incomplete search strategy, 66
indefinite location, 572
Independence postulate, 346
indexical, 234
indirect effects, 694, 699, 711, 735, 799
chains, 711, 737
indirect influences, 375
induction, 70
Induction Rule for common knowledge, 631
inductionless induction, 57
inductive epistemic entrenchment, 337
inductive logic programming, 70
industrial application, 458
inertia, 69, 799
inertia assumption, 715, 719
using a nochange axiom, 721
inference, 195
inference engine, 798
inference relation, 267
inference rule, 6, 14
infinite domains, 573
infinite loop, 672, 699
influence, 435, 601
information attitudes, 889
Information extraction based approach, 782
information extraction systems, 810
inheritance networks, 276
initial state
in TAL, 723
in TALplanner, 751
input clause, 33
input resolution, 36
instance, 29, 140
with respect to KB, 142
instance-based methods, 29
integer time, 674, 679, 681, 683, 692, 698
integrity constraints, 349
Intel, 60
intelligent tutoring systems, 386
intention filter, 894
intention logic, 891, 893
intention side effects, 894
intentional system, 888
intentions, 803, 896
interaction laws, 745
inter-modal consistency, 899
Interoperable Knowledge Language (IKL), 223,
231–233, 235
interpretation, 4, 9, 140
intersection, 899
interval algebra, 191, 200, see temporal struc-
tures, intervals
interval arithmetic, 368
interval calculus, 551
interval temporal logics, see temporal logic, in-
terval
intervention, 497
intrusive testing, 444
intuitionistic encoding, 574
inverse method of theorem proving, 19
invocation condition, 897
IRMA system, 897
irrelevance of syntax postulate, 320
Isabelle, 22, 60
ISP, 60
iterated revision, 340
Subject Index 995
joint consistency of extensions, 252
jointly exhaustive and pairwise disjoint (JEPD),
556
jointree, 476
justification, 243
Karlsruhe Interactive Verificer, 60
KARO logic, 891, 899
K-consequence, 259
k-consistency, 577
kernel contraction, 331
kernel diagnosis, 415, 419
KIDS, 59, 61
kinematics, 382, 603, 615
KIV, 60
K
L-ONE, 138
knowledge, 872
and time, 635–637
Knowledge Axiom, 627
knowledge base, 141
knowledge-based programs, 639–643
knowledge-based system, 929
knowledge compilation, 483
knowledge elicitation, 941
knowledge engineering, 929
Knowledge Interchange Format (KIF), 217
knowledge level, 929
knowledge pre-conditions, 891
knowledge producing actions, 891
knowledge role, 934
Konolige’s translation, 273
K-R
EP, 138
Kripke model, 254
Kripke structure, 623, 890
K
RIS, 139
Kruskal’s tree theorem, 39, 49
K
RYPTON, 136, 138
L(FL), 710, 728
foundational axioms Γ
fnd
, 732
predicates, 728
temporal structure axioms Γ
time
, 732
L(ND), 710, 715, 725
ˆ= , 715, 721, 725, 726
action occurrence statement, 723, 727,
728, 731
action term, 725
action type specification, 718, 721, 727,
728
application formula, 727
balanced change formula, 727
change formula, 726
constant, 725
dependency constraint statement, 715,
718, 727
domain constraint statement, 715, 718,
721, 727
elementary fluent formula, 721, 726
fixed fluent formula, 721, 726, 728
fluent change formula (C
T
), 726
fluent formula, 721, 726
fluent term, 725
interval reassignment formula (I ), 722,
726
isvalue expression, 726
observation statement, 715, 723, 727
occlusion formula (X), 722, 726
occurrence formula, 727
persistence formula, 727
persistence statement, 718, 719, 727, 731
reassignment, 722
reassignment formula (R), 722, 726
sorts, 725
statements, 727
static formula, 726
temporal formula, 726
temporal term, 725
timed formula, 726
translation to L(FL), 728
value, 725
value domain, 713
boolean, 719, 725
value formula, 726
value term, 725
variable, 725
vocabulary, 718
L(SD), 710
Lagrangian methods, 107
lambda calculus, 784
landmark introduction, 368
landmark values, 368
laws of interaction, 745
lazy unfolding, 150
LCC QA system, 790
LCC-style Logic Forms, 786
learning actions, 892
learning Bayesian networks, 493
learning scheme, 99
1UIP, 100
2UIP, 100
decision, 99
FirstNewCut, 100
FirstUIP, 100
nondeterministic, 99
non-redundant, 104
left logical equivalence, 270
legislation, 701
Levi Identity, 322
lexicographic path ordering, 40, 48
light example, 673, 675, 677, 681, 682, 694, 698
Limit Assumption, 328
limit hypotheses, 380
limit points, 367
996 Subject Index
linear belief base revision functions, 334
linear Horn, 191
linear programming, 188
Linear Temporal Logic, see Temporal logic, lin-
ear
linear time, 671
linear time structures, 714
lines, 554
Link Grammar, 804
liquids, 608, 614
literal, 23
literals of resolution, 31
Livingstone, 431
LLF, 786, 794
local confluence, 47
local consistency, 577
local search, 107, 187
Logic-Based Subsumption Architecture, 62
Logic Form based approach, 782
logic forms in information extraction, 783
logic program, 70
logic programming, 65, 197, 198, 687, 699
constraint logic programming, 197
logical omniscience, 643
logically omniscient, 318
logically valid formula, 10
logicism, 67
L
OOM, 138
loop formulas, 297
looping automaton, 158
MABLE system, 908
machine learning, 70
maintaining arc consistency, 185
manipulation, 607
many-sorted logic, 700
map graphs, 581
Markov Chain Monte Carlo, see MCMC
matings method of theorem proving, 20
maxichoice contraction, 325
maximal tractable subset, 578
MCMC, 121
M constraint, 370
measurement proposal, 399, 438
memoryless plan, 846
mental models, 387
mental states, 888
mereogeometry, 570
mereology, 557
mereotopology, 555, 558
message understanding conferences, 810
message understanding system, 61
meta-language, 890
metalanguage, 215, 217, 230, 232, 233, 237
MetateM system, 905
metonymy, 62
metric diagram, 382
microworld, 615
minimal conflict, 411
minimal diagnosis, 415
minimal extensional mereology, 557
minimal-model change frameworks, 376
minimizing belief sets, 255
minimum description length, 497
MiniWordnet, 808
(ML)
2
, 935
modal consequence, 254
modal encoding, 574
modal-free, 253
modal logic, 253, 890
nonmonotonic, 773
modal theory, 253
mode assignment, 408
mode change, 427
model, 5, 10, 398
model building, 905
model checking, 908
bounded, 89
unbounded, 117
model coherence, 377
model compilation, 420
model composition, 406
model constraints, 574
Model counter, 121
c2d, 120
Cachet, 120
MBound, 121
Relsat, 120
model counting, 120, 483
model elimination method, 36
model elimination strategy, 20
model evolution method, 29
model formulation, 363, 376
model formulation, polynomial time algorithm,
378
model formulation algorithms, 378
model fragments, 363, 376
model hypothesis, 439
model library, 396, 404, 409, 459
model preference logic, 241
model theory, 217, 236
Common Logic, 217, 218, 222
conceptual graph, 217
existential graph, 217
IKL, 233
NGM, 233
RDF(S) and OWL, 222, 235
Z specification notation, 222
model-based problem solving, 395, 402
model-based reasoning, 395, 403
model-based system, 395
Model-It, 385
modeling, 403
Subject Index 997
modeling assumptions, 377
modeling methodology, 459
modular structure, 64
Modular-E, 699
modularity, 699
modules, 64
Modus Ponens, 626
monotony, 268
most general unifier, 30
motion planning, 61
multiple contraction, 336
multiple extension problem, 69
multiple models, 611
multiple revision, 336
multiset, 38
Munich Rent Advisor, 66
naive geography, 553
naive physics, 71, 614
named-entity tagging, 789
narrative, 671, 709
goal, 748
language, see L(ND)
partitions, 716
plan, 748
narrative background specification, 716, 718
narrative comprehension, 701
narrative specification, 716, 723
narrative statement, 716
NASA, 59
natural deduction, 6, 14, 227, 229
natural language processing, 73
natural language semantics, role of qualitative
modeling, 387
natural language understanding, 700
near-propositional, 809
negation as failure, 66, 287, 687
negation normal form, 147
negative clause, 35
negative introspection, 254
Negative Introspection Axiom, 627
negative literal, 35
nested graph model (NGM), 233
Newman’s lemma, 47
NEWTON, 607, 608, 614
nicely ordered partition, 337
nochange axiom, 721
nogood, 186
no-good, 97
noisy sensors, 872
nominal, 143, 155
nondeterminism, 693
nondeterministic actions, 768
nondeterministic effects, 693
nonmonotonic inference relation, 267
nonmonotonic reasoning, 69, 239, 353
nonmonotonic spatial logics, 572
non-prioritized belief revision, 346
NORA, 59
normal default theory, 249
normal form in rewriting, 47
normative attitudes, 889
NP-complete, 89, 91
NqTHM, 20, 57, 60
number restriction, 142
Nutcracker system, 806
object constant, 8
object identity, 700
Object Semantic Representation, 793, 796
object variable, 8
obligations, 889
observation statement, 715, 723, 727
Observe, 723
Occam’s razor, 415
Occlude, 716, 724, 728
circumscription, 730
occlusion, 716
Occurs, 728
OEC, 672
Offline Robot Programming, 877
OIL, 166
Omega prover, 22
Online Robot Programming, 879
only-knowing, 276
OntoClean, 941
Ontolingua, 938
ontological characteristics, 709
ontological commitment, 941
ontologies, 62
ontology, 371, 554, 936
domain-specific, 939
foundational, 939
part–whole, 939
specification language, 937
task-specific, 940
time, 939
ontology engineering, 940
ontology language, 824
DAML+OIL, 166
OIL, 166
OWL, 166
open default theory, 243
open-w
orld knowledge, 875
open-world semantics, 831, 834
opportunity, 900
optimization, 59
optimization techniques, 150
absorption, 150
backjumping, 151
dependency directed backtracking, 151
order-consistent logic programs, 294
998 Subject Index
order of magnitude, absolute representations,
369
order of magnitude, relative representations, 369
order of magnitude calculus, 570
order of magnitude representations, 369
ordered paramodulation, 42
ordered resolution, 36
ordinal conditional function, 341
ordinal epistemic entrenchments function, 342
orientation, 566
original event calculus, 672, 699
OSHL prover, 29
OSR, 793, 796
Otter, 20, 62
overcommitment, 896
OWL, 166, 218, 222, 235, 824, 831
DL, 166, 167
Full, 166
Lite, 166, 167
OWL DLP, 834
OWL Web Ontology Language, 938
package contraction, 339
PARADOX, 62, 810
parametric design, 401
parametric structure, 479
paramodulation, 41
parity constraint, 121
parse tree, 783
part, 557
part–whole relations, 939
parthood, 557
partial meet base-generated revision functions,
334
partial meet belief base contraction function,
331
partially ordered events, 696
partitioning, 65
PASCAL, 806
path-consistency algorithm, 577
path-consistent, 577
PDE, 435
Pellet, 147, 168
PENG, 62
Pentium bug, 60
perfect information, 916
perfect recall, 634, 900, 918
permissions, 889
persistence, 69
persistence of mode, 426
persistence statement, 718, 719, 727, 731
persistent fluent, 718, 720
persistent goal, 895
P-Goal, 895
phase transition, 109
physical impossibility, 414
physical negation, 414
place vocabulary, 382
plan, 700, 842, 844
plan library, 897
plan narrative, 748
planar realizability, 581
planning, 61, 89, 117, 447, 701, 802, 841, 876
planning domain, 842, 843
planning for temporally extended goals, 850
planning goal, 842, 845
planning problem, 845
planning system, 61
planning under partial observability, 859
plateau, 108
PMON, 710
PMON-RC, 711
PMON
+
, 711
point algebra, 191, 200
polarity constraints, 580
Poole default, 250
positive clause, 35
positive conflict, 411
positive formula, 685
positive introspection, 254
Positive Introspection Axiom, 627
positive literal, 35
possibilistic logic, 276
Possibility Theory, 353
possible conflict, 421
possible-world structure, 256
possible-worlds semantics, 623
PowerAnswer, 790
poverty conjecture, 552
practical possibility, 901
practical reasoning, 897
pre-conditions, 892
precedence ordering, 39
precondition, 689
preconvex relations, 580
predicate
fixed, 263
minimized, 262
varied, 262
predicate completion, 685, 710, 731
predicate constant, 8
predicate ordering, 62
preference logic, 269
preferences, 194
preferential entailment, 709
filtered, 731
preferential extension, 271
preferential inference relation, 269, 270
preferential model, 269
preferred diagnosis, 416
prenex form, 117
prerequisite, 243
prerequisite-free default, 250
Subject Index 999
primary object, 566
prime implicant, 412
primitive concept, 141, 163
primitive fluents, 696
principle of minimal change, 318
priority consistency condition, 334
pro-attitudes, 889
probabilistic beliefs, 469
probabilistic independence, 470
probe section, 445
probing, 444
problem-solving method, 930
assessment, 933
propose-and-revise, 930
procedural attachment, 234
Procedural Reasoning System, 897
process, 601
process diagnosis engine, 435
process ontology, 373
process-oriented diagnosis, 434
process-oriented modeling, 433
process-oriented therapy, 453, 454
Processable English, 62
program analysis, 59
program verification, 59
programming-based representations, 491
programming language, 903
Progression, 873
Projection, 873
Prolog, 61, 65, 672, 699, 897
Prolog technology theorem prover, 20
proof checker, 59
proof complexity, 100
proof system, 100
CL, see clause learning proofs
cutting planes, 105
natural, 103
proper, 103
refinement, 103
RES, see resolution
resolution, see resolution
propagation-based predictor, 420
proper knowledge bases, 875
property, 671
property And, 268
property Or, 268
proposition, 217, 227, 230–232
Propositional Axiom, 626
propositional connectives, 4
propositional formula, 4, 91
propositional proof complexity, see proof com-
plexity
Protégé, 168
PROTEIN, 59
protocols, 60
Prover9, 20
PRS, 897
pseudo-Boolean, 105
pseudo-Boolean solver
Galena, 105
pbChaff, 105
PBS, 105
PSPACE-complete, 89, 118
PTTP, 59, 61
pure literal, 93
PVS, 60
QA system, 779
QA3, 61
QBF, 117, 153
QBF solver
Decide, 118
Duaffle, 119
Evaluate, 118
QBDD, 118
QMRES, 118
QRSat, 118
Quaffle, 118
Quantor, 118
QuBE, 118
Semprop, 118
sKizzo, 118
WalkQSAT, 118
qc-space, 616
QP, 602, 614
q-resolution, 118
QSIM, 367, 614
QSR, 793, 794
qualification, 689
strong, 740
weak, 740
qualification problem, 660, 689, 711, 715, 737
qualified number restriction, 143
qualitative boundary description, 569
qualitative derivatives, 371
qualitative differential equations, 371
qualitative mathematics, 365
qualitative model, 407
qualitative modeling, 361
for decision support, 384
for education, 385
for
virtual reality, 386
qualitative orientation representations, 382
qualitative physics, 361
qualitative process theory, 373
qualitative proportionality, 370
qualitative proportionality, causal interpretation,
375
qualitative reasoning, 597
qualitative representations, 551
qualitative shape representations, 382
qualitative simulation, 364
1000 Subject Index
qualitative simulation, completeness and cor-
rectness of, 381
qualitative simulation, finiteness, 379
qualitative spatial reasoning, 381, 551
qualitative spatial representation, 551
qualitative state, 364
qualitative states, relation to classical state
spaces, 379
Quantified Boolean formula, see QBF
quantifier elimination, 710, 712
quantity space, 367
quasi-ordering, 49
Quasi-Semantic Representation, 793, 794
quasi-statics, 607, 610
question answering system, 61, 779
R
ACE , 139
R
ACER, 147, 166, 168
ramification, 694
ramification problem, 657, 694, 711, 715, 735,
759
relation to qualification problem, 742
Ramsey Test, 319
random 2-SAT, 111
random 3-SAT, 109
random k-SAT, 109
randomization, 187
randomization and restarts, 95, 115
ranked knowledge bases, 276
ranked order, 270
rapid restarts, 115
rational agent, 888
rational balance, 893
rational choice, 893
rational closure, 271
rational extension, 271
rational inference relation, 270
rational monotony, 270
rationality, 901
rationality principle, 289
RCC, 564
RCC8, 381
RDF, 166, 218, 222, 235, 823
RDF Schema, 824
reachability, 16
Reactive Modules language, 913
realizability, 581, 903
realizing (an ABox), 137
reasoning about action, 353
reasoning about action and change, 671, 709
correctness, 709
epistemological characteristics,709
ontological characteristics, 709
reasoning about intentions, 803
Recognizing Textual Entailment, 806
reconfiguration, 402, 447
recovery , 402
recovery postulate, 321
recursive path ordering, 48
red and green light example, 677
redex, 45
reducible, 45
reference object, 566
refinement method, 580
refinements of resolution, 33
reflexivity, 268
refutation, 24
Region Based Geometry, 570
Region Connection Calculus (RCC), 564
regression, 664, 873
regular plan, 850
regular region, 555
reification, 13
Reiter’s foundational axioms, 661
relation, 556
relational Bayesian networks, 492
relational fluents, 649
relationally screened revision, 347
relationship of EC and DEC, 682, 683
relationship of event calculus and situation cal-
culus, 684
relationship of event calculus a nd temporal ac-
tion logics, 684
relaxation, 188
relaxed answering, 780
release from commonsense law of inertia, 676
Relevance Principle, 362
remedial action, 402, 448
remedy, 446, 449
repair, 402
replacement of components, 447
replacement property, 38, 49
representation result, 320, 326
ResearchCyc, 63
resolution, 19, 101, 197
general, 101
regular, 101, 103
symmetric, 106
tree-like, 101
resolution based approach, 155
resolution proof, 24, 32
resolution refutation, 32
resolution theorem proving, 61, 70
resolvent, 24, 31
Resource Description Framework, 823
restarts, 187
restriction
existential, 136, 140
number, 142, 154
qualified number, 143
value, 136, 140
rewrite relation, 44
right weakening, 268
Subject Index 1001
rippling, 57
Robbins problem, 20, 21, 43
robot control, 62
robot motion planning, 61
robotic navigation, 553, 583
robotics, 61
role
inverse, 143, 155
name, 140
sub-, 143
transitive, 143, 154
rolling a die example, 693
rough location, 572
RTE, 806
rules of inference
Frege’s, 214, 227, 228
Gentzen’s, 227, 229, 230, 235
Peirce’s, 217, 226, 227, 229, 230
rules with exceptions, 240
run, 158
runs and systems model, 633–635
Russian Airplane Hijack Scenario, 716–718
S4 Axioms, 628
S5, 891, 899
S5 Axioms, 628
safe contraction, 331
SAT, see Boolean satisfiability problem
SAT solver, 89, 574, 700
BerkMin, 94
complete, 92
Grasp, 95
GSAT, 107
incomplete, 107
Jerusat, 94, 95
MiniSat, 94, 95
Relsat, 99
RSat, 94
Sato, 94
sEqSatz, 106
SymChaff, 106
UnitWalk, 109
Walksat, 108
zChaff, 94
satisfaction, 5, 10
satisfiability, see SAT, 141
in ALC, 161
satisfiability modulo theories, 55
satisfiability solver, see SAT solver
satisfiable formula, 5, 10
satisfying assignment, 91
SBP, see symmetry breaking predicate
scenario, 709
scenario descriptions, 363
Schaefer’s dichotomy theorem, 189
scheduling, 202
screened revision, 346
search
backjumping, 186
branch and bound, 195
branching strategy, 185
conflict-directed backjumping, 186
dependency-directed backtracking, 186
depth-first, 184
dynamic backtracking, 186
forward checking, 185
local, 187
maintaining arc consistency, 185
randomization and restarts, 187
search for diagnoses, 420
search operator, 880
search strategy, 66
SEC, 674
second-order logic, 685
selection functions, 323
self-explanatory simulators, 386
semantic attachment, 725, 750
semantic networks, 138, 213
semantic relations, 788
semantic representation, 793
semantic resolution strategy, 35
semantic tableau method, 36
Semantic Web, 62, 222, 223, 235, 823
semi-monotonicity, 250, 252
semi-revision, 348
sensing actions, 871
sensitivity analysis, 489
sentence, 9
sentence contraction, 339
sentence-reducible, 338
sentence revision, 336
sequence-constraint, 424
sequential plan, 857
sequent, 6
set contraction, 339
set of clauses, 28
set of support strategy, 35
Setheo, 59
S-expansion, 258
Shakey, 61
shallow knowledge, 395
shape, 569
SHERLOCK, 417
SHIN , 167
SHIQ, 167
SHOIN , 167
side effects, 711, 735
chains, 711, 737
sign algebra, 366
sign calculus, 601
signature,4,8
simplification ordering, 39
simplified event calculus, 674