IndexPage numbers in bold refer to definitions of terms and algorithms; page numbers in italicsrefer to items in the bibliography.
≺ (before), 389• (in parsing), 800A p
−→ B (achieves), 389λ-expression, 248⇒ (implies), 205∧ (and), 205⇔ (if and only if), 205¬ (not), 204∨ (or), 2057→ (uncertain rule), 524� (determination), 694
p (always), 364♦p (eventually), 364|= (entailment), 201` (derives), 203∃ (there exists), 250∀ (for all), 249∼ (indifferent), 586� (preferred), 586u> (best prize), 593u⊥ (worst catastrophe), 593χ2 (chi squared), 663ε-ball, 669
A* decoder, 576A* search, see search, A*AAAI (American Association for
AI), 30Aarts, E. H. I., 456, 1039Aarup, M., 455, 987Abbott, L. F., 759, 998ABC computer, 14Abeille, A., 828, 1033Abelson, R. P., 24, 829, 1033ABO (Asymptotic Bounded
Optimality), 973Abramson, B., 88, 987ABSOLVER, 108abstraction, 63ABSTRIPS, 456AC-3, 146, 156AC-4, 156academy award, 458accessible, 41accusative case, 806Acero, A., 580, 1010Acharya, A., 131, 994achieves, 389
Ackley, D. H., 133, 987acoustic model, 568
in disambiguation, 821ACT, 286ACT*, 708ACTION, 69, 72action, 32, 87
decomposition (recursive), 427applicable, 378conditional, 457decomposition, 422, 423–425joint, 451monitoring, 441, 441, 442, 443primitive, 422rational, 7, 28schema, 377sensing, 431, 439, 456, 600
action-utility table, 599action-value function, 764ACTIONS, 123, 126activation, 737activation function, 737active learning, 764active sensing, 439, 440, 863active vision, 952actuator, 32, 39acyclicity, 230Ada programming language, 14ADABOOST, 666, 667, 667, 674adaline, 21Adams, J., 340adaptive control theory, 766adaptive dynamic programming,
767, 788add list (in STRIPS), 378ADD-EDGE, 801, 801, 802add-one smoothing, 835Adelson-Velsky, G. M., 187, 987adjunct, 809ADL (Action Description
Language), 379, 409admissible heuristic, see heuristic,
admissible, 386Adorf, H.-M., 456, 1012ADP (Adaptive Dynamic
Programming), 767Advice Taker, 19, 23
agent, 4, 32, 54active, 771architecture, 27, 970–972autonomous, 197circuit-based, 227–232components, 968–970continuous planning, 445decision-theoretic, 466, 584,
629–631function, 33, 33, 615goal-based, 49–50, 54, 55greedy, 771intelligent, 28, 962, 968knowledge-based, 13, 194–197,
240, 968learning, 51–54, 56limited rational, 343logical, 195, 225–232, 268model-based, 48, 48–49naive, 795passive, 765passive ADP, 788passive learning, 788problem-solving, 59, 59–64program, 33, 44, 44, 54rational, 4, 4–5, 32, 34, 34–36,
55, 607, 968reflex, 46, 46–48, 54, 615replanning, 455software, 40taxi-driving, 53, 971utility-based, 51, 54, 629vacuum, 35, 57–58wumpus, 198, 258, 462, 863
aggregation, 420Agmon, S., 757, 987Agre, P. E., 458, 987agreement (in a sentence), 806Aho, A. V., 828, 983, 987AI, see artificial intelligenceAI Winter, 24aircraft carrier scheduling, 458airport siting, 593, 597airport, driving to, 462AISB (Society for Artificial
Intelligence andSimulation of Behaviour),
1045
1046 Index
30Ait-Kaci, H., 313, 987Aizerman, M., 759, 987al-Khowarazmi, 8albedo, 868Alberti, L. B., 895Albus, J. S., 786, 987Aldiss, B., 964Aldous, D., 132, 987Alexandria, 15algorithm, 8algorithmic complexity, see
Kolmogorov complexityAlhazen, 895ALICE, 948ALIGN, 891, 892alignment method, 891, 890–892ALisp, 935Allais, M., 592, 987Allen, B., 455, 1003Allen, J. F., 365, 412, 830, 987Allen, W., 574Almanac Game, 609Almuallim, H., 709, 987Almulla, M., 131, 1027ALPAC., 860, 987Alperin Resnick, L., 353, 367, 992alpha–beta, see search, alpha–betaalpha–beta pruning, 167, 191ALPHA-BETA-SEARCH, 170, 173Alshawi, H., 828, 987Alterman, R., 456, 987altruism, 465Alvey report, 24ALVINN, 27AM, 710Amarel, S., 88, 90, 363, 987ambiguity, 242, 347, 794,
818–821Ambros-Ingerson, J., 456, 458,
987Amit, D., 757, 987analogical reasoning, 709ANALOGY, 19, 20, 30analysis of algorithms, 977Analytical Engine, 14Anantharaman, T. S., 187, 1010Anbulagan, 235, 1018anchor text, 345AND–OR graph, 218And-Elimination, 211AND-OR-GRAPH-SEARCH, 435,
436, 437, 460AND-SEARCH, 435, 435Andersen, S. K., 529, 987
Anderson, A. R., 965, 966, 988Anderson, C. R., 411, 457, 1040Anderson, C. W., 786, 989Anderson, J. A., 30, 757, 988,
1009Anderson, J. R., 14, 286, 530,
708, 988, 1028Andre, D., 133, 787, 935, 988,
1016Anshelevich, V. A., 189, 988answer literal, 300answer set programming, 357answer sets, 357antecedent, 205Anthony, M., 675, 758, 988anytime algorithm, 971aortic coarctation, 605apparent motion, 875Appel, K., 156, 988Appelt, D., 829, 860, 1009APPEND, 119, 291, 291, 292applicable action, 378Apt, K. R., 157, 988Apte, C., 860Apte, C., 988Arbuckle, T., 186, 990arc consistency, 145architecture, 44
agent, 27blackboard, 580cognitive, 286for speech recognition, 26hybrid, 971parallel, 134real-time, 314rule-based, 286subsumption, 458
Arentoft, M. M., 455, 987Ares, M., 993ARGS, 278argument
from disability, 948–949from informality, 950–952
Aristotle, 4, 6, 7, 10, 55, 233, 267,310, 363, 366, 895, 964,965
arity, 246, 283Arkin, R., 942, 988Arlazarov, V. L., 187, 987Armstrong, D. M., 965, 988Arnauld, A., 7, 584, 607, 988Arora, S., 88, 988ARPAbet, 569artificial
flight, 3
insemination, 953sweeteners, 953urea, 953
artificial intelligence, 1, 1–975applications, 27–28conferences, 30definition, 1foundations, 5–16, 776future of, 974–975goals of, 972–974history, 16–27journals, 30philosophy of, 947–967possibility of, 947–952programming language, 18as rational agent design, 5real-time, 971societies, 30strong, 947subfields, 1as universal field, 1weak, 947
Asada, M., 940, 1014asbestos removal, 593Ashby, W. R., 757, 988Asimov, I., 939, 964, 988ASK, 195, 196, 269, 278, 690, 796assertion (logical), 253assignment (in a CSP), 137associative memory, 758assumption, 362Astrom, K. J., 645, 988astronomer, 534asymptotic analysis, 978, 977–978Atanasoff, J., 14Atkeson, C. G., 786, 1023Atkin, L. R., 89, 1035ATMS, see truth maintenance
system, assumption-basedatomic event, 468, 468atomic sentence, see sentence,
atomicatoms (in logic), 248Audi, R., 966, 988augmentation, 806, 827augmented finite state machine,
932AURA, 309, 314Austin, G. A., 674, 993Austin, J. L., 827, 988Australia, 138, 144, 152, 376AUTOCLASS, 756automata, 961, 965automated debugging, 709
Index 1047
automated reasoners, see theoremprovers
automatic pilot, 314automatic sensing, 439automobile insurance, 592Auton, L. D., 235, 997autonomous underwater vehicle
(AUV), 901autonomous vehicle, 27autonomy, 37, 376auxiliary variable (in a CSP), 140average reward, 618averaging over clairvoyancy, 179Axelrod, R., 645, 988axiom, 255
STRIPS, 411action exclusion, 404decomposability, 587domain-specific, 322effect, 330frame, 331, 333Kolmogorov’s, 471of Chinese room, 959of number theory, 256of probability, 471–474, 981of set theory, 257of utility, 587, 588Peano, 256, 267, 283possibility, 330precondition, 404situation calculus, 330successor-state, 236, 332, 365,
403unique action, 333unique names, 333usable (in OTTER), 306wumpus world, 258
axon, 11
b∗ (branching factor), 106B* search, 188Babbage, C., 14, 186Bacchus, F., 143, 156, 158, 488,
531, 608, 988bachelor, 324Bachmann, P. G. H., 983, 988BACK-PROP-LEARNING, 746back-propagation, 22, 25, 745,
744–748, 755, 757backgammon, 175–177, 182, 189,
778background, 951, 952background assumptions, 874background knowledge, 299, 687backjumping, 157
backtracking, 898chronological, 148dynamic, 157intelligent, 148–150
backtracking search, 76BACKTRACKING-SEARCH, 142,
142, 148, 149, 208, 221Backus, J. W., 827, 988Backus–Naur form (BNF), 792,
984backward chaining, 218, 220,
287–295, 310backward search for planning,
384–385Bacon, F., 6Baeza-Yates, R., 859, 989, 1003bag of words, 842Baird, L. C. I., 644, 1041Bajcsy, R., 896, 989Baker, C. L., 29, 989Baker, J., 580, 859, 989Balashek, S., 580, 998Baldwin, J. M., 120, 989Ball, M., 411, 1039Ballard, B. W., 189, 191, 989Baluja, S., 133, 989Bancilhon, F., 313, 989bandit problem, 772Banerji, R., 674, 686, 1023bang-bang control, 780Bar-Hillel, Y., 828, 860, 989Bar-Shalom, Y., 579, 989Barrett, A., 456, 989Barry, M., 532, 1010Bartak, R., 158, 989Bartlett, F., 13Bartlett, P., 675, 758, 787, 988,
989Barto, A. G., 134, 644, 786, 788,
989, 992, 1037Barton, G. E., 833, 989Barwise, J., 238, 989BASEBALL, 828baseline, 878Basye, K., 940, 999Bateman, J. A., 829, 989Bates, E., 830, 1001Bates, M. A., 14, 186, 1038Batman, 458bats, 458Baum, E., 117, 188, 758, 989Baum, L. E., 579, 756, 989Baxter, J., 787, 989Bayardo, R. J., 235, 990Bayerl, S., 314, 1018
Bayes’ rule, 9, 479, 479–481, 486,490, 568
Bayes, T., 479, 487, 990Bayes–Nash equilibrium, 640Bayesian classifier, 482Bayesian model merging, 840Bayesian network, 26, 492,
492–499, 536dynamic, 559, 559–568hybrid, 501inference, 504–510learning, 722–724learning hidden variables,
732–733BDD, 439Beal, D. F., 188, 990Bear, J., 860, 1009Beckert, B., 315, 990beer factory scheduling, 458Beeri, C., 157, 990beetle, dung, 37, 56beetles, 243behavior language, 934behaviorism, 13, 16, 55belief, 341–343
and desires, 584–586degree of, 474function, 525network, see Bayesian networkpropagation, 531revision, 360state, 437, 466, 541, 626update, 360
Bell Labs, 580Bell, C., 430, 455, 990Bell, D. A., 756, 995Bell, J. L., 267, 990Bell, T. C., 858, 859, 1041Bellman equation, 620Bellman update, 620Bellman, R. E., 2, 10, 88, 89, 130,
620, 644, 990Belongie, S., 758, 897, 990Belsky, M. S., 186, 990benchmarking, 977Bender, E. A., 990Bendix, P. B., 314, 1014BENINQ, 367Bennett, B., 368, 996Bennett, F. H., 133, 1016Bennett, J., 309, 314, 1007Bentham, J., 608, 990Berger, H., 11Berger, J. O., 759, 990Berlekamp, E. R., 89, 990
1048 Index
Berleur, J., 960, 990Berliner, H. J., 187–189, 990Bernardo, J. M., 721, 990Berners-Lee, T., 364, 990Bernoulli, D., 590, 607, 990Bernoulli, J., 9, 487, 610Bernstein, A., 186, 990Bernstein, P. L., 488, 648, 990Berrou, C., 531, 990Berry, C., 14Berry, D. A., 786, 990Bertele, U., 529, 990Bertoli, P., 457, 990, 991Bertsekas, D., 644, 788, 983, 991Berwick, R. C., 833, 989BESM, 186best possible prize, 593best-first search, 94, 129BEST-FIRST-SEARCH, 95beta distribution, 561, 721betting game, 474Bezzel, M., 88bias weight, 737bias, declarative, 697Bibel, W., 312, 314, 315, 991,
1018Bickford, M., 309, 1036biconditional, 205Biddulph, R., 580, 998bidirectional search, 87Bidlack, C., 940, 996Bigelow, J., 15, 1031Biggs, N. L., 156, 991bigram model, 568, 574Bilmes, J., 580, 1030binary decision diagram, 439binary resolution, 297Binder, J., 579, 756, 991, 1032binding list, 254Binford, T. O., 897, 991Binmore, K., 645, 991binocular stereopsis, 876,
876–895binomial nomenclature, 363bioinformatics, 858biological naturalism, 954biometrics, 885bipartite matching, 889Birnbaum, L., 860, 991Biro, J. I., 966, 991Birtwistle, G., 366, 991Bishop, C. M., 132, 530, 758,
759, 991Bishop, R. H., 55, 1000Bistarelli, S., 156, 991
bit (of information), 659Bitman, A. R., 187, 987Bitner, J. R., 156, 991BKG (backgammon program),
189black box, 137blackboard architecture, 580BLACKBOX, 408, 411Blake, A., 568, 579, 1011Blei, D. M., 858, 991blind search, see search,
uninformedBlinder, A. S., 648, 991Block, N., 965, 966, 991blocks world, 19, 24, 368, 381,
381–382, 445Blum, A. L., 410, 991Blumer, A., 675, 991BNF (Backus–Naur form), 792,
984BO, see bounded optimalityBobick, A., 579, 1011Bobrow, D. G., 19, 709, 860, 991Boddy, M., 457, 971, 999, 1006Boden, M. A., 233, 966, 991body, 287body (of a clause), 218boid, 453, 458Boltzmann machine, 759Bonaparte, N., 186Bonasso, R. P., 942, 1016Boneh, D., 117, 989Bonet, B., 411, 457, 991, 992Boole, G., 7, 8, 234, 267, 992Boolean
CSP, 139function, 738keyword model, 841logic, see logic, propositional,
234random variable, 467
Boolos, G. S., 315, 992boosting, 673Booth, A. D., 860, 1019Booth, T. L., 858, 992Borel, E., 645, 992Borenstein, J., 940, 941, 992Borgida, A., 353, 367, 992Boser, B., 758, 1017Boser, B. E., 675, 759, 992bottom-up parsing, 798Bottou, L., 758, 897, 1017boundary set, 683bounded optimality, 973
asymptotic (ABO), 973
bounded rationality, 973Boutilier, C., 365, 458, 644, 992Bowden, B. V., 14, 186, 1038Bower, G. H., 785, 1009Box, G. E. P., 132, 992BOXES, 780, 781Boyan, J. A., 132, 786, 992Boyen, X., 580, 992Boyer, R. S., 309, 314, 992Boyer–Moore theorem prover,
309, 314Boyle, J., 315, 1042Brachman, R. J., 353, 367, 369,
992, 1018Bradshaw, G. L., 710, 1017Bradtke, S. J., 134, 644, 786, 989,
992Brady, J. M., 579, 1025Brafman, R. I., 458, 786, 992Brahmagupta, 156brain, 16
computational power, 12damage, optimal, 748prosthesis, 956–958, 967states, 954super, 9in a vat, 955vs. computer, 12
brains cause minds, 12, 955Braitenberg, V., 942, 992branching factor, 72, 693
effective, 106, 130, 169Brandeis, L., 962Bransford, J., 833, 992Bratko, I., 131, 314, 703, 992, 993Bratman, M. E., 56, 966, 993Braverman, E., 759, 987breadth-first search, 73, 87Breese, J. S., 56, 529, 531, 532,
609, 972, 993, 1010, 1040Breiman, L., 674, 993Brelaz, D., 156, 993Brent, R. P., 132, 993Bresnan, J., 828, 993Brewka, G., 367, 993bridge (card game), 31Bridge Baron, 185Bridle, J. S., 758, 993Briggs, R., 363, 993brightness, 867Brin, S., 859, 993Brioschi, F., 529, 990Britain, 22, 24Broadbent, D. E., 13, 993Broca, P., 10
Index 1049
Brooks, M. J., 896, 1010Brooks, R. A., 55, 233, 236, 458,
932, 934, 941, 942, 993Brouwer, P. S., 786, 989Brown, J. S., 368, 710, 998, 1018Brown, M., 757, 993Brown, P. F., 854, 860, 993Brownston, L., 312, 993Brudno, A. L., 187, 993Brunelleschi, F., 895Bruner, J. S., 674, 993Brunnstein, K., 960, 990Brunot, A., 758, 897, 1017Bryant, R. E., 439, 457, 993Bryson, A. E., 22, 757, 993Buchanan, B. G., 22, 23, 56, 363,
531, 674, 686, 993, 994,1002, 1019
buffalo, 833BUGS, 530, 755BUILD, 368Bulfin, R., 646, 1030bunch, 325Bundy, A., 315, 708, 994, 1039Bunt, H. C., 366, 994Buntine, W., 709, 1024Burgard, W., 940, 994, 1003burglar alarm, 493–495Burns, C., 532, 1024Buro, M., 182, 994Burstall, R. M., 315, 364, 994Burstein, J., 949, 994Bylander, T., 387, 409, 994
C-BURIDAN, 457Cajal, S., 11calculus, 119Calera, J., 830, 994Califf, M. E., 830, 1023CALL, 291, 292Calvanese, D., 367, 994Cambefort, Y., 56, 1007Cambridge, 13Cameron-Jones, R. M., 703, 1030Campbell, M. S., 181, 187, 188,
994, 1010can machines think, 948candidate definition, 679candidate elimination, 683Canny edge detection, 753, 872,
897Canny, J., 897, 941, 994canonical distribution, 500Cantu-Paz, E., 133, 1028Capek, K., 939, 962
Carbonell, J. G., 456, 675, 708,994, 1022, 1039
Carbonell, J. R., 709, 994Cardano, G., 9, 487Carlin, J. B., 759, 1005CARMEL, 940Carnap, R., 6, 7, 472, 475, 487,
488, 531, 994Carnegie Mellon University, 17Carpenter, M., 456, 999Carrasco, R. C., 830, 994Carson, D., 314, 1042cart–pole problem, 780cascaded finite state transducers,
849case (linguistics), 806case folding, 844case statement (in condition
plans), 435case-based reasoning, 708CASSANDRA, 457Cassandra, A. R., 645, 994, 1013category, 322, 322–328Caterpillar English, 851causal influence, 497causal link, 389causal network, see Bayesian
networkcausal rules, 260causation, 207, 260, 481caveman, 687CCD (charge-coupled device),
865, 899cell decomposition, 916, 919
exact, 921cell layout, 68central limit theorem, 982cerebral cortex, 11Ceri, S., 312, 994certainty equivalent, 591certainty factor, 23, 525, 531CES, 935CFG, see grammar, context-freeCGP, 457CHAFF, 222, 224, 235chain rule, 496Chakrabarti, P. P., 131, 134, 994,
998Chambers, R. A., 780, 785, 1022Chan, W. P., 896, 994chance node (decision network),
598chance node (game tree), 177chance of winning, 171Chandra, A. K., 312, 313, 995
Chang, C.-L., 315, 995Chang, K. C., 530, 1004channel routing, 68Chapman, D., 410, 458, 987, 995charge-coupled device, 865, 899Charniak, E., 2, 24, 312, 829, 859,
861, 995, 1005chart, 800CHART-PARSE, 801, 804, 805chatbot, 948Chateau Latour, 953Chatfield, C., 579, 995Chatila, R., 940, 1024checkers, 18, 56, 181–182, 189,
192checkmate, 81Cheeseman, P., 9, 26, 157, 235,
532, 756, 940, 995, 1036Chekaluk, R., 940, 999chemistry, 23Chen, R., 579, 1019Cheng, J., 530, 756, 995Cheng, J.-F., 531, 1021Chervonenkis, A. Y., 675, 1039chess, 14, 21, 42, 89, 162,
172–173, 180–181, 186automaton, 186
CHESS 4.5, 89CHESS 4.6, 187χ2 pruning, 663Chickering, D. M., 188, 756,
1008, 1015Chien, S., 455, 1004Chierchia, G., 29, 828, 995CHILL, 826, 830chimpanzees, 790Chinese room, 958–960, 967Chinook, 182, 192choice point, 290Chomsky normal form, 840Chomsky, C., 828, 1007Chomsky, N., 13, 16, 793, 827,
830, 858, 995CHOOSE-ATTRIBUTE, 658–660CHOOSE-LITERAL, 702, 703Choset, H., 941, 995Christmas, 953chronological backtracking, 148cHUGIN, 530Chung, K. L., 488, 983, 995Church, A., 8, 275, 311, 995Church, K., 804, 828, 858, 995Churchland, P. M., 965, 995Churchland, P. S., 958, 965, 995,
996
1050 Index
CIGOL, 709Cimatti, A., 411, 457, 990, 991,
996circuit verification, 265circuit-based agent, 227circumscription, 358, 363, 367
prioritized, 359city block distance, 106Clamp, S. E., 488, 998Clark completion, 367Clark Normal Form, 355Clark, K. L., 367, 996Clark, P., 709, 996Clark, S., 940, 1000Clarke, A. C., 529, 961, 996Clarke, E., 315, 411, 996Clarke, M. R. B., 189, 996class probability, 676CLASSIC, 353, 354classical planning, 375, 430, 432classification (in description
logic), 353clause, 214Clearwater, S. H., 646, 996CLINT, 709Clinton, W. J., 885CLIPS, 312Clocksin, W. F., 314, 996closed class, 796closed world, 354–356closed-world assumption, 362,
377, 439Clowes, M. B., 882, 897, 996CLP, see logic programming,
constraintCLP(R), 313clustering, 529, 725, 726clustering (in Bayesian networks),
510, 510CMU, 27, 181, 187, 580CN2, 709CNLP, 457co-NP-complete, 210, 235, 979coarticulation, 572, 572coastal navigation, 924Cobham, A., 8, 996Cobley, P., 827, 996Cocke, J., 860, 993coercion, 431, 432, 456cognitive
architecture, 286modeling, 3–4psychology, 13science, 3, 29
Cohen, B., 235, 1034
Cohen, C., 940, 996Cohen, J., 313, 996Cohen, P. R., 26, 29, 458, 827,
996Cohen, W. W., 709, 996coherence relations, 823Cohn, A. G., 368, 996coin flip, 524, 525, 610, 659COLBERT, 942Collins, A. M., 709, 994Collins, G., 457, 1029Collins, M., 757, 996Collins, M. J., 859, 996Colmerauer, A., 267, 313, 827,
996Colombano, S. P., 133, 1019color, 868–869combinatorial explosion, 22commitment
epistemological, 244, 266ontological, 242, 464, 524
common sense, 523communication, 790–827commutativity (in search
problems), 141competition, 454, 454compilation, 292, 429complement (of a verb), 808complementary literals, 214complete data, 716completeness
of a proof procedure, 295of a proof procedure, 203, 233of resolution, 300–303of a search algorithm, 71, 87theorem, 295
COMPLETER, 802completion (of a data base), 355complex sentence, 204, 249, 266complex term, 266complexity, 977–979
sample, 670space, 71, 87time, 71, 87
complexity analysis, 74, 978compliant motion, 916component (of mixture
distribution), 725COMPOSE, 288composite decision process, 131composite object, see object,
compositecomposition (of substitutions),
288, 288compositionality, 241, 810
COMPOUND?, 278compression, 777computability, 8computational learning, 137, 668computational learning theory,
668, 672, 675, 758computational neuroscience, 737computer, 14–15
vs. brain, 12computer graphics, 864computer vision, see visionconclusion (of an implication),
205concurrent action list, 451conditional distributions, 500–504conditional effects, 433conditional Gaussian, 503conditional independence, 481,
485, 486, 490, 499–504,528, 545
conditional planning, 431–440,454, 604
conditional probability, seeprobability, conditional
conditional probability table, 494conditional steps, 433conditioning, 476conditioning case, 494Condon, J. H., 187, 996configuration space, 917confirmation theory, 6, 488conflict-directed backjumping,
149conformant planning, 431, 455,
457Congdon, C. B., 940, 996conjugate prior, 721conjunct, 205conjunct ordering, 284conjunction (logic), 205conjunctive normal form, 215,
215, 295–297connection method, 312connectionism, 25, see neural
networkconnective
logical, 16, 204, 249Connell, J., 942, 996consciousness, 10, 952, 955, 956,
957, 960consequent, 205consistency, 353, 679
condition, 130of a heuristic, 99of actions, 385
Index 1051
consistent estimation, 512consistent plan, see plan,
consistentCONSISTENT-DET?, 696, 696Console, L., 55, 1007conspiracy number, 188constant symbol, 246, 248, 266constraint
binary, 140entailment, 700graph, 138, 153nonlinear, 139ordering, 392preference, 140propagation, 145, 144–147recording, 157resource, 148special, 147unary, 140
constraint logic programming, seelogic programming
constraint satisfaction, 19problem, 137, 137–141
constructive induction, 700CONTENTS, 796context-free grammar, see
grammar, context-freecontext-sensitive grammar, see
grammar, context-sensitivecontingency problem, see
problem, contingencycontinuation, 292continuity (of preferences), 587continuous change, 337continuous planning, 431, 432,
445–449, 455, 458continuous speech, 574CONTINUOUS-POP-AGENT,
449, 449, 458contour, 874, 881–884contour (of a state space), 100contrapositive, 308control
lateral, 893longitudinal, 894
control theory, 15, 55, 132, 409,757, 780, 928
adaptive, 766, 785control uncertainty, 925controller, 55, 927convention, 452conversion to normal form,
296–297CONVINCE, 529convolution, 869, 899
Conway, J. H., 89, 990Cook, P. J., 961, 1003Cook, S. A., 9, 235, 983, 996Cooper, G., 530, 756, 997, 1035cooperation, 450–451coordinate frame, 874coordination, 451, 452–454coordination game, 635Copeland, J., 365, 966, 997Copernicus., 961, 997Core Language Engine, 828Cormen, T. H., 983, 997corpus-based, 834Cortes, C., 757, 758, 897, 997,
1017count noun, 328Cournot, A., 645, 997Covington, M. A., 830, 997Cowan, J. D., 20, 757, 997, 1041Cowell, R., 755, 1036Cox, I., 579, 940, 997Cox, R. T., 475, 487, 997CPCS, 501CPT, see conditional probability
tablecrack, 883Craig, J., 941, 997Craik, K. J., 13, 997Crawford, J. M., 235, 997creativity, 16Cremers, A. B., 940, 994Crick, F. H. C., 120, 1040Cristianini, N., 757, 759, 993, 997critic (in learning), 52critical path method, 418critical point, 224Crocker, S. D., 187, 1007Crockett, L., 365, 997Croft, W. B., 859, 1029, 1038Cross, S. E., 28, 997cross-correlation, 875cross-validation, 663, 748, 762crossover, 118crossword puzzle, 28, 42, 158Cruse, D. A., 844, 997cryptarithmetic, 140Csorba, M., 940, 1000CSP, see constraint satisfaction
problemCulberson, J., 131, 997Cullingford, R. E., 24, 829, 997cult of computationalism, 947cumulative learning, 700, 707cumulative probability density
function, 982
curiosity, 774current-best-hypothesis, 674, 680CURRENT-BEST-LEARNING,
681, 681, 682Currie, K. W., 455, 1004Cussens, J., 830, 997CUTOFF-TEST, 173Cybenko, G., 758, 997cybernetics, 15, 15CYC, 363–365cyclic solution, 436CYPRESS, 458
D’Ambrosio, B., 529, 1034d-separation, 499Dzeroski, S., 705, 709DAG, see directed acyclic graphDaganzo, C., 530, 997Dagum, P., 530, 997Dahl, O.-J., 366, 991, 997Dale, R., 829, 830, 997, 1030DALTON, 710Damerau, F., 860, 988Daniels, C. J., 134, 1020Dantzig, G. B., 132, 998, 1041DARKTHOUGHT, 188Darlington, J., 315, 994DARPA, 28, 580DART, 28Dartmouth workshop, 17Darwiche, A., 530, 532, 998Darwin, C., 120, 961, 998Dasgupta, P., 134, 998data complexity, see complexitydata mining, 26data-driven, 219Datalog, 281, 310, 312dative case, 806Daun, B., 456, 999Davidson, D., 365, 998Davies, T. R., 694, 708, 709, 998Davis, E., 364, 366, 368, 369, 998Davis, G., 456, 999Davis, K. H., 580, 998Davis, M., 221, 234, 235, 300,
311, 998Davis, R., 710, 998Davis–Putnam algorithm, 221Dawid, A., 529, 1017Dawid, P., 755, 1036Dayan, P., 759, 786, 998, 1023,
1033da Vinci, L., 6, 895DBN, see dynamic Bayesian
network
1052 Index
DCG, see grammar, definiteclause
DDN, see decision network,dynamic
de Morgan rules, 252Deacon, T. W., 25, 999Deale, M., 456, 999Dean, M. E., 309, 1026Dean, T., 455, 579, 644, 645, 940,
941, 971, 999Dearden, R., 644, 992Debevec, P., 896, 999Debreu, G., 596, 999debugging, 262Dechter, R., 130, 156–158, 529,
999decision
one-shot, 586problem, 8rational, 463, 584, 604sequential, 586, 600, 613under uncertainty, 465
decision analysis, 604decision analyst, 604decision list, 670decision maker, 604decision network, 492, 584, 597,
597–600, 607, 608, 629dynamic, 629, 644evaluation, 599
decision node, 598decision stump, 666decision theory, 9, 26, 465, 607decision tree, 608, 653, 653
expressiveness, 655pruning, 662
DECISION-LIST-LEARNING, 671,672, 672
DECISION-TREE-LEARNING,656–658, 658, 661–663,672, 676, 677, 679, 696,697, 700
declarative bias, 697declarativism, 197decomposability (of lotteries), 588decomposition (of plans), 459DeCoste, D., 757, 758, 999Dedekind, R., 267, 999deduction, see logical inferencededuction theorem, 210deductive databases, 310Deep Blue, 27, 180, 181, 188Deep Space One, 55, 407, 456Deep Thought, 181, 187Deerwester, S. C., 858, 999
default logic, 359, 363, 367default reasoning, 354–360default value, 352definite clause grammar, see
grammar, definite clausedefinite clauses, 218, 280–281definition (logical), 255deformable matching, 888degree heuristic, 144degree of belief, 464
interval-valued, 523degree of freedom, 904
controllable, 905effective, 905
degree of truth, 244DeGroot, M. H., 488, 759, 999DeJong, G., 708, 860, 999, 1000delay line, 228delete list (in STRIPS), 378deleted interpolation smoothing,
858deliberate layer, 934Dellaert, F., 940, 1003Della Pietra, S. A., 854, 860, 993Della Pietra, V. J., 854, 860, 993delta rule, 778Del Favero, B. A., 529, 1034demodulation, 304, 304, 314demodulator, 306, 318Dempster’s rule, 526Dempster, A. P., 526, 531, 579,
756, 1000Dempster–Shafer theory, 523,
525–526, 531Den (denotation), 342DENDRAL, 22, 23, 363dendrite, 11Denes, P., 580, 1000Deng, X., 133, 1000Denis, F., 830, 1000Denker, J., 758, 897, 1017Dennett, D. C., 951, 953, 966,
1000Deo, N., 89, 1000DEPTH, 69, 72, 77depth limit, 173depth of field, 866depth-first search, 75, 87DEPTH-LIMITED-SEARCH, 77,
78derivational analogy, 708derived sentences, 203DeSarkar, S. C., 134, 998Descartes, R., 6, 895, 965, 1000
descendant (in Bayesiannetworks), 499
Descotte, Y., 455, 1000description logic, 349, 353,
353–354, 362, 367descriptive theory, 592detachment, 524, 524detailed balance, 518determination, 694, 709, 710
minimal, 696deterministic environment, 41deterministic node, 500Deville, Y., 157, 1039DEVISER, 455Devroye, L., 755, 756, 1000Dewey Decimal system, 323de Bruin, A., 188, 1028de Dombal, F. T., 488, 998de Finetti, B., 474, 487, 998de Freitas, J. F. G., 568, 998de Kleer, J., 157, 312, 368, 998,
1003, 1040de Marcken, C., 830, 833, 998De Morgan, A., 267, 998De Raedt, L., 709, 830, 998, 1024de Sarkar, S. C., 131, 994de Saussure, F., 827, 999diachronic, 258diagnosis, 463
dental, 463medical, 260, 498, 525, 600,
962diagnostic rule, 259diameter (of a graph), 77Dickinson, M. H., 896, 994Dickmanns, E. D., 897, 1000dictionary, 21Dietterich, T., 675, 708, 709, 787,
987, 1000, 1034difference engine, 14differential drive, 905differential equation, 927differentiation, 690diffuse reflection, 867DiGioia, A. M., 28, 1000digit recognition, 752–754Digital Equipment Corporation
(DEC), 24, 286Dijkstra, E. W., 89, 130, 965, 1000Dill, D. L., 309, 1026Dimopoulos, Y., 411, 1014Diophantine equations, 156Diophantus, 156Diorio, C., 580, 1030Diplomacy, 166
Index 1053
directed acyclic graph (DAG),493, 529
disabilities, 967DISAMBIGUATE, 796disambiguation, 795, 815,
818–821, 827discontinuities, 870discount factor, 617, 644discourse, 821
coherent, 823–824understanding, 821–824
discrete event, see event, discretediscretization, 121, 501discrimination net, 674disjoint sets, 324disjunct, 205disjunction, 205disjunctive effects, 433disparity, 877, 878Dissanayake, G., 940, 1000distribution
beta, 721mixture, 725
divide-and-conquer, 407, 581Dix, J., 367, 993Dixon, J. K., 187, 1035Dizdarevic, S., 133, 136, 1017DLV, 367Do, M. B., 455, 1000document classification, 845document clustering, 845DOF, see degree of freedomdolphin, 10, 790DOMAIN, 146domain
element, 245in a CSP, 137in first-order logic, 245in knowledge representation,
253independence, 376of a random variable, 467
dominancestochastic, 594strict, 594
dominant strategy, 633dominant strategy equilibrium,
633domination (of heuristics), 106Domingos, P., 488, 755, 1000Donskoy, M. V., 187, 987Doran, C., 828, 1000Doran, J., 130, 131, 1000Dorf, R. C., 55, 1000Doucet, A., 580, 1000
Dow, R. J. F., 758, 1035Dowling, W. F., 235, 1000Dowty, D., 828, 1000Doyle, J., 55, 157, 367, 368, 608,
1000, 1001, 1021, 1040DPLL, 221, 222, 222, 224–226,
231, 235, 238, 239, 406DPLL-SATISFIABLE?, 222Drabble, B., 455, 1001DRAGON, 580Draper, D., 457, 1001, 1002Drebbel, C., 15Dreussi, J., 456, 1035Dreyfus, H. L., 365, 951, 972,
1001Dreyfus, S. E., 88, 89, 644, 951,
990, 1001drilling rights, 600drone, 937dropping conditions, 682Drucker, H., 1017Druzdzel, M. J., 530, 995DT-AGENT, 466du Pont, 24Du, D., 236, 1001dualism, 6, 954, 964Dubois, D., 532, 1001Dubois, O., 235, 1035duck, mechanical, 939Duda, R. O., 488, 531, 755, 759,
1001Dudek, G., 942, 1001Duffy, K., 757, 996Dumais, S. T., 532, 858, 999,
1032dung beetle, 37Dunham, B., 22, 1004DURATION, 459Durer, A., 895Durfee, E. H., 458, 1001Durrant-Whyte, H., 940, 1000,
1018Dzeroski, S., 1017Dyer, M., 24, 829, 1001DYNA, 786dynamic backtracking, see
backtracking, dynamicdynamic Bayesian network, 537,
559, 559–568, 578, 579,614, 629
dynamic decision network, seedecision network, dynamic
dynamic environment, 42dynamic programming, 131, 293,
546, 644
adaptive, 767, 767, 788nonserial, 529
dynamic stability, 906dynamic state, 904dynamic weighting, 130dynamical systems, 578dystopia, 975Dzeroski, S., 709, 830, 997, 1001,
1014
E(cat, i) (event), 337E0 (English fragment), 795Earley, J., 828, 1001earthquake, 493Eastlake, D. E., 187, 1007Ebeling, C., 187, 990, 1001EBL, see explanation-based
learningEckert, J., 14Eco, U., 827, 1001economics, 9–10, 55, 589edge (in a chart), 800edge (in a scene), 870, 882edge detection, 870–872Edinburgh, 709, 941Edmonds, D., 17Edmonds, J., 8, 1001Edwards, D. J., 187, 1008Edwards, P., 966, 1001Edwards, W., 608, 1039EEG, 11EFFECT, 433effect, 377
axioms, 330external, 423internal, 425negative, 413positive, 385primary, 423secondary, 423
effector, 901EFFECTS, 449Egedi, D., 828, 1000egomotion, 876Ehrenfeucht, A., 675, 9918-puzzle, 64, 88, 89, 91, 105, 107,
1308-queens problem, 66, 88Einstein, A., 1Eiter, T., 367, 1001EKF, see extended Kalman filterelectric motor, 906electronic circuits domain,
262–266Elfes, A., 940, 1024
1054 Index
Elhadad, M., 829, 1001ELIMINATION-ASK, 509ELIZA, 948, 961Elkan, C., 527, 755, 1001Elliot, G. L., 156, 1008Elman, J., 830, 1001EM algorithm, 542, 725, 724–733
structural, 732emergent behavior, 453, 931EMNLP, 861empiricism, 6Empson, W., 829, 1001EMPTY?, 71EMV, see expected monetary
valueEND, 801Enderton, H. B., 267, 311, 1001English, 21, 31
fragment, 795English auction, 641ENIAC, 14ensemble learning, 664–668entailment, 201
inverse, 705entailment constraint, 687, 700,
707Entscheidungsproblem, 8ENUMERATE-ALL, 506, 506ENUMERATE-JOINT, 477, 477ENUMERATION-ASK, 505, 506environment, 32, 38–44
artificial, 39class, 44competitive, 42continuous, 42cooperative, 42deterministic, 41discrete, 42dynamic, 42game-playing, 192, 789generator, 44history, 614multiagent, 42, 341, 449observable, 41one-shot, 41properties, 41semidynamic, 42sequential, 41, 41single agent, 42static, 42stochastic, 41strategic, 41taxi, 38, 39
EPAM (Elementary Perceiver AndMemorizer), 674
Ephrati, E., 458, 1016epiphenomenalism, 957episodic environment, 41epistemological commitment,
244, 244, 266epoch, 742EQP, 309equality (in logic), 253equality symbol, 253equilibrium, 633, 769equivalence (logical), 210Erdmann, M. A., 89, 1001ergodic, 517Erman, L. D., 580, 1001Ernst, G., 130, 1025Ernst, H. A., 941, 1002Ernst, M., 411, 1002Erol, K., 456, 1002error, 720
sum of squared, 720error (of a hypothesis), 669error function, 982Eskimos, 243Essig, A., 488, 1006Etchemendy, J., 238, 989ethics, 960–964Etzioni, O., 56, 457, 962, 973,
1002, 1040EU, see utility, expectedEuclid, 8, 895EURISKO, 710Europe, 24European Space Agency, 455EVAL, 171, 173evaluation function, 94, 162,
171–173accuracy, 171linear, 110
Evans, T. G., 19, 30, 1002event, 320, 335–340
calculus, 334, 334–335, 365,812
category, 370discrete, 337generalized, 335in probability, 504liquid, 337
Everett, B., 940, 992evidence, 464evidence variable, 504evolution, 31, 120, 243
machine, 22example, 651exceptions, 321exclusive or, 207, 761
execution, 60execution monitoring, 431, 431,
441–445, 455, 457executive layer, 933exhaustive decomposition, 324existential graph, 350Existential Instantiation, 273Existential Introduction, 315EXPAND, 72, 72, 77, 83, 102EXPAND-GRAPH, 399, 400expansion (of states), 69expectation–maximization, see
EMexpected monetary value, 589expected utility, see utility,
expectedexpected value (in a game tree),
177EXPECTIMINIMAX, 631expectiminimax, 177, 189
complexity of, 177expert system, 363, 604, 607, 710,
962commercial, 286decision-theoretic, 604–607first, 23first commercial, 24HPP (Heuristic Programming
Project), 23logical, 523medical, 28, 531Prolog-based, 289with uncertainty, 26
explaining away, 525explanation, 361, 691explanation-based learning, 688,
690–694, 707, 708exploration, 37, 122–129, 786exploration function, 774, 776exploration problem, 123EXTEND, 209, 222extended Kalman filter (EKF),
557, 912EXTENDER, 801, 801, 802, 803,
805extension (of a causal link), 447extension (of a concept), 679extension (of default theory), 359externalities, 641EXTRACT-SOLUTION, 399, 400,
402, 403extrinsic property, 328eyes, 863, 866, 867, 895
face detection, 887
Index 1055
fact, 218factor (in variable elimination),
507factoring, 214, 297Fagin, R., 157, 366, 990, 1002Fahlman, S. E., 20, 367, 368, 1002failure model, 562false negative, 679false positive, 680family tree, 699Farrell, R., 312, 993FASTFORWARD, 411FASTUS, 849, 860Faugeras, O., 896, 897, 1002Fearing, R. S., 941, 1002Featherstone, R., 941, 1002feature (of a state), 110feature (speech), 570feed-forward network, 738feedback loop, 525Feigenbaum, E. A., 22, 23, 29,
363, 674, 994, 1002, 1019Feinstein, M. H., 29, 1036Feldman, J., 29, 609, 1002Feldman, R., 708, 1037Fellbaum, C., 828, 1002Feller, W., 983, 1002Felner, A., 131, 1016Feng, C., 709, 1024Feng, L., 940, 992Fermat, P., 9, 487Ferraris, P., 457, 1002fertility, 855, 856FETCH, 278, 316FF (FastForward planner), 411FIFO-QUEUE, 73Fifth Generation project, 24figure of speech, 819Fikes, R. E., 55, 267, 314, 367,
409, 456, 457, 708, 940,992, 1002, 1032
FILTER, 307filtering, 360, 541, 542–544, 578,
627FIND-PURE-SYMBOL, 222FIND-TRANSFORM, 891, 892,
899FIND-UNIT-CLAUSE, 222Findlay, J. N., 364, 1002finite domain, 294finite horizon, 616finite-state machine, 793Finney, D. J., 530, 1002Firby, J., 934, 1003Firby, R. J., 455, 458, 999, 1003
FIRST, 71, 278, 288first-order logic, see logic,
first-orderfirst-order probabilistic logic,
519–522Fischer, M. J., 364, 1003Fisher, R. A., 487, 1003FITNESS-FN, 119Fix, E., 756, 1003fixation, 878fixed point, 218, 282fixed-lag smoothing, 547FIXED-LAG-SMOOTHING, 552Flannery, B. P., 132, 1029flaw (in a plan), 448floor-planning, 159fluent, 329, 339–340, 817fluent calculus, 333, 338, 365fly eyes, 876, 893FMP, see planning, fine-motionfMRI, 11FOCUS, 709focus, 867focus of expansion, 876focus spaces, 824Fogel, D. B., 133, 1003Fogel, L. J., 133, 1003FOIL, 701, 702, 703, 709, 711FOL, see logic, first-orderFOL-BC-ASK, 287, 288, 288,
290FOL-FC-ASK, 281, 282, 283,
287folk psychology, 13, 369, 966FOPC, see predicate calculusForbes, J., 786, 1003FORBIN, 455Forbus, K. D., 312, 368, 1003force sensor, 904Ford, K. M., 29, 965, 1003foreshortening, 879Forestier, J.-P., 787, 1003Forgy, C., 312, 1003formal language, 791formulate, search, execute, 60FORMULATE-GOAL, 61FORMULATE-PROBLEM, 61Forrest, S., 133, 1023Forsyth, D., 897, 1003Fortescue, M. D., 243, 1003Fortmann, T. E., 579, 989FORWARD, 553, 554forward chaining, 218, 218–220,
235, 280–287forward checking, 144–145
forward pruning, 174forward search for planning,
382–384FORWARD-BACKWARD, 546Foster, D. W., 861, 1003four-color map problem, 156, 950Fourier, J., 156, 1003Fox, D., 940, 994, 1003Fox, M. S., 411, 455, 1003Frakes, W., 859, 1003frame
axiom, 331, 333in representation, 24, 366in speech, 570problem, 331, 364, 365, 378
inferential, 331, 333–335representational, 331,
332–333Francis, S., 859, 1003Franco, J., 235, 1003Frank, M., 158, 1006Frank, R. H., 961, 1003Frankenstein, 962FREDDY, 68, 456, 941Fredkin Prize, 188free space, 918free will, 6, 955Freeman, W., 531, 1042Frege, G., 8, 234, 267, 311, 1003frequentism, 472Freuder, E. C., 157, 158, 1003,
1004, 1032Freund, Y., 674, 1004Friedberg, R. M., 22, 133, 1004Friedman, G. J., 132, 1004Friedman, J., 674, 759, 993, 1004,
1008Friedman, N., 580, 756, 992, 1004fringe, 70Fristedt, B., 786, 990FRITZ, 181Frost, D., 158, 999FRUMP, 860Fry, D. B., 580, 1004Fuchs, J. J., 455, 1004Fudenberg, D., 646, 1004FUF (generation program), 829Fukunaga, A. S., 455, 1004function, 242
total, 246function approximation, 777function approximator, 778function symbol, 246, 248, 266functional dependency, 694, 709functional programming, 314
1056 Index
functional specification theory,965
functionalism, 55, 954, 958, 965Fung, R., 530, 1004Furey, T., 757, 993Furnas, G. W., 858, 999Furst, M., 410, 991futility pruning, 181fuzzy control, 527fuzzy set, 526, 532
G-set, 684Gabor, Z. Z., 610Gaifman, H., 531, 1004gain parameter, 928gain ratio, 663, 677Gale, W. A., 858, 995Galileo, G., 1, 53, 706Gallaire, H., 312, 1004Gallier, J. H., 235, 267, 311, 1000,
1004Gallo, G., 89, 1004Gamba, A., 757, 1004Gamberini, L., 757, 1004gambling, 9, 588game, 10, 161
against nature, 434bridge, 179card, 179constant–sum, 635dice, 179inspection, 632minesweeper, 235multiplayer, 165–167of chance, 175–180Othello, 162, 182partial information, 640playing, 161–162, 186poker, 489programs, 180–183Qubic, 182repeated, 638robot (with humans), 945theory, 10, 613, 631, 631–640zero-sum, 192, 635
game show, 589Garcia, P., 830, 1026Garding, J., 896, 1004Gardner, M., 234, 1004Garey, M. R., 983, 1004Garfield, J. L., 29, 1036GARI, 455Garrett, C., 117, 989Gaschnig, J., 130, 135, 156, 157,
531, 1001, 1004
Gasquet, A., 455, 1004Gasser, R., 131, 182, 1004Gat, E., 942, 1004gate (logic), 263Gauss, C. F., 88Gauss, K. F., 156, 578, 1004Gauss–Jordan elimination, 980Gaussian distribution, 982Gaussian error model, 561Gaussian filter, 869Gawande, A., 962, 1004Gawron, J. M., 580, 1013Ge, N., 829, 1005Gee, A. H., 568, 998Geffner, H., 411, 455, 457, 991,
992, 1008Geiger, D., 529, 756, 1005, 1008Gelatt, C. D., 132, 157, 1014Gelb, A., 579, 1005Gelernter, H., 18, 314, 1005Gelfond, M., 367, 1005Gelman, A., 759, 1005Geman, D., 530, 1005Geman, S., 530, 1005general ontology, 344General Problem Solver, 3, 409generality, 693generalization, 680, 681generalization hierarchy, 686generalized cylinder, 897generalized event, 335GENERATE-DESCRIPTION, 796generation (of states), 69generative capacity, 793, 809generic robot language, 934Genesereth, M. R., 55, 89, 197,
267, 268, 295, 300, 313,314, 317, 945, 1005, 1035
genetic algorithm, 22, 116,116–119, 132–133, 773
genetic programming, 133GENETIC-ALGORITHM, 119Gentner, D., 708, 1005Gentzen, G., 311, 1005Geometry Theorem Prover, 18Georgeff, M. P., 458, 1005Gerbault, F., 756, 1006Gerevini, A., 410, 411, 1005Germann, U., 856, 1005Gershwin, G., 572, 1005Gestalt school, 896Ghahramani, Z., 531, 579, 580,
1005, 1012, 1031Ghallab, M., 409, 411, 455, 1005Ghose, S., 131, 994
Giacomo, G. D., 365, 1005GIB, 183Gibbs sampler, 518, 530Gibson, J. J., 896, 1005Gift of the Magi, 428Gilks, W. R., 530, 755, 1005Gilmore, P. C., 311, 1005Gini, M., 457, 1026Ginsberg, M. L., 157, 158, 183,
313, 317, 458, 532, 998,1006, 1035
Gittins, J. C., 773, 786, 1006Giunchiglia, E., 457, 1002Givan, R., 828, 1021Glanc, A., 939, 1006GLAUBER, 710Glavieux, A., 531, 990global localization, 908Global Positioning System (GPS),
904differential, 904
GLOBAL-TRAIL-POINTER, 291Glover, F., 132, 1006Glymour, C., 755, 1036Go (game), 182Go-Moku, 182Go4++, 183GOAL, 799goal, 49, 59, 60, 87
based agent, 49–50, 54directed reasoning, 185, 220formulation, 60, 431inferential, 254predicate, 654serializable, 407test, 62, 87, 139, 384, 799
GOAL-TEST, 72, 77, 83, 102,126, 128, 435
GOALS, 399God, existence of, 487Godel, K., 8, 295, 311Godel, K., 1006Goebel, J., 756, 1006Goebel, R., 2, 27, 55, 1029Goemate, 183GOFAI, see good old-fashioned
AIgold, 197gold standard, 605Gold, B., 580, 1006Gold, E. M., 674, 830, 1006Goldbach’s conjecture, 710Goldberg, D. E., 133, 1028Golden, K., 458, 1006Goldman, N., 829, 1006
Index 1057
Goldman, R., 457, 531, 829, 995,1006, 1040
Goldszmidt, M., 644, 756, 992,1004
GOLEM, 709Golgi, C., 10GOLOG, 365, 934, 935Gomard, C. K., 708, 1012Gomes, C., 132, 1006good and evil, 584good old-fashioned AI, 951, 966Good, I. J., 186, 528, 963, 1006Good–Turing smoothing, 858Gooday, J. M., 368, 996Goodman, D., 27, 1006Goodman, N., 365, 708, 1006,
1018Goodnow, J. J., 674, 993Gordon, M. J., 267, 1006Gordon, N. J., 579, 1006Gorry, G. A., 488, 1006Gottlob, G., 158, 312, 313, 994,
1006Gotts, N., 368, 996GPS, see Global Positioning
SystemGPS, 3, 7, 18, 409graceful degradation, 631gradient descent, 115Graham, S. L., 828, 1006grammar, 792, 984
attribute, 827augmented, 806–809categorial, 828context-free, 793, 826, 827
probabilistic (PCFG), 836,836–840, 858
context-sensitive, 793definite clause (DCG), 806, 827dependency, 828English, 795–798formal, 795induction, 824, 830learning, 824–834lexical-functional (LFG), 828phrase structure, 826probabilistic, 834–840recursively enumerable, 793regular, 793tree-adjoining (TAG), 828
grammatical formalism, 793Grand Prix, 180GRAPH-SEARCH, 82, 83, 83, 87,
91, 94, 99, 101, 129, 134,171, 460
graphical model, 492GRAPHPLAN, 395, 398, 399, 399,
401, 402, 407–412, 414,457
Grassmann, H., 267, 1007Grayson, C. J., 590, 1007Greece, 233, 310, 363, 365greedy search, 113Green, B., 828, 1007Green, C., 19, 267, 309, 312, 315,
364, 409, 1007Greenbaum, S., 828, 1030Greenblatt, R. D., 187, 1007, 1024Greenstreet, M. R., 315, 1014Greiner, R., 708, 756, 995, 1007Grice, H. P., 827, 1007grid, rectangular, 81GRL, 942Grosof, B., 709, 1032Grosz, B. J., 641, 646, 824, 830,
1007, 1011Grosz, b. J., 830, 1007ground resolution theorem, 217,
300ground term, 249, 273grounding, 204Grove, A., 488, 608, 988Grove, W., 949, 1007Grumberg, O., 315, 411, 996Grundy, W., 757, 993GSAT, 235Gu, J., 157, 235, 236, 1001, 1007,
1036Guard, J., 309, 314, 1007Guha, R. V., 363, 1018Guibas, L. J., 941, 1007GUS, 860Gutfreund, H., 757, 987Guy, R. K., 89, 990Guyon, I., 758, 897, 1017Guyon, I. M., 675, 759, 992Gyorfi, L., 755, 1000Godel, K., 234, 311, 949
hMAP (MAP hypothesis), 714hML (ML hypothesis), 715Haas, A., 366, 1007HACKER, 410Hacking, I., 488, 1007Hahnel, D., 994Haken, W., 156, 988HAL 9000 computer, 529Hald, A., 488, 1007Hale, J., 829, 1005
Halpern, J. Y., 366, 488, 531, 988,1002, 1007
Halpin, M. P., 158, 1006halting problem, 275ham sandwich, 819Hamming distance, 735Hamming, R. W., 488, 1007Hammond, K., 456, 1007Hamscher, W., 55, 1007hand–eye machine, 941Handschin, J. E., 579, 1007handwriting recognition, 885handwritten digit recognition,
752–754, 885, 886Hanks, S., 457, 1001, 1002Hanna, F. K., 710, 1031Hansard, 853, 862Hansen, E., 131, 457, 645, 1007,
1043Hansen, P., 235, 1007Hanski, I., 56, 1007Hansson, O., 131, 135, 1007, 1008happy graph, 661Harada, D., 787, 1025Haralick, R. M., 156, 1008Hardin, G., 646, 1008Harel, D., 312, 364, 995, 1008Harman, G. H., 966, 1008HARPY, 132, 580Harrison, M. A., 828, 1006Harsanyi, J., 645, 1008Harshman, R. A., 858, 999Hart, P. E., 130, 456, 457, 488,
531, 708, 755, 759, 1001,1002, 1008
Hart, T. P., 187, 1008Hartley, R., 896, 1008Harvard, 592hash table, 279Haslum, P., 455, 1008Hastie, T., 674, 756, 759, 1004,
1008Haugeland, J., 2, 29, 951, 966,
1008Haussler, D., 675, 709, 757, 758,
989, 991, 993, 1008Havelund, K., 309, 1008Hayes, P. J., 29, 364, 365, 367,
368, 965, 1003, 1008,1021
Hayes-Roth, F., 580, 1001head (of a clause), 218, 287hearer, 790HEARSAY-II, 580
1058 Index
Hearst, M. A., 858, 861, 1026,1033
Heath Robinson, 14heavy-tailed distribution, 132Heawood, P., 950Hebb, D. O., 16, 20, 785, 1008Heckerman, D., 26, 28, 525, 529,
531, 532, 579, 609, 755,756, 993, 1008, 1010,1032, 1036
hedonic calculus, 608Heim, I., 828, 1008Heinz, E. A., 188, 1008Held, M., 131, 1008Helmert, M., 411, 1008Helmholtz, H., 12, 895Hempel, C., 6Henderson, T. C., 146, 156, 1023Hendler, J., 364, 412, 456, 987,
990, 1002Hendrix, G. G., 352, 1009Henrion, M., 56, 501, 530, 609,
1009, 1010, 1029Henry, O., 428Henzinger, M., 847, 859, 1035Henzinger, T. A., 55, 1009Hephaistos, 939Herbrand base, 301Herbrand universe, 301, 311Herbrand’s theorem, 301, 311Herbrand, J., 234, 274, 301, 311,
1009Herskovits, E., 756, 997heuristic, 129
admissible, 97composite, 108degree, 144, 156domain-independent, 376empty-delete-list, 387for planning, 386–387function, 95, 105–110, 376least-constraining-value, 144Manhattan, 106min-conflicts, 150minimum remaining values,
143, 156search, see search, heuristicstraight-line, 95
Heuristic Programming Project(HPP), 23
Hewitt, C., 312, 313, 1009Hex, 189hexapod, 930hidden Markov model, 26, 537,
549, 549–551, 559, 578,
579, 731hidden unit, 739hidden variable, 504hierarchical decomposition, 422hierarchical task network (HTN),
422Hierholzer, C., 133, 1009HIGH, 698higher-order logic, 244Hilbert, D., 8Hilgard, E. R., 785, 1009hill climbing, 111, 136
random-restart, 114HILL-CLIMBING, 112, 222hindsight, 542Hingorani, S. L., 579, 997Hintikka, J., 366, 1009Hinton, G. E., 25, 133, 757, 759,
1009, 1031HipNav, 28Hirsh, H., 708, 1009Hirst, G., 829, 1009hit list, 846Hitachi, 430HITECH, 187HMM, 549, 559, 580Ho, Y.-C., 22, 757, 993Hoane, A. J., 181, 188, 994Hobbs, J. R., 369, 822, 823, 829,
860, 1009Hobbs, T., 6Hockey, B. A., 828, 1000Hodges, J. L., 756, 1003Hoff, M. E., 20, 766, 785, 1041Hoffman, J., 411, 1014Hoffmann, J., 411, 1009Hogan, N., 941, 1009holistic context, 951Holland, J. H., 132, 133, 1009,
1023Holldobler, S., 365, 1009Hollerbach, J. M., 941, 1002Holloway, J., 187, 1024Holzmann, G. J., 309, 1009homeostatic, 757Homo sapiens, 1homophone, 568Hon, H., 580, 1010Honavar, V., 830, 1027Hong, J., 674, 1022Hood, A., 10, 1009Hopcroft, J., 941, 983, 987, 1033Hopfield network, 758Hopfield, J. J., 25, 758, 1009Hopkins Beast, 940
horizon, 865horizon effect, 174Horn clause, 217, 306, 701Horn form, 218, 234Horn, A., 234, 1009Horn, B. K. P., 896, 897, 1010Horning, J. J., 1010Horowitz, E., 89, 1010Horowitz, M., 309, 1026Horrocks, J. C., 488, 998horse, 954Horswill, I., 934, 942, 1010Horvitz, E. J., 26, 56, 529, 532,
609, 971, 972, 1010, 1032Hovel, D., 529, 532, 1010Hovy, E., 829, 1010Howard, R. A., 597, 608, 609,
644, 1010, 1022Howe, A., 409, 1005HSCP, 457Hsu, F.-H., 181, 187, 188, 994,
1010HTML, 849HTN, see hierarchical task
networkHuang, T., 579, 1010Huang, X. D., 580, 1010Hubble Space Telescope, 140,
150, 417, 456Hubel, D. H., 897, 1010Huber, M., 940, 996Huddleston, R. D., 828, 1010Huffman, D. A., 19, 882, 897,
1010Huffman, S., 940, 996Hughes, B. D., 126, 1011HUGIN, 529, 579Huhns, M. N., 56, 1011human judgment, 523, 531, 592human performance, 1human preference, 617humanoid robot, 902Hume, D., 6, 1011Hungarian algorithm, 889Hunsberger, L., 641, 646, 1011Hunt, E. B., 674, 1011Hunter, L., 756, 1011Hurwicz, L., 646, 1011Hutchins, W. J., 860, 1011Huttenlocher, D. P., 897, 1011Huygens, C., 487, 645, 1011Hwa, R., 859, 1011Hwang, C. H., 364, 828, 1011hybrid architecture, 932hyperparameter, 721
Index 1059
hypertree width, 510hypothesis, 651
approximately correct, 669null, 662space, 679
Hyun, S., 940, 999Hahnel, D., 940
i.i.d. (independently andidentically distributed),713
IBM, 17, 18, 27, 181, 580, 855IBM 704 computer, 182ice cream, 465ID3, 709IDA*, see search, iterative
deepening A*identification in the limit, 672identity theory, 965IEEE, 364ignorance, 523, 525
practical, 464theoretical, 464
IJCAI (International JointConference on AI), 30
ILP, see logic programming,inductive
image, 865formation, 865–869, 894processing, 894retrieval, 885segmentation, 872–873, 885
imaging sensor, 904implementation level, 196implication, 205implicit effect, 332importance sampling, 530incompleteness
theorem, 8, 302, 949inconsistent support, 397incorporation, 795incremental learning, 683independence, 478, 477–479, 481,
486absolute, 478conditional, 499marginal, 478
independent subproblems, 152indeterminacy
bounded, 430unbounded, 431
indexical, 817indexing, 279, 278–279India, 16, 156, 363indicator variable, 743
indifference, principle of, 472,487
individuation, 327induction, 6, 651
constructive, 700mathematical, 8
inductive inferencepure, 651
inductive learning, see learninginductive logic programming
(ILP), 709Indyk, P., 756, 1011inequality constraints, 394INFER, 307, 307inference, 195, 272
probabilistic, 475, 475–477,492
procedure, 262rule, 211, 233
inferential equivalence, 274infinite horizon, 616infinite horizon problems, 644influence diagram, see decision
network, 1011, 1017information
extraction, 848–850, 858gain, 660, 662gathering, 37, 924retrieval, 346, 840–848, 859theory, 659, 659–660, 674value, 600, 609
information value, see value ofinformation
INFORMATION-GATHERING-AGENT,603
informed search, see search,informed
Ingerman, P. Z., 827, 1011inheritance, 323, 323, 350, 373
multiple, 350INIT, 799initial state, 62, 87, 162INITIAL-PLANNING-GRAPH, 399INITIAL-STATE, 72, 77, 83, 102,
112, 116, 435INITIALIZER, 803Inoue, K., 705, 1011input resolution, 305INSERT, 71, 72, 83INSERT-ALL, 71, 72, 83inside–outside algorithm, 839insurance premium, 591integrability, 881integrity constraints, 218
intelligence, 1, 32intention (discourse), 792intentional stance, 966intentional state, 955intentionality, 953, 965, 966intercausal reasoning, see
reasoninginterleaving (search and action),
87interlingua, 852intermediate form, 814internal state, 48Internet, 26Internet search, 346Internet shopping, 344–349INTERPLAN, 410INTERPRET-INPUT, 47interpretation, 246
pragmatic, 794, 815–817semantic, 794
interreflections, 881interval, 335, 338–339Intille, S., 579, 1011intractability, 8, 21, 30intrinsic property, 328introspection, 3, 13inverse entailment, see entailment,
inverseinverse game theory, 640inverse kinematics, 917inverse link, 351inverse method, 312inverse resolution, see resolution,
inverseinverted pendulum, 780Inza, I., 133, 136, 1017IPEM, 458IPL, 17IPP, 411IQ test, 19, 30irrationality, 2, 587, 608IS-A links, 366Isard, M., 568, 579, 1011ISIS, 455Israel, D., 860, 1009Italian, 851Italy, 487ITEP chess program, 187iterative deepening, see search,
iterative deepeningiterative expansion, 131ITERATIVE-DEEPENING-
SEARCH, 78,107
ITOU, 709
1060 Index
IXTET, 411
Jaakkola, T., 530, 531, 580, 787,1011, 1012, 1033
Jackel, L., 758, 897, 1017Jacquard loom, 14Jacquard, J., 14Jaffar, J., 313, 1011Jaguar, 455Jahr, M., 856, 1005James, H., 13James, W., 13janitorial science, 35Japan, 24Jaskowski, S., 1011Jaumard, B., 235, 1007Jeavons, P., 158, 1027Jefferson, G., 952, 1011Jeffrey, R. C., 315, 487, 608, 992,
1011Jeffreys, H., 858, 1011Jelinek, F., 580, 858, 860, 993,
1011, 1012Jenkin, M., 942, 1001Jennings, H. S., 13, 1012Jensen, F., 529, 987Jensen, F. V., 529, 532, 987, 1012Jespersen, O., 828, 1012Jevons, W. S., 234, 709, 1012Jimenez, P., 457, 1012Joachims, T., 757, 860, 1012job shop scheduling, 417, 417Johnson, C. R., 56, 993Johnson, D. S., 983, 1004Johnson, M., 829, 830, 833, 992,
1001, 1017Johnson, W. W., 88, 1012Johnson-Laird, P. N., 29, 1012Johnston, M. D., 132, 157, 456,
1012, 1023join tree, 510joint action, 451joint intention, 454joint plan, 450joint probability distribution, 469
full, 469, 486, 492, 495–498Jones, M., 897, 1039Jones, N. D., 708, 1012Jones, R., 312, 1012Jonsson, A., 27, 55, 455, 1012Jordan, M. I., 530–532, 579, 580,
645, 758, 783, 787, 858,991, 1005, 1011, 1012,1024, 1025, 1033, 1036
Joshi, A. K., 828, 830, 1007,1012, 1033
Joskowicz, L., 368, 1032Joslin, D., 410, 1012Jouannaud, J.-P., 314, 1012Joule, J., 706JTMS, see truth maintenance
system, justification-basedJuang, B.-H., 580, 1030Judd, J. S., 758, 1012Juels, A., 133, 1012Julesz, B., 896, 1012junction type, 883Jurafsky, D., 29, 580, 829, 830,
861, 1012justification, 357Jaskowski, S., 311
k-DL (decision list), 671k-DT (decision tree), 671Kadane, J. B., 645, 1012Kaelbling, L. P., 236, 644, 645,
788, 942, 994, 999, 1013Kager, R., 829, 1013Kahneman, D., 2, 498, 592, 1013,
1038Kaindl, H., 131, 1013Kalah, 187Kalman filter, 537, 551, 551–559,
578, 579switching, 558
Kalman gain matrix, 556Kalman, R., 551, 578, 1013Kambhampati, S., 410, 411, 455,
456, 1000, 1013, 1025Kameya, Y., 531, 1033Kameyama, M., 860, 1009Kan, A., 88, 421, 1017Kanade, T., 28, 876, 896, 1000,
1038Kanal, L. N., 131, 532, 1013,
1016, 1025Kanazawa, K., 579, 645, 756, 940,
991, 999, 1013, 1032Kanefsky, B., 9, 157, 235, 995Kanoui, H., 267, 313, 996Kant, E., 312, 993Kaplan, D., 366, 1013Kaplan, R., 805, 828, 860, 991,
1021Karmarkar, N., 132, 1013Karmiloff-Smith, A., 830, 1001Karp, R. M., 9, 88, 131, 983,
1008, 1013Karypis, G., 846, 1036
Kasami, T., 828, 1013Kasparov, G., 27, 180, 181, 1013Kasper, R. T., 829, 989, 1013Kassirer, J. P., 488, 1006Kaufmann, M., 315, 1013Kautz, D., 456, 999Kautz, H., 132, 235, 411, 1006,
1013, 1034Kavraki, L., 941, 1013Kay, A. R., 11, 1026Kay, M., 580, 851, 860, 991, 1013Kaye, R., 235, 1013KB, see knowledge baseKB-AGENT, 196KBIL, see inductive learning,
knowledge-basedKeane, M. A., 133, 1016Kearns, M., 645, 675, 786, 1013Kedar-Cabelli, S., 708, 1023Keene, R., 27, 1006Keeney, R. L., 592, 597, 608,
1014Kehler, A., 829, 1014Keil, F. C., 3, 29, 966, 1041Keim, G. A., 28, 158, 1019Keller, R., 708, 1023Kelly, J., 756, 995Kemp, M., 895, 1014Kempe, A. B., 950Kenley, C. R., 529, 1034Kent, C., 341Kepler, J., 895Kern, C., 315, 1014kernel function, 735, 751
polynomial, 751kernel machine, 749, 749–752kernel model, 735, 735–736kernelization, 752Kernighan, B. W., 88, 1019Keynes, J. M., 487, 1014Khatib, O., 941, 1014Khorsand, A., 131, 1013kidnapping problem, 908KIDS, 315Kietz, J.-U., 709, 1014Kilimanjaro, 790Kim, J. H., 529, 1014kinematic state, 904kinematics, 917King, R. D., 706, 707, 1014, 1036kinship domain, 254–256Kirby, M., 897, 1035Kirchner, C., 314, 1012Kirkpatrick, S., 132, 157, 235,
1014
Index 1061
Kirman, J., 644, 999Kirousis, L. M., 897, 1014Kitano, H., 940, 1014Kjaerulff, U., 579, 1014KL-ONE, 367Kleer, J. D., 55, 1007Klein, D., 859, 1014Kleinberg, J. M., 859, 1014Klempner, G., 532, 1024Knight, K., 2, 856, 860–862,
1005, 1014, 1030, 1042Knoblock, C. A., 88, 409, 456,
994, 1005, 1014knowing that, 343knowing what, 343knowing whether, 343knowledge
acquisition, 23, 261and action, 7, 344background, 196base, 195, 232, 268based system, 22–24, 776commonsense, 19diagnostic, 480effect, 344engineering, 260, 260–266,
320, 496for decision-theoretic
systems, 605level, 196, 233map, see Bayesian networkmodel-based, 481precondition, 344prior, 37proposition, 230representation, 3, 16, 19, 24,
240–244, 320–374analogical, 268language, 195, 232, 240
source, 580knowledge representation
uncertain, 492–495Knuth, D. E., 187, 314, 827, 941,
983, 1007, 1014Koditschek, D., 941, 1014Koehler, J., 411, 1014Koenderink, J. J., 896, 897, 1015Koenig, S., 89, 134, 644, 940,
1015, 1035Kohn, W., 314, 1015Koller, D., 488, 531, 579, 580,
646, 756, 860, 940, 988,991, 992, 1010, 1013,1015, 1023, 1032
Kolmogorov complexity, 675
Kolmogorov’s axioms, 471Kolmogorov, A. N., 487, 578,
675, 1015Kolodner, J., 24, 708, 829, 1015Kondrak, G., 157, 158, 1015Konolige, K., 366, 367, 458, 942,
993, 1015Koopmans, T. C., 644, 1015Koren., Y., 941, 992Korf, R. E., 89, 131, 134, 188,
410, 1015, 1016, 1028Kortenkamp, D., 940, 942, 996,
1016Koss, F., 940, 996Kotok, A., 187, 1016Koutsoupias, E., 132, 235, 1016Kowalski form, 295Kowalski, R., 267, 289, 295, 313,
314, 364, 365, 367, 1016,1032, 1039
Koza, J. R., 133, 1016KPML (generation program), 829Kramnik, V., 181Kratzer, A., 828, 1008Kraus, S., 458, 1016Kraus, W. F., 133, 1019Krauss, P., 531, 1034Kripke, S. A., 366, 1016Krishnan, T., 756, 1022Krovetz, R., 859, 1016Kruppa, E., 895, 1016KRYPTON, 367Ktesibios, 15Kucera, H., 859, 1003Kuehner, D., 313, 1016Kuhn, H. W., 646, 1016Kuhns, J.-L., 859, 1020Kuijpers, C., 133, 136, 1017Kuipers, B. J., 940, 1016Kukich, K., 859, 1016Kulikowski, C. A., 675, 1040Kumar, P. R., 55, 1016Kumar, V., 131, 158, 846, 1013,
1016, 1025, 1036Kuniyoshi, Y., 940, 1014Kuper, G. M., 313, 1016Kurzweil, R., 2, 963, 1016Kyburg, H. E., 488, 1016, 1017
label (in plans), 436, 460Ladkin, P., 365, 1017Ladner, R. E., 364, 1003Lafferty, J., 859, 1017Laguna, M., 132, 1006
Laird, J. E., 27, 286, 312, 456,708, 971, 1012, 1017
Laird, N., 579, 756, 1000Laird, P., 132, 157, 1023Lakemeyer, G., 940, 994Lakoff, G., 363, 829, 1017Lamarck, J. B., 120, 1017Lambertian surface, 868, 880, 898Landauer, T. K., 858, 999landmark, 909Langley, P., 710, 1017Langlotz, C. P., 26, 1010Langton, C., 133, 1017language, 790, 791–792
abhors synonymy, 844as action, 827analysis, 794formal, 791generation, 792model, 568, 841, 854, 856
in disambiguation, 821natural, 5, 241, 791perception, 794processing, 16, 790–862situated, 826and thought, 243translation, 21, 694, 850–857understanding, 19, 23
Lansky, A. L., 458, 1005Laplace, P., 9, 472, 487, 523, 1017Lappin, S., 829, 1017Lari, K., 859, 1017Larkey, P. D., 645, 1012Larranaga, P., 133, 136Larranaga, P., 1017Larsen, B., 529, 1017Larson, G., 687Laruelle, H., 411, 455, 1005Lassez, J.-L., 313, 1011Lassila, O., 364, 990latent Dirichlet allocation, 858latent semantic indexing, 858latent variable, 724Latombe, J.-C., 455, 941, 1000,
1013, 1017, 1043lattice theory, 309Laugherty, K., 828, 1007Lauritzen, S., 529, 532, 608, 755,
756, 1017, 1025, 1036Lavrac, N., 674, 705, 709Lavrac, N., 1017, 1022LAWALY, 456Lawler, E. L., 88, 131, 421, 1017laws of thought, 4layers, 739
1062 Index
Lazanas, A., 941, 1017laziness, 463La Mettrie, J. O., 961, 965, 1017La Mura, P., 608, 1017LCF, 267Leacock, C., 949, 994leaf node, 70leak node, 500LEANTAP, 315Leaper, D. J., 488, 998leaping to conclusions, 687learning, 37, 54, 197, 649, 949,
952action-value, 764active, 764assessing performance,
660–661Bayesian, 713, 713–714, 754Bayesian network, 722–724blocks-world, 19cart–pole problem, 780checkers, 18computational theory, 137, 668curve, 660decision lists, 670–671decision trees, 653–659determinations, 695element, 52ensemble, 664–668explanation-based, 690–694game-playing, 780grammar, 824–834heuristics, 109–110hidden Markov model, 731hidden variables, 730with hidden variables, 727incremental, 683, 687inductive, 651–653, 673
knowledge-based, 689, 698,707
instance-based, 733, 733knowledge in, 686–690linearly separable functions,
741–743logical, 678–686MAP, 714–715maximum likelihood, 716–720naive Bayes, 718neural network, 748new predicates, 700, 706noise, 661–663nonparametric, 733online, 778PAC, 668, 675, 694parameter, 716, 720–722, 733
passive, 764Q, 776, 782rate, 769, 776reinforcement, 763–789relevance-based, 694–697restaurant problem, 654statistical, 712–715supervised, 885temporal difference, 767–771to search, 104–105top-down, 701–703unsupervised, 650, 725–727utility functions, 764
Leass, H. J., 829, 1017least commitment, 387, 683least-constraining-value heuristic,
144LeCun, Y., 758, 897, 1017Lederberg, J., 23, 363, 1002, 1019Lee, K.-F., 580, 1039Lee, R. C.-T., 315, 995Lee, T.-M., 11, 1026Leech, G., 828, 859, 1018, 1030Lefkovitz, D., 189, 1018left-corner parser, 802left-recursive rules, 799legal reasoning, 31LEGAL-ACTIONS, 89Lehmann, D., 458, 1016Leibniz, G. W., 6, 119, 234, 487,
645Leimer, H., 529, 1017Leipzig, 12Leiserson, C. E., 983, 997Lemmer, J. F., 532, 1013Lenat, D. B., 363, 372, 710, 998,
1018LENGTH, 119, 399, 643, 801, 977lens, 866lens system, 866–867Lenstra, J. K., 88, 421, 456, 1017,
1039Lenzerini, M., 367, 994Leonard, H. S., 365, 1018Leonard, J. J., 940, 1018Leone, N., 158, 313, 367, 1001,
1006Lesh, N., 457, 1002Lesniewski, S., 1018Lesperance, Y., 365, 934Lesperance, Y., 1005, 1018Lesser, V. R., 458, 580, 1001Lettvin, J. Y., 893, 1018Letz, R., 314, 1018level (in planning graphs), 395
leveled off (planning graph), 397Levesque, H. J., 132, 235, 365,
367, 369, 458, 934, 992,996, 1005, 1018, 1034
Levitt, G. M., 186, 1018Levitt, T. S., 940, 1016Levy, D. N. L., 189, 1018Lewis, D. D., 860, 1018Lewis, D. K., 55, 828, 965, 1018Lewis, R. A., 707, 1014LEX, 674, 686lexicalized PCFG, 837, 859lexicon, 795, 828Lesniewski, S., 365Le Cun, Y., 758, 1017LFG, see grammar,
lexical-functionalLi, C. M., 235, 1018Li, M., 675, 1018liability, 962Lieberman, L., 896, 989LIFE, 314life insurance, 592LIFO queue, 75Lifschitz, V., 367, 368, 409, 1005,
1018lifting, 276, 275–279lifting lemma, 300, 303light, 867–868Lighthill report, 22, 24Lighthill, J., 22, 1018likelihood, 541likelihood weighting, 514, 528,
530, 565LIKELIHOOD-WEIGHTING, 514,
515limb (in a scene), 882limited rationality, 5Lin, D., 757, 993Lin, F., 365, 934, 1018Lin, S., 88, 130, 1018, 1019Linden, T. A., 457, 1019Lindsay, R. K., 363, 860, 1019line labeling, 882line search, 121linear
algebra, 979–981constraint, 139Gaussian, 502, 529, 552input resolution, 308interpolation smoothing, 835programming, 132, 638regression, 720resolution, 305, 705separability, 741, 755
Index 1063
separator, 740, 749optimal, 749
linearization, 388, 912Linguistic String Project, 828linguistics, 16, 29
computational, 16linkage constraints, 917LINKS, 424Linnaeus, 363LINUS, 705Lipkis, T. A., 367, 1033liquid event, see event, liquidliquids, 368Lisp, 18, 248, 343, 670, 934LIST?, 278lists, 257literal (sentence), 204Littman, M. L., 28, 133, 158, 457,
645, 646, 788, 987, 994,1013, 1019, 1020
Liu, J. S., 579, 1019Liu, W., 756, 995lizard toasting, 688Lloyd, E. K., 156, 991Lloyd, J. W., 313, 1019local beam search, 115local search, 110, 223locality, 230, 524localization, 908
Markov, 940locally structured system, 496Locke, J., 6, 827, 1019Locke, W. N., 860, 1019locking, 308Lodge, D., 974, 1019Loebner prize, 30log likelihood, 716Logemann, G., 221, 235, 998logic, 4, 7, 200–204
atoms, 248default, 359dynamic, 364equality, 253first-order, 240, 240–271
inference, 272–275semantics, 245syntax, 245
fuzzy, 464, 524, 526–527, 532higher-order, 244inductive, 472, 488, 488interpretations, 246–247modal, 342, 366models, 245–246nonmonotonic, 358notation, 4
propositional, 195, 204–211,241
inference, 208–223semantics, 206–207syntax, 204–206
quantifier, 249–252resolution, 213–217sampling, 530temporal, 244, 364terms, 248variable, 290
logic programming, 267,289–295, 313
constraint, 294, 294–295, 313inductive (ILP), 689, 697–703,
707tabled, 294, 294, 313
Logic Theorist, 17, 234logic Theorist, 17logical
agent, 195connective, 16, 204, 249inference, 202, 272–319omniscience, 343piano, 234positivism, 6reasoning, 211–224
logicism, 4Logistello, 182logistic function, 738logit distribution, 503, 530Lohn, J. D., 133, 1019London, 14long compound names, 264Long, D., 411, 1003long-distance dependencies, 817long-term memory, 286Longuet-Higgins, H. C., 1019Look ma, no hands, 18LOOKUP, 45lookup table, 748loopy propagation, 531Lotem, A., 411, 1039lottery, 586, 610
standard, 593love, 949Lovejoy, W. S., 645, 1019Lovelace, A., 14Loveland, D., 221, 235, 313–315,
998, 1019Lowe, D. G., 897, 1019Lowenheim, L., 267Lowenheim, L., 1019Lowerre, B. T., 132, 580, 1019
Lowrance, J. D., 458, 532, 1032,1041
Lowry, M., 309, 1008Lowry, M. R., 315, 1019Loyd, S., 88, 1019Lozano-Perez, T., 941, 993, 1019,
1040LPG, 411LRTA*, 127, 134LRTA*-AGENT, 128, 128LRTA*-COST, 128, 128LSTD, 786LT, 17Luby, M., 114, 530, 580, 997,
1019Lucas, J. R., 949, 950, 1019Lucas, P., 532, 605, 1019Luce, D. R., 10, 646, 1019Luger, G. F., 30, 1019Lugosi, G., 755, 1000Lull, R., 6LUNAR, 828Luong, Q.-T., 896, 1002Lusk, E., 315, 1042Lowenheim, L., 267
Mezard, M., 758MA*, see search,
memory-bounded A*MAC, 146, 149, 157MacHack 6, 187machine evolution, 22machine learning, 3, 5machine translation, see language,
translation, 31, 850–857statistical, 853–857
Machover, M., 267, 990MacKay, D. J. C., 531, 758, 1020,
1021Mackworth, A. K., 2, 27, 55, 146,
156, 158, 897, 1004, 1020,1029
macrop (macro operator), 456Madigan, C. F., 235, 1024magic set, 287Mahalanobis distance, 735Mahanti, A., 134, 1020Mahaviracarya, 487Maier, D., 157, 313, 989, 990Majercik, S. M., 457, 1020majority function, 655, 740MAJORITY-VALUE, 658MAKE-ACTION-QUERY, 196MAKE-ACTION-SENTENCE, 196
1064 Index
MAKE-NODE, 72, 77, 83, 102,112, 116
MAKE-PERCEPT-SENTENCE,196
MAKE-QUEUE, 71Makov, U. E., 756, 1038Mali, A. D., 456, 1013Malik, J., 579, 758, 873, 875, 880,
896, 897, 990, 999, 1010,1020, 1034
Malik, S., 235, 1024Mandela, N., 885Manhattan, see heuristic,
Manhattanmanipulator, 901Mann, W. C., 829, 1020Manna, Z., 267, 314, 315, 1020Manning, C. D., 859, 861, 1014,
1020Manolios, P., 315, 1013Mansour, Y., 645, 787, 1013, 1037MAP (maximum a posteriori),
714Marais, H., 847, 859, 1035Marbach, P., 787, 1020Marcinkiewicz, M. A., 859, 1020Marcu, D., 856, 1005Marcus, M. P., 859, 1020marginalization, 475Marin, J., 674, 1011Markov
assumption, 539, 578blanket, 499, 536chain, 517, 539chain Monte Carlo, 516,
516–519, 528, 530, 565decision process
partially observable(POMDP), 626, 625–628,645
decision process (MDP), 10,615, 643, 645, 763
process, 539property, 547, 578, 614
Markov, A. A., 578, 858, 1020Maron, M. E., 488, 859, 1020Marr, D., 897, 1020Marriott, K., 157, 158, 314, 1020Marsland, A. T., 189, 1020Martelli, A., 131, 314, 1020Marthi, B., 580, 1020Martin, J. H., 29, 580, 829, 830,
861, 1012, 1020Martin, N., 312, 993Martin, P., 456, 829, 1009, 1020
Maslov, S. Y., 312, 1020, 1021Mason, M., 89, 456, 941, 942,
1001, 1019, 1021mass noun, 328mass spectrometer, 22Mataric, M. J., 942, 1021Mateis, C., 367, 1001material advantage, 173material value, 172materialism, 6, 954, 965
eliminative, 965Mates, B., 234, 1021mathematical induction schema,
302mathematics, 7–9, 18, 29Matheson, J. E., 597, 608, 1010,
1022matrix, 980Maturana, H. R., 893, 1018Mauchly, J., 14MAX, 166, 170max norm, 622MAX-VALUE, 166, 166, 170, 170maximin, 635maximin equilibrium, 636maximum a posteriori, 714maximum expected utility, 585,
588, 607maximum likelihood, 715,
716–720Maxwell, J., 523, 805, 828, 895,
1021Mayer, A., 131, 135, 1007, 1008Mayne, D. Q., 579, 1007Mazumder, P., 88, 1034McAllester, D. A., 25, 188, 308,
368, 410, 411, 787, 828,1013, 1021, 1037
MCC, 24McCarthy, J., 17, 18, 55, 233, 267,
311, 341, 364, 367, 959,1021
McCartney, R. D., 315, 1019McCawley, J. D., 828, 1021McClelland, J. L., 25, 1032McConnell-Ginet, S., 29, 828, 995McCulloch, W. S., 15, 16, 20,
236, 737, 738, 757, 893,1018, 1021
McCune, W., 306, 309, 314, 1021McDermott, D., 2, 312, 350, 367,
409, 411, 456, 457, 995,1005, 1021
McDermott, J., 24, 286, 312, 1021McDonald, R., 242
McEliece, R. J., 531, 1021McGill, M. J., 755, 859, 1033McGregor, J. J., 156, 1022McGuinness, D. L., 353, 367, 992McKeown, K., 829, 1022McLachlan, G. J., 756, 1022MCMC, see Markov chain Monte
CarloMCMC-ASK, 517, 518McMillan, K. L., 411, 1022McNealy, S., 962MDL, see minimum description
lengthMDP, see Markov decision
processmeasure, 325measurement, 325–327mechanism, 641mechanism design, 640, 640–643medical diagnosis, 23, 28, 488,
530Meehan, J., 312, 995Meehl, P., 949, 1007, 1022Meet (interval relation), 339Megarian school, 234, 364megavariable, 549Meggido, N., 646, 1015Melcuk, I. A., 1022Mellish, C. S., 314, 996Melcuk, I. A., 828memoization, 293, 310, 690memory, 243memory requirements, 74, 78memory-based translation, 852MEMS, 969Mendel, G., 120, 1022meningitis, 480–490mental model, in disambiguation,
821mental objects, 341–344mental states, 954Mercer, J., 751, 1022Mercer, R. L., 854, 858, 860, 993,
1012mereology, 365Merkhofer, M. M., 608, 1022MERLIN, 366Merlin, P. M., 313, 995Meta-DENDRAL, 674, 686metadata, 844metalevel state space, 104metaphor, 819, 829metaphysics, 6metareasoning, 184
decision-theoretic, 971
Index 1065
metarule, 295metonymy, 819, 829Metropolis algorithm, 132, 530Metropolis, N., 132, 530, 1022MEU, see maximum expected
utilityMezard, M., 1022MGONZ, 948MGSS*, 188MGU (most general unifier), 277,
279, 303, 316Michalski, R. S., 674, 675, 1022Michaylov, S., 313, 1011Michel, S., 861, 1022Michie, D., 29, 68, 130, 131, 189,
456, 675, 780, 785, 941,1000, 1022
MICRO-PLANNER, 312micromort, 593, 608, 611Microsoft, 529, 532, 848microworld, 19, 19, 21Middleton, B., 501, 1029Milgrom, P., 646, 1022Mill, J. S., 7, 674, 680, 1022Miller, A. C., 608, 1022Miller, D., 455, 999million queens problem, 150Millstein, T., 411, 1002Milner, A. J., 267, 1006MIN, 166, 170MIN-CONFLICTS, 151, 151, 223min-conflicts, see heuristic,
min-conflicts, 157MIN-VALUE, 166, 166, 170, 170mind, 2, 964
dualistic view, 965and mysticism, 12philosophy of, 964, 966as physical system, 6theory of, 3
mind–body problem, 954,954–956
minesweeper, 235, 238minimal model, 355, 359MINIMAL-CONSISTENT-DET,
696, 696MINIMAX, 170minimax, see search, minimaxminimax algorithm, 165, 434, 635minimax decision, 165MINIMAX-DECISION, 166, 171minimum description length, 675,
715minimum remaining values, 143minimum slack, 421
minimum spanning tree, 131, 135Minker, J., 312, 1004Minsky, M. L., 17, 19, 22, 24, 29,
366, 529, 757, 1021, 1022Minton, S., 132, 157, 456, 708,
994, 1023missing attribute values, 663missionaries and cannibals, 88,
90, 363MIT, 17–19, 941Mitchell, D., 132, 235, 996, 1034Mitchell, M., 133, 1023Mitchell, T. M., 56, 674, 675, 686,
708, 971, 993, 1022, 1023Mitkov, R., 829, 1023mixed strategy, 632mixing time, 544mixture
distribution, 725of Gaussians, 571, 726, 728,
729ML, see maximum likelihoodmodal logic, 366modal operator, 342, 364model, 48, 201, 266, 519
causal, 498kernel, 735language, 856(in representation), 13sensor, 549, 554, 578theory, 267transition, 614
model checking, 202model-based reasoning, 260Modus Ponens, 211, 234, 305,
310, 316, 342Generalized, 276, 276
Moffat, A., 859, 1041Mohr, R., 146, 156, 1023Mohri, M., 793, 1023Moisl, H., 830, 997monism, 954monitoring, 541monkey and bananas, 90, 412monotone condition, 130monotonicity, 212, 358monotonicity (of a heuristic), 99monotonicity (of preferences),
588Montague, P. R., 786, 1023, 1033Montague, R., 365, 366, 828,
1013, 1023Montanari, U., 131, 156, 314,
991, 1020, 1023Monte Carlo algorithm, 511
Monte Carlo localization, 910Montemerlo, M., 940, 1023Mooney, R., 708, 830, 1000, 1023Mooney, R. J., 826, 830, 1023,
1042Moore’s Law, 963Moore, A. W., 132, 786, 788, 992,
1013, 1023Moore, E. F., 89, 1023Moore, J. D., 456, 829, 989, 1042Moore, J. S., 309, 314, 315, 366,
992, 1013, 1023Moore, R. C., 366, 369, 1009,
1023Moravec, H. P., 940, 956, 963,
1023, 1024More, T., 17Morgan, J., 458, 827, 996Morgan, N., 580, 1006Morgenstern, L., 366, 368, 1024Morgenstern, O., 9, 186, 608,
1039Moricz, M., 847, 859, 1035Morjaria, M. A., 532, 1024morphing, 889Morris, P., 27, 55, 455, 1012Morrison, E., 186, 1024Morrison, P., 186, 1024Moses, Y., 366, 1002Moskewicz, M. W., 235, 1024most constrained variable, 284most general unifier (MGU), 277,
279, 303, 316most likely explanation, 578most likely state, 923Mosteller, F., 861, 1024Mostow, J., 131, 135, 1024motion, 874–876
compliant, 924guarded, 924
motion model, 908motion parallax, 877, 895Motzkin, T. S., 757, 1024Moussouris, J., 187, 1024Moutarlier, P., 940, 1024movies
2001: A Space Odyssey, 529A.I., 964Attack of the Cat People, 819Take the Money and Run, 574The Matrix, 962The Terminator, 962
Mozetic, I., 674, 1022MPI, see mutual preferential
independence
1066 Index
MRS (metalevel reasoningsystem), 295
MST (minimum spanning tree),135
Muggleton, S. H., 698, 705–707,709, 830, 1001, 1014,1024, 1036, 1038
Muller, M., 1024Muller, U., 758, 897, 1017multiagent planning, 450,
449–454multiagent systems, 632multiattribute utility theory, 593,
608, 617multibody planning, 451–452multiply connected network, 509Mundy, J., 896, 1024MUNIN, 529Murakami, T., 182Murga, R., 133, 136, 1017Murphy’s Law, 86, 93Murphy, K., 531, 579, 940, 991,
1024Murphy, R., 942, 1016, 1024Muscettola, N., 27, 55, 455, 456,
1012, 1024music, 14mutagenicity, 706MUTATE, 119mutation, 22, 118mutex, 396mutual exclusion, 396mutual preferential independence
(MPI), 596mutual utility independence
(MUI), 597MYCIN, 23, 525, 531Myers, K. L., 458, 1041Myerson, R. B., 646, 1024myopic policy, 603Myrhaug, B., 366, 991, 997mysticism, 12Muller, M., 189
n-armed bandit, 773Nadal, J.-P., 758, 1022Nagel, T., 965, 1024naive Bayes, 482, 486, 488, 718,
728, 729, 842Nalwa, V. S., 12, 897, 1024Nardi, D., 367, 994narrow content, 956NASA, 27, 312, 368, 407, 456,
532, 902Nash equilibrium, 634
Nash, J., 1025NASL, 457natural deduction, 311natural kind, 326natural language, see language,
naturalnatural numbers, 256natural stupidity, 350Nau, D. S., 131, 183, 188, 411,
456, 1002, 1016, 1025,1036, 1039
Naur, P., 827, 1025navigation function, 924NAVLAB, 27, 901Nayak, P., 55, 368, 456, 1024,
1025Neal, R., 758, 1025Nealy, R., 182nearest-neighbor, 733, 888, 890nearest-neighbor model, 733–735neat vs. scruffy, 25Nebel, B., 409, 411, 1014, 1025needle in a haystack, 203negated literal, 307negation, 204negation as failure, 290, 357,
356–358negative example, 653negligence, 962NEIGHBORS, 146Nelson, G., 314, 1025NETL, 367Netto, E., 88, 1025neural computation, see neural
networkneural network, 16, 20, 25, 182,
736, 736–748expressiveness, 16feed-forward, 738hardware, 17learning, 16, 748multilayer, 22, 744–748, 755perceptron, 740–743probabilistic interpretation of,
743radial basis function, 758single layer, see perceptron
NEURAL-NET-HYPOTHESIS,742, 746
neurobiology, 898NEUROGAMMON, 189, 780neuron, 10, 16, 957neuroscience, 10–12, 737Nevill-Manning, C. G., 824, 830,
1025
Nevins, A. J., 312, 1025NEW-CLAUSE, 702NEW-LITERALS, 702, 703NEW-VARIABLE, 291Newborn, M. M., 131, 1027Newell, A., 3, 17, 18, 27, 56, 88,
130, 186, 187, 233, 234,286, 312, 366, 409, 456,708, 971, 1017, 1023,1025, 1035, 1037
Newman, P., 940, 1000Newton, I., 1, 45, 119, 122, 132,
541, 1025Newton–Raphson method, 122Ng, A. Y., 645, 783, 787, 858,
991, 1013, 1025Nguyen, X., 410, 411, 1025Niblett, T., 709, 996Nicholson, A., 579, 644, 999,
1025Nielsen, P. E., 312, 1012Niemela, I., 367Niemela, I., 1025Nigenda, R. S., 411, 1025Nilsson, D., 608, 1025Nilsson, N. J., 2, 27, 29, 55, 89,
130, 135, 187, 233, 267,268, 300, 314, 409, 456,457, 531, 708, 757, 940,945, 1002, 1005, 1008,1026, 1040
Nine-Men’s Morris, 182Niranjan, M., 568, 998NIST, 752nitroaromatic compounds, 706Nixon diamond, 359Nixon, R., 359, 820NLP (natural language
processing), 2, 790–862NO-SOLUTION-POSSIBLE, 399NOAH, 410, 456Nobel prize, 10, 11, 22Noda, I., 940, 1014NODE, 72node, search, 69noise, 657, 661–663, 686, 697,
712noisy-OR, 500nominative case, 806noncomputability, 8nondeterministic, see
environment, stochasticnonepisodic, 41nonholonomic, 905NONLIN, 410
Index 1067
NONLIN+, 455nonlinear plan, 410nonmonotonic logic, 358–360,
367nonmonotonicity, 358Nono, 280nonterminal symbol, 792, 793,
984normal distribution, 982normalization, 476NORMALIZE, 477, 506, 509, 515,
517Norman, D. A., 860, 991normative theory, 592North, O., 280North, T., 22, 1004Norvig, P., 27, 312, 327, 499, 580,
829, 1013, 1026, 1032notation
arithmetic, 4logical, 4
noughts and crosses, seetic-tac-toe
noun phrase, 792Nourbakhsh, I., 89, 1005Nowatzyk, A., 187, 1010Nowick, S. M., 309, 1026Nowlan, S. J., 133, 1009NP (hard problems), 978–979NP (Noun Phrase), 792NP-complete, 9, 66, 88, 139, 211,
212, 235, 367, 509, 696,758, 807, 884, 897, 979,979, 983
NSS chess program, 186nuclear power, 533number theory, 710Nunberg, G., 829, 1026Nussbaum, M. C., 7, 965, 1026Nygaard, K., 366, 991, 997
O() notation, 978O’Brien, S., 860, 1029O’Reilly, U.-M., 133, 1026O’Rorke, P., 709, 1041O-PLAN, 430, 455, 456object, 248
composite, 324object recognition, 873, 885–892object-oriented programming, 15,
351objective case, 806objective function, 110, 137objectivism, 472objects, 242
observable, 41observation model, 539, 626observation sentences, 6occupied space, 918occur check, 277, 290OCCUR-CHECK?, 278Ockham’s razor, 652, 673–675,
687, 703, 715Ockham, W., 652, 674octant, 883odometry, 904Office Assistant, 529offline search, 122Ogasawara, G., 579, 1010Ogawa, S., 11, 1026Oglesby, F., 309, 314, 1007Olalainty, B., 455, 1004Olawsky, D., 457, 1026Olesen, K. G., 529, 530, 987,
1026Oliver, R. M., 609, 1026Olshen, R. A., 674, 993Olson, C. F., 897, 1026Olum, P., 896, 1005omniscience, 36
logical, 343Omohundro, S., 859, 1037Oncina, J., 830, 994, 1026one-shot decision, see decision,
one-shotonline search, 122, 124ONLINE-DFS-AGENT, 125, 126,
127, 129ONTIC, 308ontological commitment, 242,
266, 464, 524ontological engineering, 320,
320–322ontology, 261, 264
upper, 321, 362OP, 278opacity, 342open class, 796Open Mind Initiative, 364open preconditions, 389, 448open world assumption, 403open-coding, 291open-loop, 61open-world assumption, 439operationality, 693, 693operations research, 10, 55, 89,
131, 456Oppacher, F., 133, 1026Oppen, D. C., 314, 1025OPS-5, 286, 312
optical character recognition, 794optical flow, 875, 894, 896optimal brain damage, 748optimal control theory, 132optimal controllers, 927optimal solution, see solution,
optimaloptimality (of a search algorithm),
71, 87optimality theory (Linguistics),
829optimally efficient algorithm, 101optimistic prior, 774optimizer, peephole, 429OPTIMUM-AIV, 455OR-SEARCH, 435, 435, 461orderability, 587ordering constraint, 389ORDERINGS, 424ordinal utility, see utility, ordinalOrganon, 233, 363Ormoneit, D., 786, 1026Ortony, A., 829, 1026Osawa, E., 940, 1014Osborne, M. J., 646, 1026Oscar, 458Osherson, D. N., 675, 1026Ostland, M., 579, 1027Othello, 162, 182OTTER, 306, 307, 307, 309, 314,
318Overbeek, R., 315, 1042overfitting, 662, 661–663, 712,
748overgeneration, 798Overmars, M., 941, 1013overriding, 352Owens, A. J., 133, 1003
P (probability vector), 469P controller, 928PAC, see probably approximately
correctpacked forest, 805packed tree, 833Page, C. D., 709, 996, 1026Page, L., 859, 993PAGERANK, 859Pak, I., 580, 1026Palay, A. J., 188, 1026Pallottino, S., 89, 1004Palmer, D. A., 861, 1026Palmer, S., 897, 1026Palmieri, G., 757, 1004Pang, C.-Y., 89, 1000
1068 Index
Panini, 16, 827Papadimitriou, C. H., 132, 133,
235, 644, 858, 897, 983,1000, 1014, 1016, 1026,1027
Papadopoulo, T., 896, 1002Papavassiliou, V., 786, 1027Papert, S., 22, 757, 1022PARADISE, 185paradox, 366, 607, 610parallel distributed processing, see
neural networkparallel lines, 865parallel search, 134parallelism
AND-, 292OR-, 292
parameter, 501, 716parameter independence, 722paramodulation, 304, 314Pardalos, P. M., 236, 1001Parekh, R., 830, 1027parent node, 69PARENT-NODE, 69, 70, 72Pareto dominated, 633Pareto optimal, 633Parisi, D., 830, 1001Parisi, G., 530, 1027parity function, 655Park, S., 309, 1008Parker, D. B., 757, 1027Parker, L. E., 942, 1027Parr, R., 787, 973, 1027, 1032Parrod, Y., 455, 987PARSE, 796, 798parse tree, 794parsing, 794, 798–805
bottom-up, 798chart, 800top-down, 798
part of, 324partial-order planning, 388,
387–395particle filtering, 566, 566, 578,
579PARTICLE-FILTERING, 566partition, 324Parzen window, 756Parzen, E., 756, 1027Pascal’s wager, 487, 607Pascal, B., 6, 9, 487Pasero, R., 267, 313, 996PASSIVE-ADP-AGENT, 768, 771PASSIVE-TD-AGENT, 769
Pasula, H., 531, 579, 580, 1020,1027
Paterson, M. S., 314, 1027path, 62, 87path consistency, 156path cost, 62, 87, 139path planning, 916PATH-COST, 69, 72PATHFINDER, 529Patil, R., 367, 804, 828, 995, 1001Patrick, B. G., 131, 1027Patten, T., 829, 1027pattern database, 108, 131
disjoint, 109pattern matching, 283Paul, R. P., 941, 1027Paull, M., 235, 1003payoff function, 163, 465Pazzani, M., 488, 755, 1000PCFG, see grammar, context-freePD controller, 928PDDL, 379, 409PDP, see parallel distributed
processingPeano axioms, 256, 267, 283Peano, G., 267, 1027Pearl, J., 26, 56, 95, 130–132,
158, 187, 188, 491, 493,499, 529–532, 611, 755,756, 999, 1005, 1014,1027, 1034
Pearson, J., 158, 1027PEAS description, 38, 40Pecheur, C., 309, 1008Pednault, E. P. D., 409, 458, 1027PEGASUS, 783, 784, 787, 789Peirce, C. S., 156, 267, 350, 366,
827, 828, 1027, 1028Peled, D., 315, 996Pelikan, M., 133, 1028Pell, B., 55, 456, 1024Pemberton, J. C., 134, 1028Penberthy, J. S., 410, 1028Peng, J., 786, 1028Pengi, 458penguin, 458Penix, J., 309, 1008PENMAN, 829Pennsylvania, U. of, 14Penrose, R., 950, 1028Peot, M., 457, 530, 1028, 1034percept, 32percept sequence, 32, 35perception, 31, 32, 258, 863–894perceptron, 21, 740, 755, 757
convergence theorem, 21representational power, 22, 761threshold, 740
PERCEPTRON-LEARNING, 742Pereira, F., 289, 291, 793, 827,
830, 1023, 1028, 1040Pereira, L. M., 291, 1040Peres, Y., 580, 1020performance element, 52, 53performance measure, 35, 35, 38,
463, 585Perl, 343perpetual punishment, 639perplexity, 836Perrault, C. R., 827, 996persistence action, 396persistence arc, 562persistent failure model, 562Person, C., 786, 1023perspective, 895perspective projection, 865, 874Peters, S., 828, 1000Peterson, C., 530, 1028Petrie, T., 579, 756, 989Pfeffer, A., 531, 646, 1015, 1028Pfeifer, G., 367, 1001phase transition, 235phenomenology, 953Philips, A. B., 132, 157, 1023Philo of Megara, 234philosophy, 5–7, 55, 947–967phone (speech), 568phone model, 572phone number, 343phoneme, 568phonetic alphabet, 569phonology, 568photogrammetry, 895, 896photometry, 867, 867–868photosensitive spot, 893phrase, 792phrase structure, 792, 827Picasso, P., 953Pickwick, Mr., 953PID controller, 929pigeons, 13Pijls, W., 188, 1028ping-pong, 31, 763pinhole camera, 865, 865–866Pinker, S., 242, 830, 1028Pisa, tower of, 53pit, bottomless, 197Pitts, W., 15, 16, 20, 236, 737,
738, 757, 1021Pitts, W. H., 893, 1018
Index 1069
pixel, 865PL-FC-ENTAILS?, 218, 219PL-RESOLUTION, 216, 216, 217PL-RESOLVE, 216PL-TRUE?, 206, 209, 236, 237PL-WUMPUS-AGENT, 226, 226,
231, 239Plaat, A., 188, 1028Place, U. T., 965, 1028Plamondon, P., 861, 1022plan
conditional, 454consistent, 390continuous, 446flaw, 448joint, 450library, 423monitoring, 441, 443nonlinear, 410recognition, 453
PLAN-ERS1, 455planetary rover, 901PLANEX, 457Plankalkul, 14PLANNER, 24, 312, 313, 442,
443, 796planning, 50, 185, 330, 375,
375–461and acting, 430–432as satisfiability, 402–406blocks world, 20case-based, 456classical, 375conditional, 431, 462conformant, 431contingency, 431continuous, 431, 445and execution, 445–449fine-motion, 924graph, 395, 395–402, 409
serial, 397heuristics, 394–395hierarchical, 422–430, 454hierarchical task network, 422history of, 409linear, 410multiagent, 449, 450multibody, 451, 451–452non-interleaved, 414partial-order, 388progression, 382reactive, 458regression, 385, 410route, 19search space, 382–387
sensorless, 431Plato, 233, 365, 964Plotkin, G., 314, 709, 1028Plunkett, K., 830, 1001ply, 163pneumatic actuation, 906Pnueli, A., 364, 1028Podelski, A., 313, 987poetry, 1Pohl, I., 89, 130, 1028point-to-point motion, 916pointwise product, 507POINTWISE-PRODUCT, 509poker hands, 489Poland, 365Polguere, A., 828, 1022policy, 458, 615, 643
iteration, 624, 624–625, 644asynchronous, 625modified, 625
loss, 623optimal, 615proper, 618search, 781, 781–783
POLICY-EVALUATION, 624POLICY-ITERATION, 624polite convention, 953Pollack, M. E., 410, 456, 458,
827, 996, 1012, 1042polytree, 509, 528, 546Pomerleau, D. A., 897, 1028Ponte, J. M., 859, 1029Poole, D., 2, 27, 55, 529, 531,
1029, 1043POP, 388, 390, 391, 393, 394,
408, 410, 425, 427, 428,448, 451, 452
POP-CON, 445Popper, K. R., 487, 675, 1029Porphyry, 366Port-Royal Logic, 584, 607Porter, M. F., 859, 1029Portuguese, 688pose, 873, 890pose estimation, 890–892Posegga, J., 315, 990positive example, 653positivism, logical, 6possibility axiom, 330possibility theory, 532, 532possible world, 201, 266, 366, 519Post, E. L., 234, 1029posterior probability, see
probability, conditionalpotential field, 921
Prade, H., 532, 1001Pradhan, M., 501, 1029pragmatic interpretation, 794,
815–817PRAGMATICS, 796pragmatics, 792Pratt, V. R., 364, 1029Prawitz, D., 311, 1029precision, 843precondition, 377
external, 423precondition axiom, 404predecessor, 80, 384predicate, 812predicate calculus, see logic,
first-orderpredicate indexing, 279predicate symbol, 246, 266PREDICT, 833predicting the future, 668prediction, 544, 578PREDICTOR, 801, 801, 802, 803preference, 465, 586, 588
monotonic, 589preference independence, 596,
611premise, 205president, 340Presley, E., 339Press, W. H., 132, 1029Prete, F., 896, 994Price Waterhouse, 455Price, B., 644, 992Prieditis, A. E., 108, 131, 135,
1024, 1029Princeton, 17Principia Mathematica, 17Prinz, D. G., 186, 1029prior knowledge, 651, 678, 688,
697prior probability, see probability,
priorPrior, A. N., 364, 1029PRIOR-SAMPLE, 511, 512, 513prioritized sweeping, 770, 786priority queue, 94, 788, 847prismatic joint, 905prisoner’s dilemma, 633prisoners, three, 491probabilistic context-free
grammar, see grammar,context-free, probabilistic
probabilistic language model, 834probabilistic network, see
Bayesian network
1070 Index
probabilistic roadmap, 923probability, 9, 26, 462–471,
492–536, 981–982alternatives to, 523assessment, 472axioms of, 471–473conditional, 465, 470, 470–471,
486, 496conjunctive, 496density function, 469, 982distribution, 184, 469, 504history, 488judgments, 498marginal, 475prior, 465, 468, 468–470, 486ranking principle, 841theory, 244, 464, 607
probably approximately correct,668, 671, 675
probit distribution, 503, 527, 530problem, 62, 87
n queens, 224airport-siting, 611assembly sequencing, 68bandit, 786contingency, 868-queens, 66, 888-puzzle, 105, 107, 130formulation, 60, 62–64frame, 365generator, 52halting, 275inherently hard, 978–979million queens, 150, 157missionaries and cannibals, 90monkey and bananas, 90, 412real-world, 64relaxed, 107, 107, 108, 386,
394robot navigation, 68solving, 22touring, 67toy, 64traveling salesperson, 68VLSI layout, 68, 115
procedural approach, 197procedural attachment, 348, 352PROCESS, 307, 307process, 337processes, 337–338PRODIGY, 456product rule, 470production, 46production system, 272, 286, 310PROGOL, 698, 705, 706, 709
program synthesis, 457programming language, 240projection, 330Prolog, 24, 289, 310, 410, 703,
827, 830parallel, 292
Prolog Technology TheoremProver (PTTP), 307, 314
pronunciation, 569pronunciation model, 572proof, 212
checker, 308procedure, 8
property (unary relation), 242proposition, 467
probabilistic, 467–468symbol, 204
propositional attitude, 341propositional logic, see logic,
propositionalpropositionalization, 274proprioceptive sensor, 904PROSPECTOR, 531Prosser, P., 157, 1029Protagoras, 827protection interval, see causal linkProust, M., 854Provan, G. M., 501, 1029PROVERB, 28PRS (Procedural Reasoning
System), 458pruning, 100, 162, 662
forward, 174futility, 181in contingency problems, 178in EBL, 693
Pryor, L., 457, 1029pseudo-experience, 770pseudocode, 985PSPACE, 979PSPACE-complete, 401, 409psychological reasoning, 369psychology, 12–14
experimental, 3, 12psychophysics, 898public key encryption, 309PUCCINI, 458Puget, J.-F., 709, 1031Pullum, G. K., 243, 793, 828, 830,
1010, 1029pure strategy, 632pure symbol, 221Puterman, M. L., 55, 644, 1029Putnam, H., 55, 221, 235, 300,
311, 488, 965, 998, 1029
Puzicha, J., 758, 897, 990puzzle, zebra, 159Pylyshyn, Z. W., 966, 1029
Q(a, s) (value of action in state),775
Q learning, see learning, Q
Q-LEARNING-AGENT, 776QA3, 267, 364, 409QALY, 593, 608QLISP, 314qualia, 956, 957, 966qualification problem, 431, 462,
951, 952qualitative physics, 327, 368qualitative probabilistic network,
532, 596quantified term, 814, 814quantifier, 249, 267
existential, 250–251in logic, 249–252nested, 251–252scope, 828universal, 249–250
quantization factor, 570quasi-logical form, 814, 828Qubic, 182query, 840query (logical), 254query language, 840query variable, 504queue, 71
FIFO, 73LIFO, 75priority, 94, 788, 847
Quevedo, T., 186quiescence, 174, 186Quillian, M. R., 366, 1029Quine, W. V., 267, 326, 363, 366,
1029Quinlan, E., 860, 1029Quinlan, J. R., 674, 677, 701, 703,
709, 1029, 1030Quirk, R., 828, 1030
R1, 24, 286, 312Rabani, Y., 133, 1030Rabideau, G., 455, 1004Rabiner, L. R., 580, 1030Rabinovich, Y., 133, 1030racing cars, 974radar, 10radial basis function, 758Radio Rex, 580Raghavan, P., 858, 1026
Index 1071
Raiffa, H., 10, 592, 597, 608, 646,1014, 1019
Rajan, K., 27, 55, 455, 1012Ramakrishnan, R., 312, 1030ramification, 380ramification problem, 332Ramsey, F. P., 9, 487, 608, 1030random restart, 136random set, 527random variable, 467, 497
continuous, 501, 529random walk, 540, 554RANDOM-SELECTION, 119randomization, 33, 48range finder, 903
laser, 904Rao, A., 56, 1042Rao, B., 579, 1010RAP, 458Raphael, B., 130, 312, 709, 991,
1007, 1008Raphson, J., 122, 132, 1030rapid prototyping, 289Raschke, U., 940, 996Rassenti, S., 646, 1030Ratio Club, 757rational agent, see agent, rationalrational thought, 4rationality, 1, 34–36
calculative, 972limited, 5perfect, 5, 972, 972
Ratner, D., 88, 1030rats, 13Rauch, H. E., 578, 579, 1030ray tracing, 868Rayner, M., 694, 1033Rayson, P., 859, 1018RBDTL, 697, 709RBFS, 101–103RBL, see relevance-based learningreactive layer, 933reactive planning, 458real-time AI, see artificial
intelligence, real-timereal-world problem, see problem,
real-worldreasoning, 19
default, 354–360, 523goal-directed, 185intercausal, 525logical, 211–239uncertain, 26, 795
Reboh, R., 314, 1032recall, 843
Rechenberg, I., 132, 1030reciprocal rank (in IR), 844recognition
brightness-based, 887feature-based, 888–890
recurrent network, 738, 758recursive definition, 703recursive estimation, 542RECURSIVE-BACKTRACKING,
142, 142RECURSIVE-BEST-FIRST-
SEARCH,102
RECURSIVE-DLS, 77, 77Reddy, R., 580, 1001, 1019reduct, 357reduction, 983redundant step, 447reference class, 472, 488reference controller, 927reference path, 927reference resolution, 821referential opacity, 366referential transparency, 342reflectance, 867, 880reflectance map, 881REFLEX-AGENT-WITH-STATE,
49REFLEX-VACUUM-AGENT, 46refutation, 211, 307, 311refutation completeness, 214, 300Regin, J., 157, 1030regression planner, see planningregression, linear, 720regret, 592Reichenbach, H., 488, 1030Reif, J., 941, 994, 1030reification, 323, 341REINFORCE, 783, 787, 789reinforcement, 650, 650, 763reinforcement learning, 650,
763–789, 952active, 771–777generalization in, 777–781
Reingold, E. M., 156, 991Reiss, M., 183Reiter, E., 829, 1030Reiter, R., 236, 365, 367, 644,
934, 992, 1018, 1030Reitman, W., 189, 1030rejection sampling, 512REJECTION-SAMPLING, 512, 513relation, 242relational probability model, 519
relaxed problem, see problem,relaxed
relevance, 207, 384, 689, 709relevance feedback, 845relevance-based learning, 689,
694–697, 707Remote Agent, 27, 55, 309, 407,
456REMOVE-FIRST, 71, 72, 83, 146REMOVE-FLAW, 449Remus, H., 189, 1030renaming, 281Renyi, A., 1030repeated game, 638, see game,
repeatedrepeated state, 81replanning, 431, 432, 441–445,
457REPLANNING-AGENT, 442REPOP, 410representation, see knowledge
representationrepresentation theorem, 596REPRODUCE, 119, 119REQUEST, 603Rescher, N., 364, 1030RESET-TRAIL, 291, 292resolution, 19, 21, 214, 213–217,
267, 295–311, 711closure, 217, 301completeness proof for, 300input, 305inverse, 703, 703–707, 709linear, 305strategies, 304–306
resolution closure, 217resolvent, 703resource
constraints, 420–422consumable, 420reusable, 420
resource (in planning), 420, 454resources, 417–422response, 13REST, 278, 288restaurant hygiene inspector, 180RESULT, 89rete, 286retina, 863RETRACT, 360, 361Reversi, 182revolute joint, 905reward, 54, 614, 643, 650, 763rewrite rule, 306, 318, 792, 984REWRITES-FOR, 801
1072 Index
Reynolds, C. W., 458, 1030rhetorical structure theory, 829Ribeiro-Neto, B., 859, 989Rice, T. R., 1022Rich, E., 2, 1030Richardson, M., 580, 1030Richardson, S., 530, 1005Rieger, C., 24, 829, 1031Riesbeck, C., 24, 312, 829, 995,
1033right association, 820right thing, doing the, 1, 5, 972Riley, M., 793, 1023Ringle, M., 966, 1031Rink, F. J., 532, 1024Rintanen, J., 457, 1031Ripley, B. D., 759, 1031risk aversion, 591risk neutrality, 591risk seeking, 591Rissanen, J., 675, 1031Rissland, E. L., 29, 1036Ristad, E. S., 833, 989Ritchie, G. D., 710, 1031Ritov, Y., 579, 1027Rivest, R., 675, 983, 997, 1031Robbins algebra, 309Roberts, L. G., 897, 1031Roberts, M., 186, 990Robertson, N., 158, 1031Robertson, S. E., 488, 859, 1031Robinson, A., 311Robinson, G., 314, 1042Robinson, J. A., 19, 235, 267,
295, 300, 312, 1031robot, 939
game (with humans), 945mobile, 901navigation, 68soccer, 57, 162, 458, 938
robotics, 3, 561cognitive, 365
ROC curve, 843Roche, E., 860, 1031Rochester, N., 17, 18, 1021Rock, I., 897, 1031Rockefeller Foundation, 860Romania, 59, 138Roossin, P., 860, 993Rorty, R., 965, 1031Rosenblatt, F., 21, 742, 757, 896,
1005, 1031Rosenblatt, M., 756, 1031Rosenblitt, D., 410, 1021
Rosenbloom, P. S., 27, 286, 312,456, 708, 971, 1017, 1037
Rosenblueth, A., 15, 1031Rosenbluth, A., 132, 530, 1022Rosenbluth, M., 132, 530, 1022Rosenfeld, E., 30, 988Rosenholtz, R., 880, 896, 1020Rosenschein, J. S., 646, 1031Rosenschein, S. J., 55, 236, 942,
1013, 1031Rosenthal, D. M., 966, 1031Ross, S. M., 488, 983, 1031Rossi, F., 156, 991rotation, 874Roussel, P., 267, 313, 996, 1031route finding, 67Rouveirol, C., 709, 1031Roveri, M., 411, 457, 990, 991,
996Rowat, P. F., 941, 1031Roweis, S. T., 579, 1031Rozonoer, L., 759, 987RPM, see relational probability
modelRSA (Rivest, Shamir, and
Adelman), 309Rubik’s cube, 88, 108, 875Rubin, D., 579, 756, 759, 1000,
1005, 1031Rubinstein, A., 646, 1026rule
condition–action, 46, 189default, 359dotted, 800if–then, 46, 205implication, 205schema, 809situation–action, 46uncertain, 524
RULE-ACTION, 47, 49rule-based system, 523, 951
with uncertainty, 524–525RULE-MATCH, 47, 49Rumelhart, D. E., 25, 757, 1031,
1032Ruspini, E. H., 532, 1032Russell, B., 6, 16, 17, 311, 1041Russell, J. G. B., 608, 1032Russell, S. J., 27, 131, 188, 295,
327, 499, 531, 579, 580,644, 645, 708, 709, 756,786, 787, 935, 940,971–973, 988, 991, 998,1001, 1010, 1013, 1020,
1024, 1025, 1027, 1032,1037, 1043
Russia, 21, 187, 471, 578Rustagi, J. S., 530, 1032Ruzzo, W. L., 828, 1006Ryder, J. L., 189, 1032Renyi, A., 487
S-set, 684Sabin, D., 157, 1032Sacerdoti, E. D., 314, 410, 456,
1032Sackinger, E., 758, 897, 1017Sacks, E., 368, 1032Sadri, F., 365, 1032Sag, I., 828, 830, 1012, 1032Sagalowicz, D., 314, 1032Sager, N., 828, 1032Sagiv, Y., 313, 989Sahami, M., 532, 858, 860, 1015,
1032, 1033Sahni, S., 89, 1010SAINT, 19St. Petersburg paradox, 607, 610Salisbury, J., 941, 1021Salmond, D. J., 579, 1006Salomaa, A., 858, 1033Salton, G., 755, 859, 1033SAM, 309, 314sample complexity, see
complexity, samplesample points, 468sampling, 511–516sampling rate, 570Samuel, A. L., 17, 18, 56, 181,
187, 780, 785, 786, 1033Samuelsson, C., 694, 1033Sanna, R., 757, 1004Sanskrit, 363, 827Santorini, B., 859, 1020SAPA, 455Sapir–Whorf hypothesis, 243Saraswat, V., 157, 1039Sastry, S., 55, 1009SAT-SOLVER, 403satisfiability, 211, 235, 402satisficing, 10Sato, T., 313, 531, 1033, 1037SATPLAN, 403, 403, 407–409,
411, 412, 416, 457, 705saturation, 301Saul, L. K., 530, 531, 580, 1012,
1033Saund, E., 858, 1033Savage, L. J., 474, 487, 608, 1033
Index 1073
SAY, 796Sayre, K., 947, 1033scaled orthographic projection,
866SCANNER, 801, 801, 802, 803Scarcello, F., 158, 313, 367, 1001,
1006scene, 865Schutze, H., 830, 859, 861Schabes, Y., 828, 860, 1031, 1033Schaeffer, J., 131, 182, 188, 189,
997, 1020, 1028, 1033Schank, R. C., 24, 829, 1033Schapire, R. E., 674, 1004, 1033Scharir, M., 941, 1033schedule, 418scheduling, 417–422Scheines, R., 755, 1036schema (in a genetic algorithm),
118Scherl, R., 365, 934, 1018Schickard, W., 6Schmolze, J. G., 367, 1033Schneeberger, J., 365, 1009Schnitzius, D., 456, 999Schoenberg, I. J., 757, 1024Schofield, P. D. A., 88, 1033Scholkopf, B., 757–759, 999,
1033Scholkopf, B., 997Schoning, T., 1033Schoppers, M. J., 458, 1033Schrag, R. C., 235, 990Schroder, E., 1033, 1044Schroder, E., 1033Schroder, E., 234Schubert, L. K., 364, 410, 828,
1005, 1011Schultz, W., 786, 1033Schulz, D., 994Schumann, J., 314, 1018Schutze, H., 1020, 1033Schwartz, J. T., 941, 1033Schwartz, S. P., 363, 1033Schwartz, W. B., 488, 1006Scholkopf, B., 759Schoning, T., 235scientific discovery, 675Scott, D., 531, 1034Scriven, M., 965, 1034scruffy vs. neat, 25search, 22, 50, 60, 87
A*, 97–101alpha–beta, 167–171, 185, 186B*, 188
backtracking, 141, 148–151,156, 898
beam, 115bidirectional, 79–131breadth-first, 73continuous space, 119–122, 132current-best-hypothesis, 680cutting off, 173–174depth-first, 75–77depth-limited, 77, 77for translations, 856general, 87greedy, 113greedy best-first, 95, 95heuristic, 73, 130hill-climbing, 111–114, 126in a CSP, 141–150informed, 73, 94, 94–105Internet, 346iterative deepening, 78, 78–79,
87, 89, 173, 307iterative deepening A*, 101,
131learning to, 104local, 110–119, 131–132, 157,
222–223, 235local beam, 115, 116local, for CSPs, 150–151memory-bounded, 101–104,
131memory-bounded A*, 103,
103–104, 131minimax, 165–168, 183, 185node, 69online, 123–129, 133–134parallel, 134partial information, 83, 87policy, 781, 781–783quiescence, 174real-time, 134, 171–175recursive best-first (RBFS),
101–103, 131repeated states, 81–83simulated annealing, 115stochastic beam, 116strategy, 69tabu, 132tree, 69uniform-cost, 75uninformed, 73, 73–74, 87, 89Viterbi, 576
search, backtracking, 76Searle, J. R., 12, 827, 954,
956–960, 965, 1034segmentation (of a sentence), 836
segmentation (of an image), 873segmentation (of speech), 574Sejnowski, T., 759, 780, 786,
1009, 1023, 1038SELECT-UNASSIGNED-
VARIABLE,144
Self, M., 756, 995Selfridge, M., 860, 991Selfridge, O. G., 17Selman, B., 132, 235, 367, 411,
1006, 1013, 1014, 1034semantic interpretation, 810–815,
828, 831semantic networks, 349–352, 362,
366Semantic Web, 364SEMANTICS, 796semantics, 29, 201
compositional, 810logical, 232preference, 829
semidecidable, 310semidecidable problem, 275semidynamic environment, 42semiotics, 827Sen, S., 786, 1026sensing
action, 431, 439active, 439, 440automatic, 439
sensitivity analysis, 606sensor, 32, 39, 863
active, 903failure, 561model, 539, 549, 554, 578, 626,
908passive, 903tactile, 863
sensorless planner, 431sentence
atomic, 204, 248, 253, 266complex, 204, 249, 266in a KB, 195, 232in a language, 792as physical configuration, 203quantified, 266
separator (in Bayes net), 482sequential
circuit, 227decision problem, 613–618,
644environment, 41, 41importance-sampling
resampling, 579
1074 Index
SEQUITUR, 824, 825, 830, 840serendipity, 444Sergot, M., 365, 1016serializable subgoals, 407Serina, I., 411, 1005Sestoft, P., 708, 1012set (in first-order logic), 256set of support, 305, 306SETHEO, 314Settle, L., 309, 314, 1007Seymour, P. D., 158, 1031SGP, 411, 457Shachter, R. D., 499, 529, 530,
593, 608, 645, 1034, 1038shading, 874, 880–881Shafer, G., 531, 532, 1034shaft decoder, 904Shahan, R. W., 966, 991Shahookar, K., 88, 1034Shakey, 19, 55, 409, 414, 457, 940Shalla, L., 314, 1042Shanahan, M., 365, 1034Shankar, N., 309, 1034Shannon, C. E., 17, 162, 186, 659,
674, 858, 1021, 1034shape, 874
context, 889from shading, 896from texture, 896
Shapiro, E., 709, 1034Shapiro, S. C., 30, 1034Shapley, S., 646, 1034Sharir, M., 941, 1007Sharp, D. H., 757, 997Shavlik, J., 675, 1034Shaw, J. C., 88, 186, 234, 1025Shawe-Taylor, J., 757, 759, 997Shazeer, N. M., 28, 158, 1019Shelley, M., 962, 1034Shenoy, P. P., 532, 1034Shewchuk, J., 940, 999Shi, J., 873, 1034Shieber, S. M., 830, 1028Shimelevich, L. I., 579, 1042Shin, M. C., 644, 1029Shmoys, D. B., 88, 421, 456,
1017, 1020Shoham, Y., 55, 314, 365, 608,
1017, 1034, 1035short-term memory, 286shortest path, 91Shortliffe, E. H., 23, 531, 994,
1035SHRDLU, 20, 23, 312, 381Shwe, M., 530, 1035
Sidner, C. L., 824, 830, 1007Siekmann, J., 315, 1035Sietsma, J., 758, 1035SIGART, 30SIGIR, 861sigmoid function, 503, 738signal processing, 569, 570signs, 790Siklossy, L., 456, 1035Silverstein, C., 847, 859, 1035Simard, P., 758, 897, 1017Simmons, R., 89, 829, 940, 1015,
1035Simon’s predictions, 21Simon, H. A., 3, 10, 17, 18, 29,
56, 88, 130, 180, 186, 187,234, 309, 315, 409, 710,973, 1017, 1025, 1035
Simon, J. C., 235, 1035Simons, P., 367, 1025SIMPLE-REFLEX-AGENT, 47simplex algorithm, 132SIMPLIFY, 307simulated annealing, 115, 132,
136, 157, 519SIMULATED-ANNEALING, 116,
222simulation of world, 955simultaneous localization and
mapping, 913Sinclair, A., 114, 133, 1019, 1030Singh, M. P., 56, 1011Singh, S. P., 134, 644, 786, 787,
989, 1011, 1013, 1037singly connected network, 509singular extension, 174singularity
technological, 963sins, seven deadly, 113SIPE, 455–458Sirovitch, L., 897, 1035situated agent, 952situatedness, 27situation, 329, 585situation calculus, 329, 328–335,
364SIZE, 119skeletonization, 916, 922SKETCHPAD, 156Skinner, B. F., 16, 55, 1035Skolem constant, 273, 311Skolem function, 296, 311Skolem, T., 267, 311, 1035skolemization, 273, 296slack, 418
Slagle, J. R., 19, 187, 1035slant, 874Slate, D. J., 89, 1035Slater, E., 186, 1035Sleator, D., 828, 1035sliding-block puzzle, 66Slocum, J., 829, 1035Sloman, A., 966, 1035Slovic, P., 2, 1013Smallwood, R. D., 645, 1035Smith, A., 9Smith, A. F. M., 579, 721, 756,
990, 1006, 1038Smith, B., 27, 55, 455, 1012Smith, D. E., 295, 313, 317, 411,
457, 1005, 1028, 1035,1036, 1040
Smith, D. R., 315, 1036Smith, J. M., 133, 1036Smith, J. Q., 608, 609, 1026, 1036Smith, R. C., 940, 1036Smith, R. G., 56, 993Smith, S. J. J., 183, 1036Smith, V., 646, 1030Smith, W. D., 188, 532, 989, 1024SMODELS, 367Smola, A. J., 759, 1033Smolensky, P., 25, 1036smoothing, 544–547, 575, 578,
835, 871online, 550
Smyth, P., 579, 1036SNARC, 17SNLP, 410snow, words for, 243SOAR, 27, 286, 312, 456, 708, 971social law, 452Socrates, 4Socratic reasoning, 308Soderland, S., 410, 1036softbot, 40softmax function, 782software agent, 40software architecture, 932Solomonoff, R. J., 17, 675, 1036SOLUTION, 72, 77, 83solution, 60, 62, 87, 390, 633
in planning, 378optimal, 62
solving games, 162–167soma, 11Somers, H., 830, 860, 997, 1011Sompolinsky, H., 757, 987sonar sensor, 903Sondik, E. J., 645, 1035, 1036
Index 1075
sonnet, 952Sosic, R., 157, 1036soul, 964sound (inference), 233soundness (of inference), 203sour grapes, 35Soutchanski, M., 365, 992Sowa, J., 369, 1036space complexity, see complexityspacecraft assembly, 455spam email, 861Sparck Jones, K., 488, 830, 859,
1007, 1031sparse system, 496SPASS, 314spatial reasoning, 368spatial substance, see substancespeaker, 790speaker identification, 571specialization, 680, 681spectrophotometry, 868–869specular reflection, 867speech act, 790, 790–791, 826,
827indirect, 791
speech recognition, 26, 549, 568,568–577, 580, 794
speech understanding, 568SPEECH-PART, 796spelling correction, 844, 859sphex wasp, 37, 444SPI (Symbolic Probabilistic
Inference), 529Spiegelhalter, D. J., 529, 530, 675,
755, 1005, 1017, 1022,1036
Spielberg, S., 964, 1036SPIKE, 456SPIN, 309spin glass, 757Spirtes, P., 755, 1036Springsteen, B., 961, 1036Sproull, R. F., 609, 1002Sputnik, 21SQL, 354square roots, 45SRI, 19, 267, 409, 608Srinivas, B., 828, 1000Srinivasan, A., 706, 709, 1026,
1036Srivas, M., 309, 1036Srivastava, B., 456, 1013SSD, see sum of squared
differencesSSS* algorithm, 188
stabilityof a controller, 928static, 906strict, 928
stable model, 357, 356–358stack, 75stack decoding, 858Stader, J., 455, 987STAGE, 132STAHL, 710Stallman, R. M., 157, 1036STAN, 411standardizing apart, 277, 316Stanfill, C., 756, 1036Stanford University, 17, 19, 22,
23, 267Stanhope Demonstrator, 234Staniland, J. R., 488, 998start symbol, 984STATE, 69, 72, 77, 83, 112state
belief, 437constraint, 380, 405current, in local search, 110initial, 139process, 337set, 437space, 62, 87space, metalevel, 104world, 60
state constraints, 405States, D. J., 756, 1011static (variable), 985static environment, 42stationarity, 541stationarity (for preferences), 617stationarity (in PAC learning), 668stationary distribution, 517, 544stationary process, 539, 538–542stationary processes, 538statistical mechanics, 25, 757STATLOG, 675Steel, S., 456, 458, 987Stefik, M., 369, 531, 1036Stein, J., 532, 1024Stein, L. A., 974, 1036Steinbach, M., 846, 1036Steiner, W., 940, 994stemming, 844step cost, 62STEP-COST, 72STEPS, 424stereogram, random dot, 896stereopsis, binocular, 874Stern, H. S., 759, 1005
Sternberg, M. J. E., 706, 707,1014, 1036, 1038
Stevens, K. A., 896, 1036Stickel, M. E., 307, 314, 829, 860,
1009, 1036stiff neck, 480Stiller, L. B., 182, 1036Stillings, N. A., 29, 1036stimulus, 13Stob, M., 675, 1026stochastic beam search, 116stochastic dominance, see
dominance, stochastic, 607stochastic environment, see
environment, stochasticstochastic gradient, 742stochastic hill-climbing, 113Stockman, G., 188, 1037Stoic school, 234, 364Stokes, I., 455, 987Stolcke, A., 859, 1037Stone, P., 458, 1037Stone, P. J., 674, 993Stone, P. T., 674, 1011stop word, 846STORE, 278, 316Stork, D. G., 759, 1001Story, W. E., 88, 1012Strachey, C., 14, 186, 189, 1037,
1038straight-line distance, 95Strat, T. M., 532, 1032strategic environment, 41strategy (in a game), 163, 632strategy profile, 632strawberries, enjoy, 949Striebel, C. T., 578, 579, 1030string (in a language), 791string (in logic), 342string theory, 335STRIPS, 377–379, 405, 409,
412–415, 417, 423, 425,451, 456–458, 644, 708
STRIPS assumption, 378Strohm, G., 455, 1003strong AI, 947, 952–960strong domination, 633Stuckey, P. J., 157, 158, 313, 314,
1011, 1020STUDENT, 19stuff, 327stupid pet tricks, 37Stutz, J., 756, 995stylometry, 861subcat, see subcategorization list
1076 Index
subcategorization, 808, 808–809list, 808
subevent, 335subgoal independence, 386subjective case, 806subjectivism, 472Subramanian, D., 368, 708, 973,
1032, 1037SUBST, 273, 288, 425substance, 327–328
spatial, 337temporal, 337
substitutability (of lotteries), 588substitution, 254, 273SUBSTRING, 119subsumption, 306
in description logic, 353in resolution, 306lattice, 279
subsumption architecture, 458,932
subtask sharing, 426successor function, 62, 139, 162SUCCESSOR-FN, 62, 72, 89successor-state axiom, 332successor-state axioms, 236, 365SUCCESSORS, 166, 170, 435Sugihara, K., 897, 1037Sugnet, C., 757, 993Sulawesi, 152sum of squared differences, 875sum of squared errors, 720SUMMATION, 977, 977, 978summer’s day, 953summing out, 508Sun Microsystems, 962Superman, 241, 341supervised learning, 650, 952support vector, 750, 751
machine, 675, 749, 749–753,759
virtual, 753sure thing, 591surface patches, 882Sussman anomaly, 410, 414Sussman, G. J., 157, 312, 410,
1036, 1037Sutherland, G. L., 22, 994Sutherland, I., 156, 1037Sutton, R. S., 644, 786–788, 989,
1037Svartvik, J., 828, 1030Svestka, P., 941, 1013Svetnik, V. B., 579, 1042SVM, see support vector machine
Swade, D. D., 14, 1037Swartz, R., 949, 994Swedish, 31Swerling, P., 578, 1037Swift, T., 313, 1037syllogism, 4, 310symbol splitting, 406symbolic differentiation, 318symbolic integration, 686synapse, 11synchro drive, 905synchronic knowledge, 258synchronization, 451synonymy, 347, 844syntactic ambiguity, 828syntactic sugar, 256syntactic theory (of knowledge),
342syntax, 24, 200
logical, 232synthesis, 309
deductive, 309synthesis of algorithms, 309Syrjanen, T., 367Syrjanen, T., 1025, 1037systemic grammar, 818systems reply, 959SYSTRAN, 851, 860Szathmary, E., 1036Szathmary, E., 133Szeliski, R., 875
T (s, a, s′) (transition model),614, 765
T (cat, i) (liquid event), 337T-SCHED, 455T4, 455table tennis, see ping-pongTABLE-DRIVEN-AGENT, 45, 45tabu search, 132TACAIR-SOAR, 312tactile sensors, 904Tadepalli, P., 709, 1037TAG (Tree-Adjoining Grammar),
828Tait, P. G., 88, 1037Take the Money and Run, 574Talos, 939Tamaki, H., 313, 858, 1026, 1037Tambe, M., 708, 1037Tanca, L., 312, 994Tank, D. W., 11, 1026Tarjan, R. E., 983, 1037Tarski, A., 8, 267, 828, 1037Tash, J. K., 644, 1037
task environment, 38, 38task network, 410Tasmania, 152Tate, A., 410, 412, 430, 455, 456,
987, 990, 1038Tatman, J. A., 645, 1038TAUM-METEO, 851, 860taxi, 38, 39
in Athens, 491automated, 53
taxonomic hierarchy, 24, 323taxonomy, 323, 347, 363Taylor expansion, 912Taylor, C., 675, 896, 999, 1022Taylor, R., 941, 1019Taylor, W., 9, 157, 235, 995TD, see temporal difference
learningTD-GAMMON, 182, 189teacher, 650telephone number, 343telescope, 534television, 790TELL, 195–197, 219, 269, 278,
361, 823Teller, A., 132, 530, 1022Teller, E., 132, 530, 1022Temperley, D., 828, 1035temporal difference learning,
767–771, 785temporal inference, 541–549temporal logic, 244, 364temporal probability models, 521temporal reasoning, 537–583temporal substance, see substancetemporal-difference equation, 769Tennenholtz, M., 786, 992tennis, 450, 453term (in logic), 248, 248term rewriting, 314terminal state, 163terminal symbol, 791, 984terminal test, 163TERMINAL-TEST, 166, 170, 173TERMINAL?, 768, 769, 776termination condition, 925Tesauro, G., 182, 189, 778, 780,
786, 1038test set, 660, 660TETRAD, 756Teukolsky, S. A., 132, 1029texel, 879texture, 874, 879, 879texture gradient, 879, 896Thagard, P., 29, 1038
Index 1077
Thaler, R., 608, 1038thee and thou, 796THEO, 971theorem, 255
incompleteness, 8theorem prover, 3, 306–310
as assistants, 308theorem proving, 409, 457
mathematical, 21, 31theory resolution, 314Theseus, 674Thielscher, M., 365, 1038thingification, 341thinking rationally, 4Thitimajshima, P., 531, 990Thomas, A., 530, 755, 1005Thomason, R. H., 828, 1038Thompson, D. W., 888, 1038Thompson, H., 860, 991Thompson, K., 187, 996Thompson, S. A., 829, 1020thought, see reasoning
laws of, 4thrashing, 1043SAT, 139threshold, 738Throop, T. A., 183, 1036Thrun, S., 365, 935, 940, 992,
994, 1003, 1023, 1038Tibshirani, R., 674, 756, 759,
1004, 1008tic-tac-toe, 163, 186, 189tiling, 748tilt, 874time, 364time complexity, see complexitytime expressions, 862time interval, 365, 370time slice (in DBNs), 538time to answer (in IR), 844Tinsley, M., 182Tirole, J., 646, 1004tit for tat, 639Titterington, D. M., 756, 1038TMS, see truth maintenance
systemToffler, A., 961, 1038tokenization, 849Tomasi, C., 876, 896, 1038tomato, 572top-down parsing, 798torque sensor, 904Torrance, M. C., 158, 1006Torras, C., 457, 1012total cost, 72
Touretzky, D. S., 367, 1038touring problem, 67toy problem, see problem, toytracking, 908tractability of inference, 353trading, 371tragedy of the commons, 641trail, 291training
curve, 748set, 656, 660, 673
replicated, 665weighted, 665
on test set, 661transfer model (in MT), 852transhumanism, 963transient failure, 561transition matrix, 536transition model, 539, 566, 578,
614, 643transition probability, 517transitivity (of preferences), 586,
587TRANSLATE-TO-SAT, 403translation model, 854transposition table, 171traveling salesperson problem, 68,
68, 88, 131, 135Traverso, P., 411, 457, 991, 996TREC, 847tree decomposition, 154tree width, 155, 158TREE-SEARCH, 70, 72, 73, 75,
82, 87, 94, 97, 99, 129treebank, 859trial, 765triangle tables, 457trichromatic perception, 869trigram, 575trihedral solid, 882TRIPLETS, 892Troyanskii, P., 860Trucco, E., 897, 1038truth, 201, 248
functionality, 524, 528preserving inference, 203table, 206, 234
truth maintenance system, 157,360, 360–362, 368, 966
assumption-based, 361, 368justification-based, 361
Tsang, E., 158, 1038Tsitsiklis, J. N., 644, 779,
786–788, 983, 991, 1020,1027, 1038
TSP, see traveling salespersonproblem
TT-CHECK-ALL, 209, 209TT-ENTAILS?, 208, 209, 221,
222, 226, 237Tumer, K., 646, 1038Tung, F., 578, 579, 1030tuple, 245turbo decoding, 531Turcotte, M., 706, 1038Turing award, 983Turing machine, 8, 675Turing Test, 2, 2–3, 5, 29, 30, 790,
948total, 3
Turing, A., 2, 8, 14, 16–18, 30,51, 162, 186, 275, 311,529, 757, 785, 853,948–950, 953, 958, 965,967, 975, 1038
Turk, 186Turtle, H. R., 859, 1038Tversky, A., 2, 498, 592, 1013,
1038TWEAK, 4102001: A Space Odyssey, 529two-finger Morra, 632TYPE, 796typical instance, 326Tyson, M., 860, 1009
U (utility), 585UCPOP, 410Ullman, J. D., 312, 313, 828, 983,
987, 989, 1030, 1039Ullman, S., 896, 897, 1011, 1039ultraintelligent machine, 963uncertainty, 23, 26, 321, 462,
462–491, 525, 952identity, 521reasoning with, see reasoningrelational, 521rule-based approach to, 523summarizing, 464and time, 537–541
unconditional probability, seeprobability, prior
undecidability, 8, 30undergeneration, 798unicorn, 238unification, 276, 276–277, 279,
310and equality, 303
unifier, most general (MGU), 277,277, 279, 303, 316
1078 Index
uniform convergence theory, 675uniform prior, 715uniform resource locator (URL),
345uniform-cost search, 75, 87UNIFY, 277, 278, 278, 282, 288,
291, 292, 304UNIFY-VAR, 278, 278, 291uninformed search, see search,
uninformedunique action axiom, 333unique names assumption, 333,
333, 355, 520unit clause, 214, 305unit preference, 305unit propagation, 222unit resolution, 214United States, 13, 27, 143, 580,
600, 609, 752, 753, 960,962
units function, 325universal grammar, 830Universal Instantiation, 273universal plan, 458unmanned air vehicle (UAV), 901unmanned land vehicle (ULV),
901UNPOP, 411unsupervised learning, see
learning, unsupervisedUOSAT-II, 455UPDATE-STATE, 49, 61, 796upper ontology, see ontology,
upperURP, 608Urquhart, A., 364, 1030Uskov, A. V., 187, 987Utgoff, P. E., 674, 686, 1023utilitarianism, 7UTILITY, 165, 166, 170utility, 51, 162, 465
expected, 56, 466, 584, 585,590
function, 51, 163, 584,588–593, 778
independence, 597maximum expected, 466of money, 589–591multi-attribute, 593–597multiplicative, 597node, 598normalized, 593ordinal, 591principle, 588scale, 591–593
theory, 465, 586–589, 607multiattribute, 607
utility function, 51utopia, 975utterance, 790UWL, 457
vacuum tube, 17vacuum world, 33–35, 57, 93,
433, 437, 788double Murphy, 434, 439triple Murphy, 436
Vaessens, R. J. M., 456, 1039vagueness, 524Valiant, L., 675, 1039validity, 210VALUE, 112, 116value determination, 788value function, 591
additive, 597value iteration, 618, 618–623,
643, 644value node, see utility nodevalue of computation, 972value of information, 600–604,
607, 612, 627, 772, 952,972
value of perfect information, 601VALUE-DETERMINATION, 768VALUE-ITERATION, 620, 621,
623, 920van Beek, P., 156–158, 988, 1015van Benthem, J., 364, 1039van Doorn, A. J., 896, 1015van Harmelen, F., 708, 1039van Heijenoort, J., 315, 1039van Nunen, J. A. E. E., 644, 1039van Roy, B., 787, 1039van Run, P., 143, 158, 988vanishing point, 865Van Emden, M. H., 313, 367,
1039Van Hentenryck, P., 157, 1039Van Roy, B., 779, 786, 1038Van Roy, P. L., 289, 292, 313,
1039Vapnik, V. N., 675, 757–759, 897,
992, 997, 1017, 1039Varaiya, P., 55, 787, 1003, 1016Vardi, M. Y., 313, 366, 1002, 1016variabilization (in EBL), 691variable
elimination, 507, 507–509, 528,529, 564
indicator, 727
in logic, 249ordering, 143
VARIABLE?, 278Varian, H. R., 646, 1039Vaucanson, J., 939Vazirani, U., 132, 675, 987, 1013Vecchi, M. P., 132, 157, 1014vector, 979vector quantization, 571vector space model, 847, 859Veloso, M., 708, 1039Vempala, S., 858, 1026verb phrase, 792Vere, S. A., 455, 1039verification, 309
hardware, 265Verma, T., 529, 755, 1005, 1027Verri, A., 897, 1038version space, 683, 684version space collapse, 685VERSION-SPACE-LEARNING,
683, 686VERSION-SPACE-UPDATE, 683,
683, 685vertex (of a chart), 800vertex (polyhedron), 882vervet monkeys, 790Vetterling, W. T., 132, 1029Vickrey auction, 642Vienna, 954Vigoda, E., 580, 1019Vinge, V., 963, 1039Viola, P., 897, 1039virtual counts, 722visibility graph, 941vision, 3, 5, 12, 19, 156, 865–894Visser, W., 309, 1008Vitanyi, P. M. B., 675, 1018Viterbi algorithm, 549Viterbi equation, 836VITERBI-SEGMENTATION, 837VLSI layout, 68, 88, 115vocal tract, 571Volk, K., 756, 1006von Mises, R., 487, 1039von Neumann, J., 9, 186, 608,
645, 1039von Stengel, B., 646, 1015von Winterfeldt, D., 608, 1039von Kempelen, W., 186von Linne, C., 363von Neumann, J., 9, 15, 17Voorhees, E. M., 860, 1039Voronoi graph, 922Vossen, T., 411, 1039
Index 1079
voted perceptron, 757VP (verb phrase), 792VPI, see value of perfect
information
Wadsworth, C. P., 267, 1006Waibel, A., 580, 1039Waldinger, R., 267, 314, 315, 410,
1020, 1032, 1039Walker, E., 28, 997Walker, H., 756, 1006WALKSAT, 150, 223, 223,
224–226, 235, 357, 363,406, 408, 411, 416
Wall, R., 828, 1000Wallace, D. L., 861, 1024Walras, L., 9Walsh, M. J., 133, 1003Walter, G., 940Waltz, D., 19, 156, 756, 884,
1036, 1039WAM, see Warren Abstract
Machine, 313Wang, E., 368, 1037Wanner, E., 243, 1039Warmuth, M., 88, 675, 991, 1030WARPLAN, 410, 457WARPLAN-C, 457Warren Abstract Machine, 291,
313Warren, D. H. D., 289, 291, 313,
410, 457, 793, 827, 1028,1040
Warren, D. S., 313, 1037washing clothes, 833Washington, G., 340Wasow, T., 828, 1032wasp, sphex, 37Watkins, C. J., 644, 786, 1040Watson, J., 13Watson, J. D., 120, 1040Watt, J., 15Wattenberg, M., 133, 1012wavelength, 868weak AI, 947weak domination, 633weak method, 22weather reports, 851Weaver, W., 659, 674, 858, 860,
1034Webber, B. L., 29, 830, 1007,
1012, 1040Weber, J., 579, 875, 1010Wefald, E. H., 131, 188, 972, 1032Wegbreit, B., 940, 1023
Wegman, M. N., 314, 1027Weidenbach, C., 314, 1040weighted linear function, 172WEIGHTED-MAJORITY, 667WEIGHTED-SAMPLE, 514, 515,
515Weiner, N., 860Weinstein, S., 675, 830, 1007,
1026Weisler, S., 29, 1036Weiss, G., 56, 458, 1040Weiss, S., 675, 860, 988, 1040Weiss, Y., 531, 1024, 1042Weizenbaum, J., 961, 966, 1040Weld, D. S., 56, 368, 410–412,
456, 457, 962, 989, 1001,1002, 1028, 1036, 1040
Wellman, M. P., 10, 531, 532, 608,644, 645, 941, 999, 1040
Wells, P., 28, 1000Werbos, P., 644, 757, 786, 1040Wermuth, N., 529, 1017Wertheimer, M., 896Wesley, L. P., 458, 1041Wesley, M. A., 941, 1040West, Col., 280Westinghouse, 455Weymouth, T., 940, 996Wheatstone, C., 895, 1040White, J. L., 309, 1008Whitehead, A. N., 16, 311, 690,
1040, 1041Whiter, A. M., 455, 1038Whitney, R. A., 829, 989Whorf, B., 243, 1041wide content, 956Widrow, B., 20, 757, 766, 785,
1041Widrow–Hoff rule, 778Wiener, N., 15, 162, 186, 578,
757, 1031, 1041Wilber, B. M., 314, 1032Wilcox, B., 189, 1030Wilczek, F., 758, 989Wilensky, R., 24, 827, 829, 959,
1041Wilfong, G. T., 940, 997Wilkins, D. E., 185, 455, 457,
458, 1041Wilks, Y., 829, 1041Williams, B., 55, 368, 456, 1024,
1025Williams, R., 610Williams, R. J., 644, 757, 783,
786, 787, 1028, 1031,
1041Williamson, M., 457, 1002Wilson, A., 859, 1018Wilson, R. A., 3, 29, 966, 1041Wilson, R. J., 156, 991Windows, 529Winker, S., 309, 314, 1042Winograd, S., 20, 1041Winograd, T., 20, 23, 312, 860,
991, 1037, 1041Winston, P. H., 2, 19, 674, 682,
1041Wirth, R., 709, 1041Witten, I. H., 824, 830, 858, 859,
1025, 1041Wittgenstein, L., 6, 203, 234, 326,
363, 827, 1041Wizard, 529Wohler, F., 953Wojciechowski, W. S., 309, 1041Wojcik, A. S., 309, 1041Wolf, A., 828, 1007Wolpert, D., 646, 1038Wong, A., 859, 1033Wood, D. E., 131, 1017Wood, M. K., 132, 1041Woods, T., 821Woods, W. A., 366, 828, 1041,
1042Wooldridge, M., 56, 1042Woolsey, K., 780word, 791word alignment vector, 857Wordnet, 860working memory, 708workspace, 917world model, in disambiguation,
821world state, see state, worldWorld War II, 10, 529, 578World Wide Web, 27, 344, 834,
840, 843, 845, 862worst possible catastrophe, 593Wos, L., 309, 314, 315, 1042wrapper (for Internet site), 348Wright, O. and W., 3Wright, S., 132, 528, 1042Wrightson, G., 315, 1035Wu, D., 829, 1042wumpus world, 197, 197–200,
208, 236, 258–260, 322,483–486, 491, 791
Wundt, W., 12, 895Wygant, R. M., 312, 1042
1080 Index
XCON, 286Xerox, 851XML, 364, 849xor, see exclusive orXTAG, 828
Yakimovsky, Y., 609, 1002Yale, 24Yamada, K., 856, 861, 1005, 1042Yan, D., 455, 1004Yang, C. S., 859, 1033Yang, Q., 412, 456, 1042Yannakakis, M., 133, 157, 990,
1027Yap, R. H. C., 313, 1011Yedidia, J., 531, 1042Yip, K. M.-K., 368, 1042Yngve, V., 828, 1042Yob, G., 236, 1042Yoshikawa, T., 941, 1042
Young, R. M., 456, 1042Young, S. J., 859, 1017Young, T., 868Younger, D. H., 828, 1042Yung, M., 88, 135, 987, 1008Yvanovich, M., 456, 999
Z-3, 14Zadeh, L. A., 532, 1042Zaidel, M., 828, 1000Zapp, A., 897, 1000Zaritskii, V. S., 579, 1042zebra puzzle, 159Zelle, J., 826, 830, 1042Zermelo, E., 645, 1042zero-sum game, 635Zhai, C., 859, 1017Zhang, L., 235, 1024Zhang, N. L., 529, 1043Zhang, W., 131, 1016
Zhao, Y., 235, 1024Zhivotovsky, A. A., 187, 987Zhixing, C., 183Zhou, R., 131, 1043Zhu, D. J., 941, 1043Zilberstein, S., 457, 971, 1007,
1043Zimmermann, H.-J., 532, 1043Zisserman, A., 896, 897, 1003,
1008, 1024Zlotkin, G., 646, 1031Zobrist, A. L., 189, 1043Zog, 687Zuckerman, D., 114, 1019Zuse, K., 14, 186, 1043Zweben, M., 456, 999Zweig, G., 580, 1043Zytkow, J. M., 710, 1017