IndexPage numbers inbold refer to definitions of terms and algorithms; page numbers initalics refer to items inthe bibliography.

Symbols∧ (and), 244χ2 (chi squared), 706| (cons list cell), 305⊢ (derives), 242≻ (determination), 784|= (entailment), 240ǫ-ball, 714∃ (there exists), 297∀ (for all), 295| (given), 485⇔ (if and only if), 244⇒ (implies), 244∼ (indifferent), 612λ (lambda)-expression,294¬ (not), 244∨ (or), 244≻ (preferred), 6127→ (uncertain rule), 548

AA(s) (actions in a state), 645A* search, 93–99AAAI (American Association for AI),

31Aarup, M., 432,1064Abbeel, P., 556, 857,1068, 1090Abbott, L. F., 763, 854,1070ABC computer, 14Abdennadher, S., 230,1073Abelson, R. P., 23, 921,1088Abney, S., 921,1064ABO (Asymptotic Bounded

Optimality), 1050Abramson, B., 110,1064absolute error,98abstraction,69, 677abstraction hierarchy,432ABSTRIPS, 432Abu-Hanna, A., 505,1081AC-3, 209Academy Award, 435accessibility relations,451accusative case, 899Acero, A., 922,1076Acharya, A., 112,1068Achlioptas, D., 277, 278,1064

Ackley, D. H., 155,1064acoustic model,913

in disambiguation, 906ACT, 336ACT*, 799acting rationally, 4action, 34,67, 108, 367

high-level,406joint, 427monitoring, 423, 424primitive, 406rational, 7, 30

action-utility function,627, 831action exclusion axiom,273, 428action monitoring, 423, 424action schema,367activation function,728active learning,831active sensing, 928active vision, 1025actor,426actuator,34, 41

hydraulic, 977pneumatic, 977

AD-tree, 826ADABOOST, 751adalines, 20Adams, J., 450Ada programming language, 14adaptive control theory,833, 854adaptive dynamic programming,834,

834–835, 853, 858adaptive perception, 985add-one smoothing, 863add list,368Adelson-Velsky, G. M., 192,1064Adida, B., 469,1064ADL (Action Description Language),

394admissible heuristic,94, 376Adorf, H.-M., 432,1077ADP (Adaptive Dynamic

Programming), 834adversarial search, 161adversarial task, 866adversary argument,149Advice Taker, 19, 23AFSM, 1003agent,4, 34, 59

active, 839architecture of, 26, 1047autonomous, 236components, 1044–1047decision-theoretic, 483, 610, 664–666goal-based, 52–53, 59, 60greedy,839hybrid,268intelligent, 30, 1036, 1044knowledge-based, 13, 234–236, 285,

1044learning, 54–57, 61logical, 265–274, 314model-based,50, 50–52online planning, 431passive, 832passive ADP, 858passive learning, 858problem-solving,64, 64–69rational,4, 4–5, 34, 36–38, 59, 60,

636, 1044reflex,48, 48–50, 59, 647, 831situated, 1025software agent,41taxi-driving, 56, 1047utility-based, 53–54, 59, 664vacuum, 37, 62–63wumpus, 238, 305

agent function,35, 647agent program,35, 46, 59Agerbeck, C., 228,1064Aggarwal, G., 682,1064aggregation,403Agichtein, E., 885,1064Agmon, S., 761,1064Agre, P. E., 434,1064agreement (in a sentence),900Aguirre, A., 278,1068Aho, A. V., 1059,1064AI, seeartificial intelligenceaircraft carrier scheduling, 434airport, driving to, 480airport siting, 622, 626AISB (Society for Artificial Intelligence

and Simulation of Behaviour),31

AI Winter, 24, 28Aizerman, M., 760,1064Al-Chang, M., 28,1064

1095

1096 Index

al-Khowarazmi, 8Alberti, L. B., 966Albus, J. S., 855,1064Aldiss, B., 1040Aldous, D., 154,1064Alekhnovich, M., 277,1064Alexandria, 15algorithm,8algorithmic complexity, 759Alhazen, 966alignment method,956Allais, M., 620, 638,1064Allais paradox, 620Alldiff constraint, 206Allen, B., 432,1072Allen, C., 638,1069Allen, J. F., 396, 431, 448, 470,1064alliance (in multiplayer games),166Allis, L., 194, 1064Almanac Game, 640Almuallim, H., 799,1064Almulla, M., 111,1085ALPAC., 922,1064Alperin Resnick, L., 457, 471,1066α (normalization constant), 497alpha–beta pruning,167, 199alpha–beta search, 167–171, 189, 191ALPHA-BETA-SEARCH, 170Alterman, R., 432,1064Altman, A., 195,1064altruism, 483Alvey report, 24AM, 800Amarel, S., 109, 115, 156, 468,1064ambient illumination,934ambiguity,287, 465, 861, 904–912, 919

lexical,905semantic,905syntactic,905, 920

ambiguity aversion,620Amir, E., 195, 278, 556,1064, 1070,

1086Amit, D., 761,1064analogical reasoning,799ANALOGY, 19, 31analysis of algorithms,1053Analytical Engine, 14analytical generalization, 799Anantharaman, T. S., 192,1076Anbulagan, 277,1080anchoring effect,621anchor text,463AND–OR graph, 257And-Elimination,250AND-OR-GRAPH-SEARCH, 136AND–OR tree,135

AND-SEARCH, 136Andersen, S. K., 552, 553,1064Anderson, C. R., 395, 433,1091Anderson, C. W., 855,1065Anderson, J. A., 761,1075Anderson, J. R., 13, 336, 555, 799,

1064, 1085AND node,135Andoni, A., 760,1064Andre, D., 156, 855, 856,1064, 1070,

1079ANGELIC-SEARCH, 414angelic semantics, 431answer literal,350answer set programming, 359antecedent, 244Anthony, M., 762,1064anytime algorithm,1048Aoki, M., 686,1064aortic coarctation,634apparent motion, 940appearance, 942appearance model,959Appel, K., 227,1064Appelt, D., 884, 921,1064, 1075, 1076APPEND, 341applicable,67, 368, 375apprenticeship learning,857, 1037approximate near-neighbors,741Apt, K. R., 228, 230,1064Apte, C., 884,1064Arbuthnot, J., 504,1064arc consistency,208Archibald, C., 195,1064architecture,46

agent, 26, 1047cognitive,336for speech recognition, 25hybrid, 1003,1047parallel, 112pipeline,1005reflective,1048rule-based, 336three-layer,1004

arc reversal,559Arentoft, M. M., 432,1064argmax, 1059argmax, 166argument

from disability, 1021–1022from informality, 1024–1025

Ariely, D., 619, 638,1064Aristotle, 4–7, 10, 59, 60, 275, 313, 468,

469, 471, 758, 966, 1041arity, 292, 332Arkin, R., 1013,1064

Arlazarov, V. L., 192,1064Armando, A., 279,1064Arnauld, A., 7, 636,1064Arora, S., 110,1064ARPAbet, 914artificial flight, 3Artificial General Intelligence,27artificial intelligence,1, 1–1052

applications of, 28–29conferences, 31foundations, 5–16, 845future of, 1051–1052goals of, 1049–1051history of, 16–28journals, 31philosophy of, 1020–1043possibility of, 1020–1025programming language, 19real-time,1047societies, 31strong,1020, 1026–1033, 1040subfields, 1as universal field, 1weak,1020, 1040

artificial life, 155artificial urea, 1027Arunachalam, R., 688,1064Asada, M., 195, 1014,1078asbestos removal, 615Ashby, W. R., 15,1064Asimov, I., 1011, 1038,1064ASKMSR, 872, 873, 885assertion (logical),301assignment (in a CSP),203associative memory,762assumption,462Astrom, K. J., 156, 686,1064astronomer, 562asymptotic analysis,1054, 1053–1054asymptotic bounded optimality,1050Atanasoff, J., 14Atkeson, C. G., 854,1083Atkin, L. R., 110,1089atom,295atomic representation,57, 64atomic sentence, 244,295, 294–295,

299attribute,58attribute-based extraction,874auction,679

ascending-bid,679Dutch, 692English,679first-price, 681sealed-bid,681

second-price,681

Index 1097

truth-revealing,680Vickrey, 681

Audi, R., 1042,1064Auer, S., 439, 469,1066augmentation, 919augmented finite state machine

(AFSM), 1003augmented grammar,897AURA, 356, 360Austin, G. A., 798,1067Australia, 203, 204, 216authority,872AUTOCLASS, 826automata, 1035, 1041automated debugging, 800automated taxi, 40, 56, 236, 480, 694,

695, 1047automobile insurance, 621Auton, L. D., 277,1069autonomic computing,60autonomous underwater vehicle (AUV),

972autonomy,39average reward,650Axelrod, R., 687,1064axiom,235, 302

action exclusion,273, 428of Chinese room, 1032decomposability, 614domain-specific, 439effect axiom,266frame axiom,267Kolmogorov’s, 489of number theory, 303of probability, 489Peano,303, 313, 333precondition, 273of probability, 488–490, 1057of set theory, 304successor-state,267, 279, 389of utility theory, 613wumpus world, 305

axon, 11

Bb∗ (branching factor), 103B* search, 191Baader, F., 359, 471,1064Babbage, C., 14, 190Bacchus, F., 228, 230, 505, 555, 638,

1064, 1065bachelor, 441Bachmann, P. G. H., 1059,1065BACK-PROP-LEARNING, 734back-propagation, 22,24, 733–736, 761

backgammon, 177–178, 186, 194, 846,850

background knowledge,235, 349, 777,1024, 1025

background subtraction,961backing up (in a search tree),99, 165backjumping,219, 229backmarking,229backoff model,863BACKTRACK, 215backtracking

chronological, 218dependency-directed,229dynamic,229intelligent, 218–220, 262

BACKTRACKING-SEARCH, 215backtracking search, 87,215, 218–220,

222, 227Backus, J. W., 919,1065Backus–Naur form (BNF),1060backward chaining,257, 259, 275,

337–345, 358backward search for planning, 374–376Bacon, F., 6bagging,760Bagnell, J. A., 852, 1013,1065bag of words,866, 883Baird, L. C. I., 685,1092Baker, J., 920, 922,1065Balashek, S., 922,1070Baldi, P., 604,1065Baldwin, J. M., 130,1065Ball, M., 396,1091Ballard, B. W., 191, 200,1065Baluja, S., 155, 968,1065, 1087Bancilhon, F., 358,1065bandit problem,840, 855Banerji, R., 776, 799,1082bang-bang control,851Bangera, R., 688,1092Banko, M., 28, 439, 469, 756, 759, 872,

881, 885,1065, 1072Bar-Hillel, Y., 920, 922,1065Bar-Shalom, Y., 604, 606,1065Barifaijo, E., 422,1077Barry, M., 553,1076Bartak, R., 230,1065Bartlett, F., 13Bartlett, P., 762, 855,1064, 1065Barto, A. G., 157, 685, 854, 855, 857,

1065, 1067, 1090Barwise, J., 280, 314,1065baseline,950basic groups, 875Basin, D. A., 191,1072basis function,845

Basye, K., 1012,1070Bates, E., 921,1071Bates, M. A., 14, 192,1090Batman, 435bats, 435Baum, E., 128, 191, 761, 762,1065Baum, L. E., 604, 826,1065Baumert, L., 228,1074Baxter, J., 855,1065Bayardo, R. J., 229, 230, 277,1065Bayer, K. M., 228,1086Bayerl, S., 359,1080Bayes’ rule, 9,495, 495–497, 503, 508Bayes, T., 495, 504,1065Bayes–Nash equilibrium,678Bayesian, 491Bayesian classifier, 499Bayesian learning, 752,803, 803–804,

825Bayesian network, 26,510, 510–517,

551, 565, 827dynamic,590, 590–599hybrid,520, 552inference in, 522–530learning hidden variables in, 824learning in, 813–814multi-entity, 556

Bayes Net toolkit, 558Beal, D. F., 191,1065Beal, J., 27,1065Beame, P., 277,1064beam search, 125,174Bear, J., 884,1075Beber, G., 30,1071Beckert, B., 359,1065beer factory scheduling, 434Beeri, C., 229,1065beetle, dung, 39, 61, 424, 1004behaviorism,12, 15, 60Bekey, G., 1014,1065belief, 450, 453

degree of,482, 489desires and, 610–611

belief function,549belief network,seeBayesian networkbelief propagation, 555belief revision,460belief state,138, 269, 415, 480

in game theory, 675probabalistic, 566,570wiggly, 271

belief update,460Bell, C., 408, 431,1065Bell, D. A., 826,1068Bell, J. L., 314,1065Bell, T. C., 883, 884,1092

1098 Index

BELLE, 192Bell Labs, 922Bellman, R. E., 2, 10, 109, 110, 194,

652, 685, 760,1065Bellman equation,652Bellman update,652Belongie, S., 755, 762,1065Ben-Tal, A., 155,1065benchmarking,1053Bendix, P. B., 359,1078Bengio, S., 604,1089Bengio, Y., 760, 1047,1065BENINQ, 472Bennett, B., 473,1069Bennett, F. H., 156,1079Bennett, J., 360,1074Bentham, J., 637,1065Berger, H., 11Berger, J. O., 827,1065Berkson, J., 554,1065Berlekamp, E. R., 113, 186,1065Berleur, J., 1034,1065Berliner, H. J., 191, 194, 198,1065Bernardo, J. M., 811,1065Berners-Lee, T., 469,1065Bernoulli, D., 617, 637,1065Bernoulli, J., 9, 504Bernoulli, N., 641Bernstein, A., 192,1065Bernstein, P. L., 506, 691,1065Berrou, C., 555,1065Berry, C., 14Berry, D. A., 855,1065Bertele, U., 553,1066Bertoli, P., 433,1066Bertot, Y., 359,1066Bertsekas, D., 60, 506, 685, 857, 1059,

1066BESM, 192Bessiere, C., 228,1066best-first search,92, 108best possible prize, 615beta distribution, 592,811Betlem, H., 422,1077Betlem, J., 422,1077betting game, 490Bezzel, M., 109BGBLITZ , 194Bhar, R., 604,1066Bialik, H. N., 908bias, declarative,787Bibel, W., 359, 360,1066, 1080Bickford, M., 356,1089biconditional,244Biddulph, R., 922,1070bidirectional search, 90–112

Bidlack, C., 1013,1069Biere, A., 278,1066Bigelow, J., 15,1087Bigham, J., 885,1085bilingual corpus,910billiards, 195Billings, D., 678, 687,1066Bilmes, J., 604,1080, 1086binary decision diagram,395binary resolution,347Binder, J., 604, 605, 826,1066, 1087binding list,301Binford, T. O., 967,1066Binmore, K., 687,1066binocular stereopsis,949, 949–964binomial nomenclature, 469bioinformatics, 884biological naturalism,1031Birbeck, M., 469,1064Bishop, C. M., 155, 554, 759, 762, 763,

827,1066Bishop, M., 1042,1086Bishop, R. H., 60,1071Bisson, T., 1042,1066Bistarelli, S., 228,1066Bitman, A. R., 192,1064Bitner, J. R., 228,1066Bizer, C., 439, 469,1066Bjornsson, Y., 194,1088BKG (backgammon program), 194BLACKBOX , 395Blake, A., 605,1077Blakeslee, S., 1047,1075Blazewicz, J., 432,1066Blei, D. M., 883,1066Blinder, A. S., 691,1066blind search,seesearch, uninformedBliss, C. I., 554,1066Block, H. D., 20,1066blocks world, 20, 23,370, 370–371, 472BLOG, 556bluff, 184Blum, A. L., 395, 752, 761, 885,1066Blumer, A., 759,1066BM25 scoring function,868, 884BNF (Backus–Naur form), 1060BO, 1050Bobick, A., 604,1077Bobrow, D. G., 19, 884,1066Boddy, M., 156, 433, 1048,1070, 1074Boden, M. A., 275, 1042,1066body (of Horn clause),256boid,429, 435Bolognesi, A., 192,1066Boltzmann machine,763Bonaparte, N., 190

Boneh, D., 128,1065Bonet, B., 156, 394, 395, 433, 686,

1066, 1075Bongard, J., 1041,1085Boole, G., 7, 8, 276,1066Boolean keyword model, 867boosting,749, 760Booth, J. W., 872Booth, T. L., 919,1066bootstrap, 27, 760Borel, E., 687,1066Borenstein, J., 1012, 1013,1066Borgida, A., 457, 471,1066Boroditsky, L., 287,1066Boser, B., 760, 762,1066, 1080BOSS, 28, 1007, 1008, 1014Bosse, M., 1012,1066Botea, A., 395,1075Bottou, L., 762, 967,1080boundary set,774bounded optimality (BO),1050bounded rationality,1049bounds consistent,212bounds propagation,212Bourlard, H., 604,1089Bourzutschky, M., 176,1066Boutilier, C., 434, 553, 686,1066Bouzy, B., 194,1066Bowden, B. V., 14, 192,1090Bower, G. H., 854,1075Bowerman, M., 314,1066Bowling, M., 687,1066, 1091, 1093Box, G. E. P., 155, 604,1066BOXES, 851Boyan, J. A., 154, 854,1066Boyd, S., 155,1066Boyden, E., 11,1074Boyen, X., 605,1066Boyen–Koller algorithm, 605Boyer, R. S., 356, 359, 360,1066Boyer–Moore theorem prover, 359, 360Boyle, J., 360,1092Brachman, R. J., 457, 471, 473,1066,

1067, 1080Bradshaw, G. L., 800,1079Bradtke, S. J., 157, 685, 854, 855,1065,

1067Brady, J. M., 604,1084Brafman, O., 638,1067Brafman, R., 638,1067Brafman, R. I., 433, 434, 855,1066,

1067, 1076Brahmagupta, 227brain, 16

computational power, 12computer vs., 12

Index 1099

damage, optimal,737replacement, 1029–1031, 1043super, 9in a vat, 1028

brains cause minds, 11Braitenberg, V., 1013,1067branching factor,80, 783

effective,103, 111, 169Bransford, J., 927,1067Brants, T., 29, 883, 921,1067, 1072Bratko, I., 112, 359, 793,1067Bratman, M. E., 60, 1041,1067Braverman, E., 760,1064BREADTH-FIRST-SEARCH, 82breadth-first search,81, 81–83, 108, 408Breese, J. S., 61, 553, 555, 639, 1048,

1067, 1076, 1091Breiman, L., 758, 760,1067Brelaz, D., 228,1067Brent, R. P., 154,1067Bresina, J., 28,1064Bresnan, J., 920,1067Brewka, G., 472,1067Brey, R., 637,1086Brickley, D., 469,1067bridge (card game), 32,186, 195Bridge Baron, 189Bridle, J. S., 761,1067Briggs, R., 468,1067brightness, 932Brill, E., 28, 756, 759, 872, 885,1065Brin, D., 881, 885, 1036,1067Brin, S., 870, 880, 884,1067Bringsjord, S., 30,1067Brioschi, F., 553,1066Britain, 22, 24Broadbent, D. E., 13,1067Broadhead, M., 885,1065Broca, P., 10Brock, B., 360,1076Brokowski, M., 156,1092Brooks, M. J., 968,1076Brooks, R. A., 60, 275, 278, 434, 1003,

1012, 1013, 1041,1067, 1085Brouwer, P. S., 854,1065Brown, C., 230,1067Brown, J. S., 472, 800,1070, 1080Brown, K. C., 637,1067Brown, M., 604,1079Brown, P. F., 922,1067Brownston, L., 358,1067Bruce, V., 968,1067Brunelleschi, F., 966Bruner, J. S., 798,1067Brunnstein, K., 1034,1065Brunot, A., 762, 967,1080

Bryant, B. D., 435,1067Bryce, D., 157, 395, 433,1067Bryson, A. E., 22, 761,1067Buchanan, B. G., 22, 23, 61, 468, 557,

776, 799,1067, 1072, 1080Buckley, C., 870,1089Buehler, M., 1014,1067BUGS, 554, 555BUILD , 472Bulfin, R., 688,1086bunch,442Bundy, A., 799,1091Bunt, H. C., 470,1067Buntine, W., 800,1083Burch, N., 194, 678, 687,1066, 1088Burgard, W., 606, 1012–1014,1067,

1068, 1072, 1088, 1090Burges, C., 884,1090burglar alarm, 511–513Burkhard, H.-D., 1014,1091Burns, C., 553,1083Buro, M., 175, 186,1067Burstein, J., 1022,1067Burton, R., 638,1067Buss, D. M., 638,1067Butler, S., 1042,1067Bylander, T., 393, 395,1067Byrd, R. H., 760,1067

Cc (step cost), 68Cabeza, R., 11,1067Cabral, J., 469,1081caching,269Cafarella, M. J., 885,1065, 1067, 1072Cajal, S., 10cake, eating and having, 380calculus, 131calculus of variations, 155Calvanese, D., 471,1064, 1067Cambefort, Y., 61,1075Cambridge, 13camera

digital, 930, 943for robots, 973pinhole,930stereo, 949, 974time of flight,974video, 929, 963

Cameron-Jones, R. M., 793,1086Campbell, M. S., 192,1067, 1076Campbell, W., 637,1068candidate elimination,773can machines think?,1021Canny, J., 967, 1013,1068

Canny edge detection, 755, 967canonical distribution,518canonical form,80Cantor, C. R., 553,1093Cantu-Paz, E., 155,1085Capek, K., 1011, 1037Capen, E., 637,1068Caprara, A., 395,1068Carbone, R., 279,1064Carbonell, J. G., 27, 432, 799,1068,

1075, 1091Carbonell, J. R., 799,1068Cardano, G., 9, 194, 503,1068card games, 183Carin, L., 686,1077Carlin, J. B., 827,1073Carlson, A., 288,1082CARMEL, 1013Carnap, R., 6, 490, 491, 504, 505, 555,

1068Carnegie Mellon University, 17, 18Carpenter, M., 432,1070Carreras, X., 920,1079Carroll, S., 155,1068Carson, D., 359,1092cart–pole problem,851Casati, R., 470,1068cascaded finite-state transducers,875case-based reasoning, 799case agreement,900case folding,870case statement (in condition plans), 136Cash, S. S., 288,1087Cassandra, A. R., 686,1068, 1077Cassandras, C. G., 60,1068Casteran, P., 359,1066Castro, R., 553,1068categorization, 865category,440, 440–445, 453causal network,seeBayesian networkcausal probability,496causal rule,317, 517causation, 246, 498caveman, 778Cazenave, T., 194,1066CCD (charge-coupled device), 930, 969cell decomposition, 986,989

exact,990cell layout, 74center (in mechanism design),679central limit theorem,1058cerebral cortex, 11certainty effect,620certainty equivalent,618certainty factor, 23,548, 557Cesa-Bianchi, N., 761,1068

1100 Index

Cesta, A., 28,1068CGP, 433CHAFF, 277Chafin, B., 28,1064chain rule (for differentiation),726chain rule (for probabilities),514Chakrabarti, P. P., 112, 157,1068, 1069Chambers, R. A., 851, 854,1082chance node (decision network),626chance node (game tree),177chance of winning, 172Chandra, A. K., 358,1068Chang, C.-L., 360,1068Chang, K.-M., 288,1082Chang, K. C., 554,1073channel routing, 74Chapman, D., 394, 434,1064, 1068Chapman, N., 109characters,861Charest, L., 28,1064charge-coupled device, 930, 969Charniak, E., 2, 23, 358, 556, 557, 604,

920, 921,1068chart parser,893, 919Chase, A., 28,1064chatbot, 1021Chater, N., 638,1068, 1084Chatfield, C., 604,1068Chatila, R., 1012,1083Chauvin, Y., 604,1065checkers, 18, 61, 186, 193, 850checkmate

accidental,182guaranteed,181probabilistic,181

Cheeseman, P., 9, 26, 229, 277, 557,826, 1012,1068, 1089

Chekaluk, R., 1012,1070chemistry, 22Chen, R., 605,1080Chen, S. F., 883,1068Chen, X., 395,1091Cheng, J., 554, 826,1068Cheng, J.-F., 555,1082Chervonenkis, A. Y., 759,1091chess, 172–173, 185–186

automaton, 190history, 192prediction, 21

Chess, D. M., 60,1078CHESS4.5, 110χ2 pruning,706Chickering, D. M., 191, 826,1075, 1079Chien, S., 431,1073CHILD -NODE, 79CHILL , 902

chimpanzee, 860Chinese room, 1031–1033CHINOOK, 186, 193, 194Chklovski, T., 439,1068choice point,340Chomsky, C., 920,1074Chomsky, N., 13, 16, 883, 889, 919,

921, 923,1068Chomsky Normal Form,893, 919Chopra, S., 762,1086Choset, H., 1013, 1014,1068Choueiry, B. Y., 228,1086Christmas, 1026chronicles, 470chronological backtracking, 218cHUGIN, 554Chung, K. L., 1059,1068Chung, S., 278,1092chunking, 799Church, A., 8, 314, 325, 358,1068Church, K., 883, 894, 920, 923,1068Churchland, P. M., 1042,1068Churchland, P. S., 1030, 1042,1068Ciancarini, P., 60, 192,1066, 1068CIGOL, 800Cimatti, A., 396, 433,1066, 1068circuit verification,312circumscription,459, 468, 471

prioritized,459city block distance, 103Claessen, K., 360,1090clairvoyance, 184Clamp, S. E., 505,1070Clapp, R., 637,1068Clark, A., 1025, 1041,1068Clark, K. L., 472,1068Clark, P., 800,1068Clark, S., 920, 1012,1068, 1071Clark completion, 472Clarke, A. C., 552, 1034,1068Clarke, E., 395,1068Clarke, M. R. B., 195,1068CLASSIC, 457, 458classification (in description logic),456classification (in learning),696class probability,764clause,253Clearwater, S. H., 688,1068CLINT , 800Clocksin, W. F., 359,1068closed-world assumption,299, 344, 417,

468, 541closed class,890closed list,seeexplored setCLP, 228, 345CLP(R), 359

clustering, 553,694, 817, 818clustering (in Bayesian networks),529,

529–530clutter (in data association),602CMAC, 855CMU, 922CN2, 800CNF (Conjunctive Normal Form), 253CNLP, 433co-NP,1055co-NP-complete, 247, 276,1055Coarfa, C., 278,1068coarticulation,913, 917coastal navigation,994Coates, A., 857,1068Coates, M., 553,1068Cobham, A., 8,1068Cocke, J., 922,1067coercion, 416cognitive

architecture,336cognitive architecture,336cognitive modeling, 3cognitive psychology,13cognitive science,3Cohen, B., 277,1088Cohen, C., 1013,1069Cohen, P. R., 25, 30, 434,1069Cohen, W. W., 800,1069Cohn, A. G., 473,1069coin flip, 548, 549, 641COLBERT, 1013Collin, Z., 230,1069Collins, A. M., 799,1068Collins, F. S., 27,1069Collins, M., 760, 920, 921,1069, 1079,

1093collusion,680Colmerauer, A., 314, 358, 359, 919,

1069Colombano, S. P., 155,1080color, 935color constancy,935combinatorial explosion, 22commitment

epistemological,289, 290, 313, 482ontological,289, 313, 482, 547

common sense, 546common value, 679communication, 286, 429, 888commutativity (in search problems),214Compagna, L., 279,1064competitive ratio,148compilation, 342, 1047complementary literals,252complete-state formulation,72

Index 1101

complete assignment,203complete data,806completeness

of inference, 247of a proof procedure,242, 274of resolution, 350–353of a search algorithm,80, 108

completing the square,586completion (of a data base),344complexity, 1053–1055

sample,715space,80, 108time,80, 108

complexity analysis,1054complex phrases, 876complex sentence,244, 295complex words, 875compliant motion,986, 995component (of mixture distribution),

817composite decision process, 111composite object,442compositionality,286compositional semantics,901compression, 846computability, 8computational learning theory, 713,714,

762computational linguistics,16computer, 13–14

brain vs., 12computer vision,3, 12, 20, 228,

929–965conclusion (of an implication),244concurrent action list,428condensation, 605Condie, T., 275,1080condition–action rule, 633conditional distributions, 518conditional effect,419conditional Gaussian,521conditional independence,498, 502,

503, 517–523, 551, 574conditional plan, 660conditional probability,485, 503, 514conditional probability table (CPT),512conditional random field (CRF),878conditioning,492conditioning case,512Condon, J. H., 192,1069configuration space, 986,987confirmation theory,6, 505conflict-directed backjumping,219, 227conflict clause learning, 262conflict set,219

conformant planning, 415, 417–421,431,433, 994

Congdon, C. B., 1013,1069conjugate prior,811conjunct, 244conjunction (logic),244conjunctive normal form,253, 253–254,

275, 345–347conjunct ordering,333Conlisk, J., 638,1069connected component,222Connect Four, 194connectionism,24, 727connective, logical, 16, 244, 274, 295Connell, J., 1013,1069consciousness, 10, 1026, 1029, 1030,

1033,1033consequent, 244conservative approximation,271, 419consistency, 105, 456, 769

arc,208of a CSP assignment,203of a heuristic,95path,210, 228

consistency condition, 110CONSISTENT-DET?,786consistent estimation,531Console, L., 60,1074Consortium, T. G. O., 469,1069conspiracy number, 191constant symbol,292, 294constraint

binary, 206global,206, 211nonlinear,205preference constraint,207propagation,208, 214, 217resource constraint,212symmetry-breaking,226unary, 206

constraint-based generalization, 799constraint graph,203, 223constraint hypergraph,206constraint language,205constraint learning,220, 229constraint logic programming, 344–345,

359constraint logic programming (CLP),

228, 345constraint optimization problem,207constraint satisfaction problem (CSP),

20,202, 202–207constraint weighting,222constructive induction,791consumable resource,402context, 286

context-free grammar, 889, 918, 919,1060

context-sensitive grammar,889contingencies, 161contingency planning,133, 415,

421–422, 431continuation,341continuity (of preferences),612continuous domains,206contour (in an image), 948, 953–954contour (of a state space),97contraction mapping,654contradiction,250controller, 59,997control theory,15, 15, 60, 155, 393,

761, 851, 964, 998adaptive,833, 854robust,836

control uncertainty, 996convention,429conversion to normal form, 345–347convexity, 133convex optimization,133, 153CONVINCE, 552convolution,938Conway, J. H., 113,1065Cook, P. J., 1035,1072Cook, S. A., 8, 276, 278, 1059,1069Cooper, G., 554, 826,1069cooperation, 428coordinate frame, 956coordination,426, 430coordination game,670Copeland, J., 470, 1042,1069Copernicus., 1035,1069COQ, 227, 359Cormen, T. H., 1059,1069corpus,861correlated sampling,850Cortellessa, G., 28,1068Cortes, C., 760, 762, 967,1069, 1080cotraining, 881, 885count noun,445Cournot, A., 687,1069Cournot competition,678covariance,1059covariance matrix, 1058,1059Cover, T., 763,1069Cowan, J. D., 20, 761,1069, 1092Coward, N., 1022Cowell, R., 639, 826,1069, 1089Cox, I., 606, 1012,1069Cox, R. T., 490, 504, 505,1069CPCS, 519, 552CPLAN , 395CPSC, ix

1102 Index

CPT,512Craig, J., 1013,1069Craik, K. J., 13,1069Crammer, K., 761,1071Craswell, N., 884,1069Crato, N., 229,1074Crauser, A., 112,1069Craven, M., 885,1069Crawford, J. M., 277,1069creativity, 16Cremers, A. B., 606, 1012,1067, 1088Cresswell, M. J., 470,1076CRF,878Crick, F. H. C., 130,1091Cristianini, N., 760,1069critic (in learning),55critical path,403Crocker, S. D., 192,1074Crockett, L., 279,1069Croft, B., 884,1069Croft, W. B., 884, 885,1085Cross, S. E., 29,1069CROSS-VALIDATION , 710cross-validation,708, 737, 759, 767CROSS-VALIDATION -WRAPPER, 710crossover,128, 153crossword puzzle, 44, 231Cruse, D. A., 870,1069cryptarithmetic,206Csorba, M., 1012,1071Cuellar, J., 279,1064Culberson, J., 107, 112,1069, 1092culling, 128Cullingford, R. E., 23,1069cult of computationalism, 1020Cummins, D., 638,1069cumulative distribution,564, 623, 1058cumulative learning, 791, 797cumulative probability density function,

1058curiosity, 842Curran, J. R., 920,1068current-best-hypothesis,770, 798CURRENT-BEST-LEARNING, 771Currie, K. W., 432,1073curse

of dimensionality,739, 760, 989, 997optimizer’s,619, 637winner’s,637

Cushing, W., 432,1069cutoff test,171cutset

conditioning,225, 227, 554cutset, cycle,225cutset conditioning,225, 227, 554Cybenko, G., 762,1069

CYBERLOVER, 1021cybernetics,15, 15CYC, 439, 469, 470cyclic solution,137Cyganiak, R., 439, 469,1066CYK-PARSE, 894CYK algorithm,893, 919

DD’Ambrosio, B., 553,1088d-separation,517DAG, 511, 552Daganzo, C., 554,1069Dagum, P., 554,1069Dahy, S. A., 723, 724,1078Dalal, N., 946, 968,1069DALTON, 800Damerau, F., 884,1064Daniels, C. J., 112,1081Danish, 907Dantzig, G. B., 155,1069DARKTHOUGHT, 192DARPA, 29, 922DARPA Grand Challenge, 1007, 1014Dartmouth workshop, 17, 18Darwiche, A., 277, 517, 554, 557, 558,

1069, 1085Darwin, C., 130, 1035,1069Dasgupta, P., 157,1069data-driven,258data association,599, 982database, 299database semantics,300, 343, 367, 540data complexity,334data compression,866Datalog,331, 357, 358data matrix,721data mining,26data sparsity, 888dative case, 899Daun, B., 432,1070Davidson, A., 678, 687,1066Davidson, D., 470,1069Davies, T. R., 784, 799,1069Davis, E., 469–473,1069, 1070Davis, G., 432,1070Davis, K. H., 922,1070Davis, M., 260, 276, 350, 358,1070Davis, R., 800,1070Davis–Putnam algorithm,260Dawid, A. P., 553, 639, 826,1069,

1080, 1089Dayan, P., 763, 854, 855,1070, 1083,

1088da Vinci, L., 5, 966

DBN, 566,590, 590–599, 603, 604,646, 664

DBPEDIA, 439, 469DCG,898, 919DDN (dynamic decision network), 664,

685Deacon, T. W., 25,1070dead end,149Deale, M., 432,1070Dean, J., 29, 921,1067Dean, M. E., 279,1084Dean, T., 431, 557, 604, 686, 1012,

1013, 1048,1070Dearden, R., 686, 855,1066, 1070Debevec, P., 968,1070Debreu, G., 625,1070debugging, 308Dechter, R., 110, 111, 228–230, 553,

1069, 1070, 1076, 1085decision

rational, 481, 610, 633sequential, 629,645

DECISION-L IST-LEARNING, 717DECISION-TREE-LEARNING, 702decision analysis,633decision boundary,723decision list,715decision maker,633decision network, 510, 610,626,

626–628, 636, 639, 664dynamic,664, 685evaluation of, 628

decision node,626decision stump,750decision theory, 9, 26,483, 636decision tree, 638, 697,698

expressiveness, 698pruning,705

declarative, 286declarative bias,787declarativism,236, 275decomposability (of lotteries),613DECOMPOSE, 414decomposition,378DeCoste, D., 760, 762,1070Dedekind, R., 313,1070deduction,seelogical inferencededuction theorem,249deductive database,336, 357, 358deductive learning,694deep belief networks,1047DEEPBLUE, ix, 29, 185, 192DEEPFRITZ, 193Deep Space One, 60, 392, 432DEEPTHOUGHT, 192Deerwester, S. C., 883,1070

Index 1103

default logic,459, 468, 471default reasoning, 458–460, 547default value,456de Finetti’s theorem, 490definite clause,256, 330–331definition (logical),302deformable template,957degree heuristic,216, 228, 261degree of belief,482, 489

interval-valued, 547degree of freedom,975degree of truth, 289DeGroot, M. H., 506, 827,1070DeJong, G., 799, 884,1070delete list,368Delgrande, J., 471,1070deliberative layer,1005Dellaert, F., 195, 1012,1072, 1091Della Pietra, S. A., 922,1067Della Pietra, V. J., 922,1067delta rule,846Del Favero, B. A., 553,1088Del Moral, P., 605,1070demodulation,354, 359, 364Demopoulos, D., 278,1068De Morgan’s rules, 298De Morgan, A., 227, 313Dempster, A. P., 557, 604, 826,1070Dempster–Shafer theory, 547,549,

549–550, 557DENDRAL, 22, 23, 468dendrite, 11Deng, X., 157,1070Denis, F., 921,1070Denis, M., 28,1068Denker, J., 762, 967,1080Dennett, D. C., 1024, 1032, 1033, 1042,

1070Denney, E., 360,1071density estimation,806

nonparametric,814DeOliveira, J., 469,1081depth-first search,85, 85–87, 108, 408DEPTH-L IMITED -SEARCH, 88depth limit, 173depth of field,932derivational analogy, 799derived sentences, 242Descartes, R., 6, 966, 1027, 1041,1071descendant (in Bayesian networks),517Descotte, Y., 432,1071description logic, 454,456, 456–458,

468, 471descriptive theory,619detachment,547detailed balance,537

detection failure (in data association),602

determination,784, 799, 801minimal, 787

deterministic environment,43deterministic node,518Detwarasiti, A., 639,1071Deville, Y., 228,1091DEVISER, 431Devroye, L., 827,1071Dewey Decimal system, 440de Bruin, A., 191,1085de Dombal, F. T., 505,1070de Finetti, B., 489, 504,1070de Freitas, J. F. G., 605,1070de Freitas, N., 605,1071de Kleer, J., 229, 358, 472,1070, 1072,

1091de Marcken, C., 921,1070De Morgan, A.,1070De Raedt, L., 800, 921,1070, 1083de Salvo Braz, R., 556,1070de Sarkar, S. C., 112, 157,1068, 1069Diaconis, P., 620diagnosis, 481, 496, 497, 909

dental, 481medical, 23, 505, 517, 548, 629, 1036

diagnostic rule,317, 517dialysis, 616diameter (of a graph),88Dias, W., 28,1064Dickmanns, E. D., 1014,1071dictionary, 21Dietterich, T., 799, 856,1064, 1071Difference Engine, 14differential drive, 976differential equation, 997

stochastic, 567differential GPS,975differentiation, 780diffuse albedo,934diffuse reflection,933Digital Equipment Corporation (DEC),

24, 336digit recognition, 753–755Dijkstra, E. W., 110, 1021,1071Dill, D. L., 279, 1084Dillenburg, J. F., 111,1071Dimopoulos, Y., 395,1078Dinh, H., 111,1071Diophantine equations,227Diophantus, 227Diorio, C., 604,1086DiPasquo, D., 885,1069Diplomacy, 166directed acyclic graph (DAG), 511, 552

directed arc consistency,223direct utility estimation, 853Dirichlet distribution,811Dirichlet process,827disabilities, 1043disambiguation, 904–912, 919discontinuities, 936discount factor,649, 685, 833discovery system,800discrete event,447discretization,131, 519discriminative model, 878disjoint sets,441disjunct, 244disjunction,244disjunctive constraint,205disjunctive normal form,283disparity,949Dissanayake, G., 1012,1071distant point light source,934distortion,910distribute∨ over∧, 254, 347distributed constraint satisfaction,230distribution

beta, 592,811conditional, nonparametric,520cumulative,564, 623, 1058mixture,817

divide-and-conquer, 606Dix, J., 472,1067Dizdarevic, S., 158,1080DLV , 472DNF (disjunctive normal form), 283Do, M. B., 390, 431,1071Doctorow, C., 470,1071DOF,975dolphin, 860domain,486

continuous,206element of,290finite, 205, 344infinite, 205in first-order logic,290in knowledge representation,300

domain closure,299, 540dominance

stochastic,622, 636strict,622

dominant strategy,668, 680dominant strategy equilibrium,668dominated plan (in POMDP),662domination (of heuristics),104Domingos, P., 505, 556, 826,1071Domshlak, C., 395, 434,1067, 1076Donati, A., 28,1068Donninger, C., 193,1071

1104 Index

Doorenbos, R., 358,1071Doran, J., 110, 111,1071Dorf, R. C., 60,1071Doucet, A., 605,1070, 1071Dow, R. J. F., 762,1088Dowling, W. F., 277,1071Downey, D., 885,1072downward refinement property,410Dowty, D., 920,1071Doyle, J., 60, 229, 471, 472, 638,1071,

1082, 1092DPLL, 261, 277, 494DPLL-SATISFIABLE?,261Drabble, B., 432,1071DRAGON, 922Draper, D., 433,1072Drebbel, C., 15Dredze, M., 761,1071Dreussi, J., 432,1088Dreyfus, H. L., 279, 1024, 1049,1071Dreyfus, S. E., 109, 110, 685, 1024,

1065, 1071Driessens, K., 857,1090drilling rights, 629drone,1009dropping conditions,772Drucker, H., 762, 967,1080Druzdzel, M. J., 554,1068DT-AGENT, 484dual graph,206dualism,6, 1027, 1041Dubois, D., 557,1071Dubois, O., 277,1089duck, mechanical, 1011Duda, R. O., 505, 557, 763, 825, 827,

1071Dudek, G., 1014,1071Duffy, D., 360,1071Duffy, K., 760,1069Dumais, S. T., 29, 872, 883, 885,1065,

1070, 1087dung beetle, 39, 61, 424, 1004Dunham, B., 21,1072Dunham, C., 358,1090Dunn, H. L., 556,1071DuPont, 24duration,402Durer, A., 966Durfee, E. H., 434,1071Durme, B. V., 885,1071Durrant-Whyte, H., 1012,1071, 1080Dyer, M., 23,1071dynamical systems, 603dynamic backtracking,229dynamic Bayesian network (DBN), 566,

590, 590–599, 603, 604, 646,

664dynamic decision network,664, 685dynamic environment,44dynamic programming, 60, 106, 110,

111,342, 575, 685adaptive,834, 834–835, 853, 858nonserial,553

dynamic state,975dynamic weighting, 111Dyson, G., 1042,1071dystopia, 1052Duzeroski, S., 796, 800,1071, 1078,

1080

EE, 359E0 (English fragment), 890Earley, J., 920,1071early stopping,706earthquake, 511Eastlake, D. E., 192,1074EBL, 432,778, 780–784, 798, 799Ecker, K., 432,1066Eckert, J., 14economics, 9–10, 59, 616Edelkamp, S., 111, 112, 395,1071,

1079edge (in an image),936edge detection, 936–939Edinburgh, 800, 1012Edmonds, D., 16Edmonds, J., 8,1071Edwards, D. J., 191,1075Edwards, P., 1042,1071Edwards, W., 637,1091EEG, 11Een, N., 277,1071effect,367

missing,423negative, 398

effector,971efficient auction,680Efros, A. A., 28, 955, 968,1075, 1076Ehrenfeucht, A., 759,10668-puzzle,70, 102, 105, 109, 1138-queens problem, 71, 109Einstein, A., 1Eisner, J., 920,1089Eitelman, S., 358,1090Eiter, T., 472,1071Ekart, A., 155,1086electric motor,977electronic circuits domain, 309–312Elfes, A., 1012,1083ELIMINATION -ASK, 528Elio, R., 638,1071

Elisseeff, A., 759,1074ELIZA , 1021, 1035Elkan, C., 551, 826,1071Ellington, C., 1045,1072Elliot, G. L., 228,1075Elliott, P., 278,1092Ellsberg, D., 638,1071Ellsberg paradox, 620Elman, J., 921,1071EM algorithm, 571, 816–824

structural,824embodied cognition,1026emergent behavior, 430,1002EMNLP, 923empirical gradient,132, 849empirical loss,712empiricism,6, 923Empson, W., 921,1071EMV (expected monetary value), 616Enderton, H. B., 314, 358,1071English, 21, 32

fragment, 890ENIAC, 14ensemble learning,748, 748–752entailment,240, 274

inverse,795entailment constraint,777, 789, 798entropy,703ENUMERATE-ALL , 525ENUMERATION-ASK, 525environment,34, 40–46

artificial, 41class,45competitive,43continuous,44cooperative,43deterministic,43discrete,44dynamic,44game-playing, 197, 858generator,46history, 646known,44multiagent,42, 425nondeterministic,43observable,42one-shot,43partially observable,42properties, 42semidynamic,44sequential,43single-agent,42static,44stochastic,43taxi, 40uncertain,43

Index 1105

unknown,44unobservable,42

EPAM (Elementary Perceiver AndMemorizer), 758

Ephrati, E., 434,1079epiphenomenalism,1030episodic environment, 43epistemological commitment,289, 290,

313, 482Epstein, R., 30,1071EQP, 360equality, 353equality (in logic), 299equality symbol,299equilibrium, 183,668equivalence (logical),249Erdmann, M. A., 156,1071ergodic,537Ernst, G., 110,1084Ernst, H. A., 1012,1071Ernst, M., 395,1071Erol, K., 432,1071, 1072error (of a hypothesis),708, 714error function, 1058error rate,708Essig, A., 505,1074Etchemendy, J., 280, 314,1065ethics, 1034–1040Etzioni, A., 1036,1072Etzioni, O., 61, 433, 439, 469, 881, 885,

1036, 1050,1065, 1072, 1079,1091

Euclid, 8, 966EURISKO, 800Europe, 24European Space Agency, 432evaluation function,92, 108, 162,

171–173, 845linear, 107

Evans, T. G., 19, 31,1072event, 446–447, 450

atomic,506discrete,447exogenous,423in probability,484, 522liquid, 447

event calculus,446, 447, 470, 903Everett, B., 1012,1066evidence,485, 802

reversal,605evidence variable, 522evolution, 130

machine,21evolutionary psychology,621evolution strategies,155exceptions, 438, 456

exclusive or, 246, 766execution,66execution monitoring,422, 422–434executive layer,1004exhaustive decomposition,441existence uncertainty,541existential graph,454Existential Instantiation,323Existential Introduction,360expansion (of states),75expectation,1058expected monetary value,616expected utility,53, 61, 483, 610, 611,

616expected value (in a game tree),172,

178expectiminimax,178, 191

complexity of, 179expert system, 468, 633, 636, 800, 1036

commercial, 336decision-theoretic, 633–636first, 23first commercial, 24HPP (Heuristic Programming

Project),23logical, 546medical, 557Prolog-based, 339with uncertainty, 26

explaining away, 548explanation,462, 781explanation-based generalization,187explanation-based learning (EBL), 432,

778, 780–784, 798, 799explanatory gap,1033exploitation,839exploration,39, 147–154, 831, 839, 855

safe,149exploration function,842, 844explored set,77expressiveness (of a representation

scheme),58EXTEND-EXAMPLE, 793extended Kalman filter (EKF),589, 982extension (of a concept),769extension (of default theory),460extensive form,674externalities,683extrinsic property,445eyes, 928, 932, 966

Ffact,256factor (in variable elimination),524factored frontier,605

factored representation,58, 64, 202,367, 486, 664, 694

factoring,253, 347Fagin, R., 229, 470, 477,1065, 1072Fahlman, S. E., 20, 472,1072failure model, 593false alarm (in data association),602false negative,770false positive,770family tree, 788Farrell, R., 358,1067FAST DIAGONALLY DOWNWARD, 387FASTDOWNWARD, 395FASTFORWARD, 379FASTUS, 874, 875, 884Faugeras, O., 968,1072Fearing, R. S., 1013,1072Featherstone, R., 1013,1072feature (in speech),915feature (of a state),107, 172feature extraction,929feature selection,713, 866feed-forward network,729feedback loop, 548Feigenbaum, E. A., 22, 23, 468, 758,

1067, 1072, 1080Feiten, W., 1012,1066Feldman, J., 639,1072Feldman, R., 799,1089Fellbaum, C., 921,1072Fellegi, I., 556,1072Felner, A., 107, 112, 395,1072, 1079,

1092Felzenszwalb, P., 156, 959,1072Feng, C., 800,1083Feng, L., 1012,1066Fergus, R., 741,1090Ferguson, T., 192, 827,1072Fermat, P., 9, 504Ferraris, P., 433,1072Ferriss, T., 1035,1072FF, 379, 387, 392, 39515-puzzle, 109Fifth Generation project, 24figure of speech, 905, 906Fikes, R. E., 60, 156, 314, 367, 393,

432, 434, 471, 799, 1012,1067,1072

filtering, 145, 460, 571–573, 603, 659,823, 856, 978, 1045

assumed-density,605Fine, S., 604,1072finite-domain,205, 344finite-state automata, 874, 889Finkelstein, L., 230,1067Finney, D. J., 554,1072

1106 Index

Firby, R. J., 431,1070first-order logic,285, 285–321first-order probabilistic logic, 539–546Firth, J., 923,1072Fischer, B., 360,1071Fischetti, M., 395,1068Fisher, R. A., 504,1072fitness (in genetic algorithms),127fitness landscape, 155Fix, E., 760,1072fixation,950FIXED-LAG-SMOOTHING, 580fixed-lag smoothing,576fixed point,258, 331Flannery, B. P., 155,1086flaw, 390Floreano, D., 1045,1072fluent,266, 275, 388, 449–450fly eyes, 948, 963FMP,seeplanning, fine-motionfMRI, 11, 288focal plane,932FOCUS, 799focus of expansion,948Fogel, D. B., 156,1072Fogel, L. J., 156,1072FOIL, 793FOL-BC-ASK, 338FOL-FC-ASK, 332folk psychology, 473Foo, N., 279,1072FOPC,seelogic, first-orderForbes, J., 855,1072FORBIN, 431, 432Forbus, K. D., 358, 472,1072force sensor,975Ford, K. M., 30,1072foreshortening, 952Forestier, J.-P., 856,1072Forgy, C., 358,1072formulate, search, execute, 66Forrest, S., 155,1082Forsyth, D., 960, 968,1072, 1086Fortmann, T. E., 604, 606,1065forward–backward,575, 822FORWARD-BACKWARD, 576forward chaining,257, 257–259, 275,

277, 330–337, 358forward checking,217, 217–218forward pruning,174forward search for planning, 373–374four-color map problem, 227, 1023Fourier, J., 227,1072Fowlkes, C., 941, 967,1081Fox, C., 638,1072

Fox, D., 606, 1012, 1014,1067, 1072,1088, 1090

Fox, M. S., 395, 432,1072frame

in representation,24, 471in speech,915problem

inferential,267, 279frame problem,266, 279

inferential, 447representational,267

framing effect,621Franco, J., 277,1072Frank, E., 763,1092Frank, I., 191,1072Frank, M., 231,1073Frank, R. H., 1035,1072Frankenstein, 1037Franz, A., 883, 921,1072Fratini, S., 28,1068FREDDY, 74, 156, 1012Fredkin Prize, 192Freeman, W., 555,1091, 1092free space,988free will, 6Frege, G., 8, 276, 313, 357,1072Freitag, D., 877, 885,1069, 1072frequentism,491Freuder, E. C., 228–230,1072, 1087Freund, Y., 760,1072Friedberg, R. M., 21, 156,1072Friedgut, E., 278,1073Friedman, G. J., 155,1073Friedman, J., 758, 761, 763, 827,1067,

1073, 1075Friedman, N., 553, 558, 605, 826, 827,

855,1066, 1070, 1073, 1078Friendly AI, 27, 1039Fristedt, B., 855,1065frontier, 75Frost, D., 230,1070Fruhwirth, T., 230,1073FRUMP, 884Fuchs, J. J., 432,1073Fudenberg, D., 688,1073Fukunaga, A. S., 431,1073fully observable, 658function,288

total,291functional dependency,784, 799functionalism, 60,1029, 1030, 1041,

1042function approximation,845, 847function symbol,292, 294Fung, R., 554,1073Furnas, G. W., 883,1070

Furst, M., 395,1066futility pruning, 185fuzzy control,550fuzzy logic, 240, 289, 547, 550, 557fuzzy set, 550, 557

Gg (path cost), 78G-set,774Godel number, 352Gabor, Z. Z., 640Gaddum, J. H., 554,1073Gaifman, H., 555,1073gain parameter,998gain ratio,707, 765gait,1001Gale, W. A., 883,1068Galileo, G., 1, 56, 796Gallaire, H., 358,1073Gallier, J. H., 277, 314,1071, 1073Gamba, A., 761,1073Gamba perceptrons, 761Gamberini, L., 761,1073gambling, 9, 613game, 9,161

of chance, 177–180dice, 183Go, 186, 194of imperfect information,162inspection game,666multiplayer, 165–167Othello, 186partially observable, 180–184of perfect information,161poker, 507pursuit–evasion,196repeated, 669,673robot (with humans), 1019Scrabble,187, 195zero-sum,161, 162, 199, 670

game playing, 161–162, 190game programs, 185–187GAMER, 387game show, 616game theory, 9, 161, 645,666, 666–678,

685combinatorial,186

game tree,162Gamma function,828Garding, J., 968,1073Gardner, M., 276,1073Garey, M. R., 1059,1073Garg, A., 604,1084GARI, 432Garofalakis, M., 275,1080

Index 1107

Garrett, C., 128,1065Gaschnig’s heuristic, 119Gaschnig, J., 111, 119, 228, 229, 557,

1071, 1073Gasquet, A., 432,1073Gasser, R., 112, 194,1073Gat, E., 1013,1073gate (logic), 309Gauss, C. F., 227, 603, 759,1073Gauss, K. F., 109Gaussian distribution,1058

multivariate,584, 1058Gaussian error model,592Gaussian filter,938Gaussian process,827Gawande, A., 1036,1073Gawron, J. M., 922,1078Gay, D. E., 275,1080Gearhart, C., 686,1074Gee, A. H., 605,1070Geffner, H., 156, 394, 395, 431, 433,

1066, 1075, 1084Geiger, D., 553, 826,1073, 1075Geisel, T., 864,1073Gelatt, C. D., 155, 229,1078Gelb, A., 604,1073Gelder, A. V., 360,1090Gelernter, H., 18, 359,1073Gelfond, M., 359, 472,1073Gelly, S., 194,1073, 1091Gelman, A., 827,1073Geman, D., 554, 967,1073Geman, S., 554, 967,1073generality, 783generalization,770, 772generalization hierarchy,776generalization loss,711generalized arc consistent,210generalized cylinder,967general ontology, 453General Problem Solver, 3, 7, 18, 393generation (of states),75generative capacity, 889generator,337Genesereth, M. R., 59, 60, 156, 195,

314, 345, 350, 359, 363, 1019,1073, 1080, 1089

GENETIC-ALGORITHM, 129genetic algorithm,21, 126–129, 153,

155–156, 841genetic programming,155Gent, I., 230,1073Gentner, D., 314, 799,1073Geometry Theorem Prover, 18Georgeson, M., 968,1067Gerbault, F., 826,1074

Gerevini, A., 394, 395,1073Gershwin, G., 917,1073Gestalt school, 966Getoor, L., 556,1073Ghahramani, Z., 554, 605, 606, 827,

1073, 1077, 1087Ghallab, M., 372, 386, 394–396, 431,

1073Ghose, S., 112,1068GIB, 187, 195Gibbs, R. W., 921,1073GIBBS-ASK, 537Gibbs sampling,536, 538, 554Gibson, J. J., 967, 968,1073Gil, Y., 439,1068Gilks, W. R., 554, 555, 826,1073Gilmore, P. C., 358,1073Ginsberg, M. L., 187, 195, 229, 231,

359, 363, 557,1069, 1073, 1089Gionis, A., 760,1073Gittins, J. C., 841, 855,1074Gittins index, 841, 855Giunchiglia, E., 433,1072Givan, R., 857,1090Glanc, A., 1011,1074Glass, J., 604,1080GLAUBER, 800Glavieux, A., 555,1065GLIE, 840global constraint,206, 211Global Positioning System (GPS),974Glover, F., 154,1074Glymour, C., 314, 826,1074, 1089Go (game), 186, 194goal,52, 64, 65, 108, 369

based agent, 52–53, 59, 60formulation of,65goal-based agent, 52–53, 59goal-directed reasoning,259inferential,301serializable,392

goal clauses,256goal monitoring, 423goal predicate,698goal test,67, 108God, existence of, 504Godel, K., 8, 276, 358, 1022,1074Goebel, J., 826,1074Goebel, R., 2, 59,1085Goel, A., 682,1064Goertzel, B., 27,1074GOFAI, 1024, 1041gold, 237Gold, B., 922,1074Gold, E. M., 759, 921,1074Goldbach’s conjecture, 800

Goldberg, A. V., 111,1074Goldberg, D. E., 155,1085Goldberg, K., 156,1092Goldin-Meadow, S., 314,1073Goldman, R., 156, 433, 555, 556, 921,

1068, 1074, 1091gold standard,634Goldszmidt, M., 553, 557, 686, 826,

1066, 1073, 1074GOLEM, 800Golgi, C., 10Golomb, S., 228,1074Golub, G., 759,1074Gomard, C. K., 799,1077Gomes, C., 154, 229, 277,1074Gonthier, G., 227,1074Good, I. J., 491, 552, 1037, 1042,1074Good–Turing smoothing, 883good and evil, 637Gooday, J. M., 473,1069Goodman, D., 29,1074Goodman, J., 29, 883,1068, 1074Goodman, N., 470, 798,1074, 1080Goodnow, J. J., 798,1067good old-fashioned AI (GOFAI), 1024,

1041Google, 870, 883, 889, 922Google Translate, 907Gopnik, A., 314,1074Gordon, D. M., 429,1074Gordon, G., 605, 686, 1013,1085, 1087,

1091Gordon, M. J., 314,1074Gordon, N., 187, 195, 605,1071, 1074Gorry, G. A., 505,1074Gottlob, G., 230,1074Gotts, N., 473,1069GP-CSP, 390GPS (General Problem Solver), 3, 7, 18,

393GPS (Global Positioning System), 974graceful degradation, 666gradient,131

empirical,132, 849gradient descent, 125,719

batch,720stochastic,720

Graham, S. L., 920,1074Grama, A., 112,1074grammar,860, 890, 1060

attribute,919augmented,897categorial, 920context-free,889, 918, 919, 1060

lexicalized,897probabilistic,890, 888–897, 919

1108 Index

context-sensitive,889definite clause (DCG),898, 919dependency, 920English, 890–892induction of, 921lexical-functional (LFG), 920phrase structure, 918probabilistic, 897recursively enumerable, 889regular, 889

grammatical formalism, 889Grand Prix, 185graph,67

coloring,227Eulerian,157

GRAPH-SEARCH, 77graphical model, 510, 558GRAPHPLAN, 379,383, 392, 394–396,

402, 433grasping,1013Grassmann, H., 313,1074Gravano, L., 885,1064Grayson, C. J., 617,1074Greece, 275, 468, 470greedy search, 92Green, B., 920,1074Green, C., 19, 314, 356, 358,1074Green, P., 968,1067Greenbaum, S., 920,1086Greenblatt, R. D., 192,1074Greenspan, M., 195,1079Grefenstette, G., 27,1078Greiner, R., 799, 826,1068, 1074Grenager, T., 857,1088grid, rectangular,77Griffiths, T., 314,1090Grinstead, C., 506,1074GRL, 1013Grosof, B., 799,1087Grosz, B. J., 682, 688,1076grounding,243ground resolution theorem,255, 350ground term,295, 323Grove, A., 505, 638,1064, 1065Grove, W., 1022,1074Gruber, T., 439, 470,1074grue, 798Grumberg, O., 395,1068GSAT, 277Gu, J., 229, 277,1074, 1089Guard, J., 360,1074Guestrin, C., 639, 686, 856, 857,1074,

1079, 1081Guha, R. V., 439, 469,1067, 1080Guibas, L. J., 1013,1074Gumperz, J., 314,1074

Gupta, A., 639,1079GUS, 884Gutfreund, H., 761,1064Guthrie, F., 227Guugu Yimithirr, 287Guy, R. K., 113,1065Guyon, I., 759, 760, 762, 967,1066,

1074, 1080

HH (entropy), 704h (heuristic function), 92hMAP (MAP hypothesis), 804hML (ML hypothesis), 805HACKER, 394Hacking, I., 506,1074Haghighi, A., 896, 920,1074Hahn, M., 760,1069Hahnel, D., 1012,1067Haimes, M., 556,1082Haken, W., 227,1064HAL 9000 computer, 552Hald, A., 506,1074Halevy, A., 28, 358, 470, 759, 885,

1067, 1074Halgren, E., 288,1087Halpern, J. Y., 314, 470, 477, 505, 555,

1065, 1072, 1074Halpin, M. P., 231,1073halting problem, 325ham, 865Hamm, F., 470,1091Hamming, R. W., 506,1074Hamming distance,738Hammond, K., 432,1074Hamori, S., 604,1066ham sandwich, 906Hamscher, W., 60,1074Han, X., 11,1074Hanan, S., 395,1072Hand, D., 763,1074hand–eye machine,1012Handschin, J. E., 605,1075handwritten digit recognition, 753–755Hanks, S., 433,1072Hanna, F. K., 800,1087Hansard,911Hansen, E., 112, 156, 422, 433, 686,

1075, 1093Hansen, M. O., 228,1064Hansen, P., 277,1075Hanski, I., 61,1075Hansson, O., 112, 119,1075happy graph, 703haptics,1013Harabagiu, S. M., 885,1085

Harada, D., 856,1084Haralick, R. M., 228,1075Hardin, G., 688,1075Hardy, G. H., 1035,1075Harel, D., 358,1068Harman, G. H., 1041,1075HARPY, 154, 922Harris, Z., 883,1075Harrison, J. R., 637,1075Harrison, M. A., 920,1074Harsanyi, J., 687,1075Harshman, R. A., 883,1070Hart, P. E., 110, 156, 191, 432, 434,

505, 557, 763, 799, 825, 827,1071, 1072, 1075

Hart, T. P., 191,1075Hartley, H., 826,1075Hartley, R., 968,1075Harvard, 621Haslum, P., 394, 395, 431,1075Hastie, T., 760, 761, 763, 827,1073,

1075Haugeland, J., 2, 30, 1024, 1042,1075Hauk, T., 191,1075Haussler, D., 604, 759, 762, 800,1065,

1066, 1075, 1079Havelund, K., 356,1075Havenstein, H., 28,1075Hawkins, J., 1047,1075Hayes, P. J., 30, 279, 469–472,1072,

1075, 1082Haykin, S., 763,1075Hays, J., 28,1075head,897head (of Horn clause),256Hearst, M. A., 879, 881, 883, 884, 922,

1075, 1084, 1087Heath, M., 759,1074Heath Robinson, 14heavy-tailed distribution,154Heawood, P., 1023Hebb, D. O., 16, 20, 854,1075Hebbian learning,16Hebert, M., 955, 968,1076Heckerman, D., 26, 29, 548, 552, 553,

557, 605, 634, 640, 826,1067,1074–1076, 1087–1089

hedonic calculus, 637Heidegger, M., 1041,1075Heinz, E. A., 192,1075Held, M., 112,1075Hellerstein, J. M., 275,1080Helmert, M., 111, 395, 396,1075Helmholtz, H., 12Hempel, C., 6Henderson, T. C., 210, 228,1082

Index 1109

Hendler, J., 27, 396, 432, 469,1064,1065, 1071, 1072, 1075, 1089

Henrion, M., 61, 519, 552, 554, 639,1075, 1076, 1086

Henzinger, M., 884,1088Henzinger, T. A., 60,1075Hephaistos, 1011Herbrand’s theorem,351, 358Herbrand, J., 276, 324, 351, 357, 358,

1075Herbrand base,351Herbrand universe,351, 358Hernadvolgyi, I., 112,1076Herskovits, E., 826,1069Hessian,132Heule, M., 278,1066heuristic, 108

admissible,94, 376composite, 106degree,216, 228, 261for planning, 376–379function,92, 102–107least-constraining-value,217level sum,382Manhattan,103max-level,382min-conflicts,220minimum-remaining-values,216,

228, 333, 405minimum remaining values,216, 228,

333, 405null move,185search,81, 110set-level,382straight-line, 92

heuristic path algorithm,118Heuristic Programming Project (HPP),

23Hewitt, C., 358,1075hexapod robot, 1001hidden Markov model

factorial,605hidden Markov model (HMM), 25, 566,

578, 578–583, 590, 603, 604,822–823

hidden Markov model (HMM) (HMM),578, 590, 876, 922

hidden unit,729hidden variable,522, 816HIERARCHICAL-SEARCH, 409hierarchical decomposition,406hierarchical lookahead,415hierarchical reinforcement learning,

856, 1046hierarchical structure, 1046

hierarchical task network (HTN),406,431

Hierholzer, C., 157,1075higher-order logic,289high level action,406Hilgard, E. R., 854,1075HILL -CLIMBING , 122hill climbing, 122, 153, 158

first-choice,124random-restart,124stochastic,124

Hingorani, S. L., 606,1069Hinrichs, T., 195,1080Hintikka, J., 470,1075Hinton, G. E., 155, 761, 763, 1047,

1075, 1087Hirsch, E. A., 277,1064Hirsh, H., 799,1075Hitachi, 408hit list, 869HITS, 871, 872HMM, 578, 590, 876, 922Ho, Y.-C., 22, 761,1067Hoane, A. J., 192,1067Hobbes, T., 5, 6Hobbs, J. R., 473, 884, 921,1075, 1076Hodges, J. L., 760,1072Hoff, M. E., 20, 833, 854,1092Hoffmann, J., 378, 379, 395, 433,1076,

1078Hogan, N., 1013,1076HOG feature,947Hoiem, D., 955, 968,1076holdout cross-validation,708holistic context, 1024Holland, J. H., 155,1076, 1082Hollerbach, J. M., 1013,1072holonomic, 976Holte, R., 107, 112, 678, 687,1066,

1072, 1076, 1092Holzmann, G. J., 356,1076homeostatic,15homophones,913Homo sapiens, 1, 860Hon, H., 922,1076Honavar, V., 921,1084Hong, J., 799,1082Hood, A., 10,1076Hooker, J., 230,1076Hoos, H., 229,1076Hopcroft, J., 1012, 1059,1064, 1088Hope, J., 886,1076Hopfield, J. J., 762,1076Hopfield network,762Hopkins Beast, 1011horizon (in an image), 931

horizon (in MDPs),648horizon effect,174Horn, A., 276,1076Horn, B. K. P., 968,1076Horn, K. V., 505,1076Horn clause,256, 791Horn form, 275, 276Horning, J. J.,1076Horowitz, E., 110,1076Horowitz, M., 279,1084Horrocks, J. C., 505,1070horse, 1028Horswill, I., 1013,1076Horvitz, E. J., 26, 29, 61, 553, 604, 639,

1048,1076, 1084, 1087Hovel, D., 553,1076Howard, R. A., 626, 637–639, 685,

1076, 1082Howe, A., 394,1073Howe, D., 360,1076HSCP, 433HSP, 387, 395HSPR, 395Hsu, F.-H., 192,1067, 1076Hsu, J., 28,1064HTML, 463, 875HTN, 406, 431HTN planning, 856Hu, J., 687, 857,1076Huang, K.-C., 228,1086Huang, T., 556, 604,1076Huang, X. D., 922,1076hub,872Hubble Space Telescope, 206, 221, 432Hubel, D. H., 968,1076Huber, M., 1013,1069Hubs and Authorities, 872Huddleston, R. D., 920,1076Huet, G., 359,1066Huffman, D. A., 20,1076Huffman, S., 1013,1069Hughes, B. D., 151,1076Hughes, G. E., 470,1076HUGIN, 553, 604Huhns, M. N., 61,1076human-level AI,27, 1034human judgment, 546, 557, 619humanoid robot,972human performance, 1human preference, 649Hume, D., 6,1076Humphrys, M., 1021,1076Hungarian algorithm,601Hunkapiller, T., 604,1065Hunsberger, L., 682, 688,1076Hunt, W., 360,1076

1110 Index

Hunter, L., 826,1076Hurst, M., 885,1076Hurwicz, L., 688,1076Husmeier, D., 605,1076Hussein, A. I., 723, 724,1078Hutchinson, S., 1013, 1014,1068Huth, M., 314,1076Huttenlocher, D., 959, 967,1072, 1076Huygens, C., 504, 687,1076Huyn, N., 111,1076Hwa, R., 920,1076Hwang, C. H., 469,1076HYBRID-WUMPUS-AGENT, 270hybrid A*, 991hybrid architecture,1003, 1047HYDRA, 185, 193hyperparameter,811hypertree width, 230hypothesis,695

approximately correct, 714consistent,696null, 705prior, 803, 810

hypothesis prior,803, 810hypothesis space,696, 769Hyun, S., 1012,1070

Ii.i.d. (independent and identically

distributed),708, 803Iagnemma, K., 1014,1067IBAL , 556IBM, 18, 19, 29, 185, 193, 922IBM 704 computer, 193ice cream, 483ID3, 800IDA* search, 99, 111identification in the limit, 759identity matrix (I), 1056identity uncertainty,541, 876idiot Bayes, 499IEEE, 469ignorance, 547, 549

practical,481theoretical,481

ignore delete lists,377ignore preconditions heuristic,376Iida, H., 192,1087IJCAI (International Joint Conference

on AI), 31ILOG, 359ILP, 779, 800image,929

formation, 929–935, 965processing, 965segmentation, 941–942

imperfect information, 190, 666implementation (of a high-level action),

407implementation level,236implication,244implicative normal form,282, 345importance sampling,532, 554incentive,426incentive compatible, 680inclusion–exclusion principle,489incompleteness, 342

theorem, 8, 352, 1022inconsistent support, 381incremental formulation,72incremental learning, 773, 777independence,494, 494–495, 498, 503

absolute, 494conditional,498, 502, 503, 517–523,

551, 574context-specific,542, 563marginal, 494

independent subproblems,222index,869indexical,904indexing,328, 327–329India, 16, 227, 468indicator variable,819indifference, principle of, 491,504individual (in genetic algorithms),127individuation,445induced width, 229induction,6

constructive,791mathematical, 8

inductive learning,694, 695–697inductive logic programming (ILP),

779, 800Indyk, P., 760,1064, 1073inference,208, 235

probabilistic,490, 490–494, 510inference procedure, 308inference rule,250, 275inferential equivalence,323inferential frame problem,267, 279infinite horizon problems, 685influence diagram, 552, 610,626INFORMATION-GATHERING-AGENT,

632information extraction,873, 873–876,

883information gain,704, 705information gathering,39, 994information retrieval (IR), 464,867,

867–872, 883, 884information sets,675information theory, 703–704, 758

information value,629, 639informed search, 64, 81,92, 92–102,

108infuence diagram, 510, 610,626,

626–628, 636, 639, 664Ingerman, P. Z., 919,1076Ingham, M., 278,1092inheritance,440, 454, 478

multiple,455initial state,66, 108, 162, 369Inoue, K., 795,1076input resolution,356inside–outside algorithm,896instance (of a schema),128instance-based learning,737, 737–739,

855insufficient reason, principle of,504insurance premium,618intelligence,1, 34intelligent backtracking, 218–220, 262intentionality, 1026, 1042intentional state,1028intercausal reasoning, 548interior-point method, 155interleaving, 147interleaving (actions),394interleaving (search and action),136interlingua,908internal state,50Internet search, 464Internet shopping, 462–467interpolation smoothing, 883interpretation,292, 313

extended, 313intended,292pragmatic, 904

interreflections,934, 953interval, 448Intille, S., 604,1077intractability, 21intrinsic property,445introspection, 3, 12intuition pump,1032inverse (of a matrix),1056inverse entailment,795inverse game theory, 679inverse kinematics,987inverse reinforcement learning,857inverse resolution,794, 794–797, 800inverted pendulum,851inverted spectrum,1033Inza, I., 158,1080IPL, 17IPP, 387, 395IQ test, 19, 31IR, 464,867, 867–872, 883, 884

Index 1111

irrationality, 2, 613irreversible,149IS-A links, 471Isard, M., 605,1077ISBN, 374, 541ISIS, 432Israel, D., 884,1075ITEP, 192ITEP chess program, 192ITERATIVE-DEEPENING-SEARCH, 89iterative deepening search,88, 88–90,

108, 110, 173, 408iterative expansion,111iterative lengthening search, 117ITOU, 800Itsykson, D., 277,1064Iwama, K., 277,1077Iwasawa, S., 1041,1085IXTET, 395

JJaakkola, T., 555, 606, 855,1077, 1088JACK, 195Jackel, L., 762, 967,1080Jackson, F., 1042,1077Jacobi, C. G., 606Jacquard, J., 14Jacquard loom, 14Jaffar, J., 359,1077Jaguar, 431Jain, A., 885,1085James, W., 13janitorial science, 37Japan, 24Jasra, A., 605,1070Jaumard, B., 277,1075Jaynes, E. T., 490, 504, 505,1077Jeavons, P., 230,1085Jefferson, G., 1026,1077Jeffrey, R. C., 504, 637,1077Jeffreys, H., 883,1077Jelinek, F., 883, 922, 923,1067, 1077Jenkin, M., 1014,1071Jenkins, G., 604,1066Jennings, H. S., 12,1077Jenniskens, P., 422,1077Jensen, F., 552, 553,1064Jensen, F. V., 552, 553, 558,1064, 1077Jevons, W. S., 276, 799,1077Ji, S., 686,1077Jimenez, P., 156, 433,1077Jitnah, N., 687,1079Joachims, T., 760, 884,1077job, 402job-shop scheduling problem, 402

Johanson, M., 687,1066, 1093Johnson, C. R., 61,1067Johnson, D. S., 1059,1073Johnson, M., 920, 921, 927, 1041,1067,

1068, 1071, 1079Johnson, W. W., 109,1077Johnston, M. D., 154, 229, 432,1077,

1082joint action,427joint probability distribution,487

full, 488, 503, 510, 513–517join tree,529Jones, M., 968, 1025,1091Jones, N. D., 799,1077Jones, R., 358, 885,1077Jones, R. M., 358,1092Jones, T., 59,1077Jonsson, A., 28, 60, 431,1064, 1077Jordan, M. I., 555, 605, 606, 686, 761,

827, 850, 852, 855, 857, 883,1013,1066, 1073, 1077, 1083,1084, 1088, 1089, 1091

Jouannaud, J.-P., 359,1077Joule, J., 796Juang, B.-H., 604, 922,1086Judd, J. S., 762,1077Juels, A., 155,1077Junker, U., 359,1077Jurafsky, D., 885, 886, 920, 922,1077Just, M. A., 288,1082justification (in a JTMS),461

Kk-consistency,211k-DL (decision list), 716k-DT (decision tree), 716k-d tree,739k-fold cross-validation,708Kadane, J. B., 639, 687,1077Kaelbling, L. P., 278, 556, 605, 686,

857, 1012,1068, 1070, 1077,1082, 1088, 1090

Kager, R., 921,1077Kahn, H., 855,1077Kahneman, D., 2, 517, 620, 638,1077,

1090Kaindl, H., 112,1077Kalman, R., 584, 604,1077Kalman filter, 566,584, 584–591, 603,

604, 981switching,589, 608

Kalman gain matrix,588Kambhampati, S., 157, 390, 394, 395,

431–433,1067, 1069, 1071,1077, 1084

Kameya, Y., 556,1087

Kameyama, M., 884,1075Kaminka, G., 688,1089Kan, A., 110, 405, 432,1080Kanade, T., 951, 968,1087, 1090Kanal, L. N., 111, 112,1077, 1079,

1083Kanazawa, K., 604, 605, 686, 826,

1012,1066, 1070, 1077, 1087Kanefsky, B., 9, 28, 229, 277,1064,

1068Kanodia, N., 686,1074Kanoui, H., 314, 358,1069Kant, E., 358,1067Kantor, G., 1013, 1014,1068Kantorovich, L. V., 155,1077Kaplan, D., 471,1077Kaplan, H., 111,1074Kaplan, R., 884, 920,1066, 1081Karmarkar, N., 155,1077Karmiloff-Smith, A., 921,1071Karp, R. M., 8, 110, 112, 1059,1075,

1077Kartam, N. A., 434,1077Kasami, T., 920,1077Kasif, S., 553,1093Kasparov, G., 29, 192, 193,1077Kassirer, J. P., 505,1074Katriel, I., 212, 228,1091Katz, S., 230,1069Kaufmann, M., 360,1077Kautz, D., 432,1070Kautz, H., 154, 229, 277, 279, 395,

1074, 1077, 1078, 1088Kavraki, L., 1013, 1014,1068, 1078Kay, A. R., 11,1084Kay, M., 884, 907, 922,1066, 1078KB, 235, 274, 315KB-AGENT, 236Keane, M. A., 156,1079Kearns, M., 686, 759, 763, 764, 855,

1078Kebeasy, R. M., 723, 724,1078Kedar-Cabelli, S., 799,1082Keene, R., 29,1074Keeney, R. L., 621, 625, 626, 638,1078Keil, F. C., 3, 1042,1092Keim, G. A., 231,1080Keller, R., 799,1082Kelly, J., 826,1068Kemp, M., 966,1078Kempe, A. B., 1023Kenley, C. R., 553,1088Kephart, J. O., 60,1078Kepler, J., 966kernel,743kernel function,747, 816

1112 Index

polynomial,747kernelization,748kernel machine, 744–748kernel trick, 744,748, 760Kernighan, B. W., 110,1080Kersting, K., 556,1078, 1082Kessler, B., 862, 883,1078Keynes, J. M., 504,1078Khare, R., 469,1078Khatib, O., 1013,1078Khmelev, D. V., 886,1078Khorsand, A., 112,1077Kietz, J.-U., 800,1078Kilgarriff, A., 27, 1078killer move,170Kim, H. J., 852, 857, 1013,1084Kim, J.-H., 1022,1078Kim, J. H., 552,1078Kim, M., 194kinematics,987kinematic state,975King, R. D., 797,1078, 1089Kinsey, E., 109kinship domain, 301–303Kirchner, C., 359,1077Kirk, D. E., 60,1078Kirkpatrick, S., 155, 229,1078Kirman, J., 686,1070Kishimoto, A., 194,1088Kister, J., 192,1078Kisynski, J., 556,1078Kitano, H., 195, 1014,1078Kjaerulff, U., 604,1078KL-ONE, 471Kleer, J. D., 60,1074Klein, D., 883, 896, 900, 920, 921,

1074, 1078, 1085Kleinberg, J. M., 884,1078Klemperer, P., 688,1078Klempner, G., 553,1083Kneser, R., 883,1078Knight, B., 20,1066Knight, K., 2, 922, 927,1078, 1086Knoblock, C. A., 394, 432,1068, 1073KNOWITALL , 885knowledge

acquisition,860and action, 7, 453background,235, 349, 777, 1024,

1025base (KB),235, 274, 315commonsense, 19diagnostic, 497engineering,307, 307–312, 514

for decision-theoretic systems, 634level,236, 275

model-based, 497prior, 39,768, 778, 787

knowledge-based agents,234knowledge-based system, 22–24, 845knowledge acquisition, 23,307, 860knowledge compilation, 799knowledge map,seeBayesian networkknowledge representation,2, 16, 19, 24,

234, 285–290, 437–479analogical, 315everything, 437language,235, 274, 285uncertain, 510–513

Knuth, D. E., 73, 191, 359, 919, 1013,1059,1074, 1078

Kobilarov, G., 439, 469,1066Kocsis, L., 194,1078Koditschek, D., 1013,1078Koehler, J., 395,1078Koehn, P., 922,1078Koenderink, J. J., 968,1078Koenig, S., 157, 395, 434, 685, 1012,

1075, 1078, 1088Koller, D., 191, 505, 553, 556, 558, 604,

605, 639, 677, 686, 687, 826,827, 884, 1012,1065, 1066,1073, 1074, 1076–1078, 1083,1085, 1087, 1090

Kolmogorov’s axioms,489Kolmogorov, A. N., 504, 604, 759,1078Kolmogorov complexity,759Kolobov, A., 556,1082Kolodner, J., 24, 799,1078Kondrak, G., 229, 230,1078Konolige, K., 229, 434, 472, 1012,

1013,1067, 1078, 1079Koo, T., 920,1079Koopmans, T. C., 685,1079Korb, K. B., 558, 687,1079Koren., Y., 1013,1066Korf, R. E., 110–112, 157, 191, 394,

395,1072, 1079, 1085Kortenkamp, D., 1013,1069Koss, F., 1013,1069Kotok, A., 191, 192,1079Koutsoupias, E., 154, 277,1079Kowalski, R., 282, 314, 339, 345, 359,

470, 472,1079, 1087, 1091Kowalski form, 282, 345Koza, J. R., 156,1079Kramer, S., 556,1078Kraus, S., 434,1079Kraus, W. F., 155,1080Krause, A., 639,1079Krauss, P., 555,1088Kriegspiel,180

Kripke, S. A., 470,1079Krishnan, T., 826,1082Krogh, A., 604,1079KRYPTON, 471Ktesibios of Alexandria, 15Kubler, S., 920,1079Kuhn, H. W., 601, 606, 687,1079Kuhns, J.-L., 884,1081Kuijpers, C., 158,1080Kuipers, B. J., 472, 473, 1012,1079Kumar, P. R., 60,1079Kumar, V., 111, 112, 230,1074, 1077,

1079, 1083Kuniyoshi, Y., 195, 1014,1078Kuppuswamy, N., 1022,1078Kurien, J., 157,1079Kurzweil, R., 2, 12, 28, 1038,1079Kwok, C., 885,1079Kyburg, H. E., 505,1079

LL-BFGS, 760label (in plans),137, 158Laborie, P., 432,1079Ladanyi, L., 112,1086Ladkin, P., 470,1079Lafferty, J., 884, 885,1079Lagoudakis, M. G., 854, 857,1074,

1079Laguna, M., 154,1074Laird, J., 26, 336, 358, 432, 799, 1047,

1077, 1079, 1092Laird, N., 604, 826,1070Laird, P., 154, 229,1082Lake, R., 194,1088Lakemeyer, G., 1012,1067Lakoff, G., 469, 921, 1041,1079Lam, J., 195,1079LAMA, 387, 395Lamarck, J. B., 130,1079Lambert’s cosine law,934Lambertian surface, 969Landauer, T. K., 883,1070Landhuis, E., 620,1079landmark,980landscape (in state space),121Langdon, W., 156,1079, 1085Langley, P., 800,1079Langlotz, C. P., 26,1076Langton, C., 155,1079language,860, 888, 890

abhors synonyms, 870formal, 860model,860, 909, 913

in disambiguation, 906natural, 4, 286, 861

Index 1113

processing, 16, 860translation, 21, 784, 907–912understanding, 20, 23

language generation,899language identification,862Laplace, P., 9, 491, 504, 546, 883,1079Laplace smoothing, 863Laptev, I., 961,1080large-scale learning,712Lari, K., 896, 920,1080Larkey, P. D., 687,1077Larranaga, P., 158,1080Larsen, B., 553,1080Larson, G., 778Larson, S. C., 759,1080Laruelle, H., 395, 431,1073Laskey, K. B., 556,1080Lassez, J.-L., 359,1077Lassila, O., 469,1065latent Dirichlet allocation, 883latent semantic indexing, 883latent variable,816Latham, D., 856,1081Latombe, J.-C., 432, 1012, 1013,1071,

1078, 1080, 1093lattice theory, 360Laugherty, K., 920,1074Lauritzen, S., 553, 558, 639, 826,1069,

1080, 1084, 1089LaValle, S., 396, 1013, 1014,1080Lave, R. E., 686,1087Lavrauc, N., 796, 799, 800,1080, 1082LAWALY , 432Lawler, E. L., 110, 111, 405, 432,1080laws of thought, 4layers,729Lazanas, A., 1013,1080laziness,481La Mettrie, J. O., 1035, 1041,1079La Mura, P., 638,1079LCF, 314Leacock, C., 1022,1067leaf node,75leak node,519Leaper, D. J., 505,1070leaping to conclusions, 778learning,39, 44, 59, 236, 243, 693,

1021, 1025active,831apprenticeship,857, 1037assessing performance, 708–709Bayesian, 752,803, 803–804, 825Bayesian network, 813–814blocks-world, 20cart–pole problem, 851checkers, 18

computational theory, 713decision lists, 715–717decision trees, 697–703determinations, 785element,55ensemble,748, 748–752explanation-based, 780–784game playing, 850–851grammar, 921heuristics, 107hidden Markov model, 822–823hidden variables, 820hidden variables, 822incremental, 773, 777inductive,694, 695–697

knowledge-based,779, 788, 798instance-based,737, 737–739, 855knowledge in, 777–780linearly separable functions, 731logical, 768–776MAP, 804–805maximum likelihood, 806–810metalevel,102mixtures of Gaussians, 817–820naive Bayes, 808–809neural network, 16, 736–737new predicates, 790, 796noise, 705–706nonparametric, 737online,752, 846PAC, 714, 759, 784parameter,806, 810–813passive,831Q, 831, 843, 844, 848, 973rate of,719, 836reinforcement, 685,695, 830–859,

1025inverse,857relational,857

relevance-based, 784–787restaurant problem, 698statistical, 802–805temporal difference, 836–838, 853,

854top-down, 791–794to search, 102unsupervised,694, 817–820, 1025utility functions, 831weak,749

learning curve,702least-constraining-value heuristic,217least commitment,391leave-one-out cross-validation

(LOOCV), 708LeCun, Y., 760, 762, 967, 1047,1065,

1080, 1086

Lederberg, J., 23, 468,1072, 1080Lee, C.-H., 1022,1078Lee, K.-H., 1022,1078Lee, M. S., 826,1083Lee, R. C.-T., 360,1068Lee, T.-M., 11,1084Leech, G., 920, 921,1080, 1086legal reasoning, 32Legendre, A. M., 759,1080Lehmann, D., 434,1079Lehmann, J., 439, 469,1066Lehrer, J., 638,1080Leibniz, G. W., 6, 131, 276, 504, 687Leimer, H., 553,1080Leipzig, 12Leiserson, C. E., 1059,1069Lempel-Ziv-Welch compression (LZW),

867Lenat, D. B., 27, 439, 469, 474, 800,

1070, 1075, 1080lens system, 931Lenstra, J. K., 110, 405, 432,1080Lenzerini, M., 471,1067Leonard, H. S., 470,1080Leonard, J., 1012,1066, 1080Leone, N., 230, 472,1071, 1074Lesh, N., 433,1072Lesniewski, S., 470,1080Lesser, V. R., 434,1071Lettvin, J. Y., 963,1080Letz, R., 359,1080level (in planning graphs),379level cost,382leveled off (planning graph),381Levesque, H. J., 154, 277, 434, 471,

473,1067, 1069, 1080, 1088Levin, D. A., 604,1080Levinson, S., 314,1066, 1074Levitt, G. M., 190,1080Levitt, R. E., 434,1077Levitt, T. S., 1012,1079Levy, D., 195, 1022,1080Lewis, D. D., 884,1080Lewis, D. K., 60, 1042,1080LEX, 776, 799lexical category,888lexicalized grammar, 897lexicalized PCFG,897, 919, 920lexicon,890, 920Leyton-Brown, K., 230, 435, 688,1080,

1088LFG, 920Li, C. M., 277,1080Li, H., 686,1077Li, M., 759, 1080liability, 1036

1114 Index

Liang, G., 553,1068Liang, L., 604,1083Liao, X., 686,1077Liberatore, P., 279,1080Lifchits, A., 885,1085life insurance, 621Lifschitz, V., 472, 473,1073, 1080,

1091lifting, 326, 325–329, 367

in probabilistic inference, 544lifting lemma, 350,353light, 932Lighthill, J., 22,1080Lighthill report, 22, 24likelihood,803L IKELIHOOD-WEIGHTING, 534likelihood weighting,532, 552, 596Lim, G., 439,1089limited rationality,5Lin, D., 885,1085Lin, J., 872, 885,1065Lin, S., 110, 688,1080, 1092Lin, T., 439,1089Lincoln, A., 872Lindley, D. V., 639,1080Lindsay, R. K., 468,1080linear-chain conditional random field,

878linear algebra, 1055–1057linear constraint,205linear function,717linear Gaussian,520, 553, 584, 809linearization,981linear programming,133, 153, 155, 206,

673linear regression,718, 810linear resolution,356, 795linear separability,723linear separator, 746line search,132linguistics, 15–16link, 870link (in a neural network),728linkage constraints,986Linnaeus, 469L INUS, 796Lipkis, T. A., 471,1088liquid event,447liquids, 472Lisp, 19, 294lists,305literal (sentence),244literal, watched, 277Littman, M. L., 155, 231, 433, 686, 687,

857,1064, 1068, 1077, 1080,1081

Liu, J. S., 605,1080Liu, W., 826,1068Liu, X., 604,1083Livescu, K., 604,1080Livnat, A., 434,1080lizard toasting, 778local beam search,125, 126local consistency,208locality, 267, 547locality-sensitive hash (LSH),740localization,145, 581, 979

Markov, 1012locally structured system,515locally weighted regression,742local optimum, 669local search, 120–129, 154, 229,

262–263, 275, 277location sensors,974Locke, J., 6, 1042,1080Lodge, D., 1051,1080Loebner Prize, 1021Loftus, E., 287,1080Logemann, G., 260, 276,1070logic, 4, 7, 240–243

atoms, 294–295default,459, 468, 471equality in, 299first-order,285, 285–321

inference, 322–325semantics, 290syntax, 290

fuzzy, 240, 289, 547, 550, 557higher-order,289inductive, 491,505interpretations, 292–294model preference,459models, 290–292nonmonotonic, 251,458, 458–460,

471notation, 4propositional, 235, 243–247, 274, 286

inference, 247–263semantics, 245–246syntax, 244–245

quantifier, 295–298resolution, 252–256sampling, 554temporal,289terms, 294variable in, 340

logical connective, 16, 244, 274, 295logical inference, 242, 322–365logical minimization,442logical omniscience,453logical piano, 276logical positivism,6

logical reasoning, 249–264, 284logicism,4logic programming, 257, 314, 337,

339–345constraint, 344–345, 359inductive (ILP),779, 788–794, 798tabled,343

Logic Theorist, 17, 276LOGISTELLO, 175, 186logistic function,522, 760logistic regression,726logit distribution,522log likelihood,806Lohn, J. D., 155,1080London, 14Long, D., 394, 395,1072, 1073long-distance dependencies, 904long-term memory, 336Longley, N., 692,1080Longuet-Higgins, H. C.,1080Loo, B. T., 275,1080LOOCV, 708Look ma, no hands, 18lookup table, 736Loomes, G., 637,1086loosely coupled system,427Lorenz, U., 193,1071loss function,710Lotem, A., 396,1091lottery,612, 642

standard,615love, 1021Love, N., 195,1080Lovejoy, W. S., 686,1080Lovelace, A., 14Loveland, D., 260, 276, 359,1070, 1080low-dimensional embedding,985Lowe, D., 947, 967, 968,1081Lowenheim, L., 314,1081Lowerre, B. T., 154, 922,1081Lowrance, J. D., 557,1087Lowry, M., 356, 360,1075, 1081Loyd, S., 109,1081Lozano-Perez, T., 1012, 1013,1067,

1081, 1092LPG, 387, 395LRTA*, 151, 157, 415LRTA*-A GENT, 152LRTA*-C OST, 152LSH (locality-sensitive hash), 740LT, 17Lu, F., 1012,1081Lu, P., 194, 760,1067, 1088Luby, M., 124, 554,1069, 1081Lucas, J. R., 1023,1081Lucas, P., 505, 634,1081

Index 1115

Luce, D. R., 9, 687,1081Lucene, 868Ludlow, P., 1042,1081Luger, G. F., 31,1081Lugosi, G., 761,1068Lull, R., 5Luong, Q.-T., 968,1072Lusk, E., 360,1092Lygeros, J., 60,1068Lyman, P., 759,1081Lynch, K., 1013, 1014,1068LZW, 867

MMA* search,101, 101–102, 112MACHACK-6, 192Machina, M., 638,1081machine evolution,21machine learning,2, 4machine reading,881machine translation, 32, 907–912, 919

statistical, 909–912Machover, M., 314,1065MacKay, D. J. C., 555, 761, 763,1081,

1082MacKenzie, D., 360,1081Mackworth, A. K., 2, 59, 209, 210, 228,

230,1072, 1081, 1085macrop (macro operator),432, 799madalines, 761Madigan, C. F., 277,1083magic sets, 336, 358Mahalanobis distance,739Mahanti, A., 112,1081Mahaviracarya, 503Maheswaran, R., 230,1085Maier, D., 229, 358,1065Mailath, G., 688,1081Majercik, S. M., 433,1081majority function, 731makespan,402Makov, U. E., 826,1090Malave, V. L., 288,1082Maldague, P., 28,1064Mali, A. D., 432,1077Malik, J., 604, 755, 762, 941, 942, 953,

967, 968,1065, 1070, 1076,1081, 1088

Malik, S., 277,1083Manchak, D., 470,1091Maneva, E., 278,1081Maniatis, P., 275,1080manipulator,971Manna, Z., 314,1081Mannila, H., 763,1074

Manning, C., 883–885, 920, 921,1078,1081

Mannion, M., 314,1081Manolios, P., 360,1077Mansour, Y., 686, 764, 855, 856,1078,

1090mantis shrimp, 935Manzini, G., 111,1081map, 65MAP (maximum a posteriori), 804MAPGEN, 28Marais, H., 884,1088Marbach, P., 855,1081March, J. G., 637,1075Marcinkiewicz, M. A., 895, 921,1081Marcot, B., 553,1086Marcus, G., 638,1081Marcus, M. P., 895, 921,1081margin,745marginalization,492Markov

assumptionsensor,568

processfirst-order,568

Markov, A. A., 603, 883,1081Markov assumption,568, 603Markov blanket,517, 560Markov chain,537, 568, 861Markov chain Monte Carlo (MCMC),

535, 535–538, 552, 554, 596decayed,605

Markov decision process (MDP), 10,647, 684, 686, 830

factored,686partially observable (POMDP),658,

658–666, 686Markov games, 857Markov network,553Markov process,568Markov property, 577, 603, 646Maron, M. E., 505, 884,1081Marr, D., 968,1081Marriott, K., 228,1081Marshall, A. W., 855,1077Marsland, A. T., 195,1081Marsland, S., 763,1081Martelli, A., 110, 111, 156,1081Marthi, B., 432, 556, 605, 856,1081,

1082, 1085Martin, D., 941, 967,1081Martin, J. H., 885, 886, 920–922,1077,

1081Martin, N., 358,1067Martin, P., 921,1076

Mason, M., 156, 433, 1013, 1014,1071,1081

Mason, R. A., 288,1082mass (in Dempster–Shafer theory),549mass noun,445mass spectrometer, 22Mataric, M. J., 1013,1081Mateescu, R., 230,1070Mateis, C., 472,1071materialism, 6material value,172Mates, B., 276,1081mathematical induction schema, 352mathematics, 7–9, 18, 30Matheson, J. E., 626, 638,1076, 1082matrix,1056Matsubara, H., 191, 195,1072, 1078Maturana, H. R., 963,1080Matuszek, C., 469,1081Mauchly, J., 14Mausam., 432,1069MAVEN, 195MAX -VALUE, 166, 170maximin,670maximin equilibrium,672maximum

global,121local,122

maximum a posteriori,804, 825maximum expected utility,483, 611maximum likelihood,805, 806–810,

825maximum margin separator, 744,745max norm,654MAX PLAN , 387Maxwell, J., 546, 920,1081Mayer, A., 112, 119,1075Mayne, D. Q., 605,1075Mazumder, P., 110,1088Mazurie, A., 605,1085MBP, 433McAllester, D. A., 25, 156, 191, 198,

394, 395, 472, 855, 856,1072,1077, 1081, 1090

MCC, 24McCallum, A., 877, 884, 885,1069,

1072, 1077, 1079, 1081, 1084,1085, 1090

McCarthy, J., 17–19, 27, 59, 275, 279,314, 395, 440, 471, 1020, 1031,1081, 1082

McCawley, J. D., 920,1082McClelland, J. L., 24,1087McClure, M., 604,1065McCorduck, P., 1042,1082

1116 Index

McCulloch, W. S., 15, 16, 20, 278, 727,731, 761, 963,1080, 1082

McCune, W., 355, 360,1082McDermott, D., 2, 156, 358, 394, 433,

434, 454, 470, 471,1068, 1073,1082

McDermott, J., 24, 336, 358,1082McDonald, R., 288, 920,1079McEliece, R. J., 555,1082McGregor, J. J., 228,1082McGuinness, D., 457, 469, 471,1064,

1066, 1089McIlraith, S., 314,1082McLachlan, G. J., 826,1082McMahan, B., 639,1079MCMC, 535, 535–538, 552, 554, 596McMillan, K. L., 395,1082McNealy, S., 1036McPhee, N., 156,1085MDL, 713, 759, 805MDP, 10,647, 684, 686, 830mean-field approximation,554measure,444measurement, 444mechanism,679

strategy-proof,680mechanism design,679, 679–685medical diagnosis, 23, 505, 517, 548,

629, 1036Meehan, J., 358,1068Meehl, P., 1022,1074, 1082Meek, C., 553,1092Meet (interval relation), 448Megarian school, 275megavariable, 578Meggido, N., 677, 687,1078Mehlhorn, K., 112,1069mel frequency cepstral coefficient

(MFCC),915Mellish, C. S., 359,1068memoization, 343, 357,780memory requirements, 83, 88MEMS, 1045Mendel, G., 130,1082meningitis, 496–509mental model, in disambiguation, 906mental objects, 450–453mental states,1028Mercer’s theorem,747Mercer, J., 747,1082Mercer, R. L., 883, 922,1067, 1077mereology,470Merkhofer, M. M., 638,1082Merleau-Ponty, M., 1041,1082Meshulam, R., 112,1072Meta-DENDRAL, 776, 798

metadata,870metalevel, 1048metalevel state space,102metaphor,906, 921metaphysics, 6metareasoning,189

decision-theoretic,1048metarule,345meteorite, 422, 480metonymy,905, 921Metropolis, N., 155, 554,1082Metropolis–Hastings,564Metropolis algorithm, 155, 554Metzinger, T., 1042,1082Metzler, D., 884,1069MEXAR2, 28Meyer, U., 112,1069Mezard, M., 762,1082MGONZ, 1021MGSS*, 191MGU (most general unifier), 327, 329,

353, 361MHT (multiple hypothesis tracker), 606Mian, I. S., 604, 605,1079, 1083Michalski, R. S., 799,1082Michaylov, S., 359,1077Michie, D., 74, 110, 111, 156, 191, 763,

851, 854, 1012,1071, 1082micro-electromechanical systems

(MEMS), 1045micromort,616, 637, 642Microsoft, 553, 874microworld,19, 20, 21Middleton, B., 519, 552,1086Miikkulainen, R., 435,1067Milch, B., 556, 639,1078, 1082, 1085Milgrom, P., 688,1082Milios, E., 1012,1081military uses of AI, 1035Mill, J. S., 7, 770, 798,1082Miller, A. C., 638,1082Miller, D., 431,1070million queens problem, 221, 229Millstein, T., 395,1071Milner, A. J., 314,1074M IN-CONFLICTS, 221min-conflicts heuristic, 220, 229M IN-VALUE, 166, 170mind, 2, 1041

dualistic view, 1041and mysticism, 12philosophy of, 1041as physical system, 6theory of, 3

mind–body problem,1027minesweeper, 284

M INIMAL -CONSISTENT-DET, 786minimal model,459M INIMAX -DECISION, 166minimax algorithm, 165, 670minimax decision,165minimax search, 165–168, 188, 189minimax value,164, 178minimum

global,121local,122

minimum-remaining-values,216, 333minimum description length (MDL),

713, 759, 805minimum slack,405minimum spanning tree (MST), 112,

119M INI SAT, 277Minker, J., 358, 473,1073, 1082Minkowski distance,738Minsky, M. L., 16, 18, 19, 22, 24, 27,

434, 471, 552, 761, 1020, 1039,1042,1082

Minton, S., 154, 229, 432, 799,1068,1082

Miranker, D. P., 229,1065Misak, C., 313,1082missing attribute values,706missionaries and cannibals, 109,115,

468MIT, 17–19, 1012Mitchell, D., 154, 277, 278,1069, 1088Mitchell, M., 155, 156,1082Mitchell, T. M., 61, 288, 763, 776, 798,

799, 884, 885, 1047,1066, 1067,1069, 1082, 1084

Mitra, M., 870,1089mixed strategy,667mixing time,573mixture

distribution,817mixture distribution,817mixture of Gaussians, 608,817, 820Mizoguchi, R., 27,1075ML, seemaximum likelihoodmodal logic, 451model, 50,240, 274, 289, 313, 451

causal, 517(in representation), 13sensor, 579, 586, 603theory, 314transition,67, 108, 134, 162, 266,

566, 597, 603, 646, 684, 832,979

MODEL-BASED-REFLEX-AGENT, 51model-based reflex agents, 59model checking,242, 274

Index 1117

model selection,709, 825Modus Ponens,250, 276, 356, 357, 361

Generalized,325, 326Moffat, A., 884,1092MOGO, 186, 194Mohr, R., 210, 228, 968,1082, 1088Mohri, M., 889,1083Molloy, M., 277,1064monism,1028monitoring,145monkey and bananas, 113, 396monotone condition, 110monotonicity

of a heuristic,95of a logical system,251, 458of preferences,613

Montague, P. R., 854,1083, 1088Montague, R., 470, 471, 920,1077,

1083Montanari, U., 111, 156, 228,1066,

1081, 1083MONTE-CARLO-LOCALIZATION , 982Monte Carlo (in games),183Monte Carlo, sequential,605Monte Carlo algorithm,530Monte Carlo localization,981Monte Carlo simulation,180Montemerlo, M., 1012,1083Mooney, R., 799, 902, 921,1070, 1083,

1093Moore’s Law, 1038Moore, A., 826,1083Moore, A. W., 154, 826, 854, 857,1066,

1077, 1083Moore, E. F., 110,1083Moore, J. S., 356, 359, 360,1066, 1077Moore, R. C., 470, 473, 922,1076, 1083Moravec, H. P., 1012, 1029, 1038,1083More, T., 17Morgan, J., 434,1069Morgan, M., 27,1069Morgan, N., 922,1074Morgenstern, L., 470, 472, 473,1070,

1083Morgenstern, O., 9, 190, 613, 637,1091Moricz, M., 884,1088Morjaria, M. A., 553,1083Morris, A., 604,1089Morris, P., 28, 60, 431,1064, 1077Morrison, E., 190,1083Morrison, P., 190,1083Moses, Y., 470, 477,1072Moskewicz, M. W., 277,1083Mossel, E., 278,1081Mosteller, F., 886,1083

most general unifier (MGU), 327, 329,353, 361

most likely explanation, 553, 603most likely state,993Mostow, J., 112, 119,1083motion, 948–951

compliant,986, 995guarded, 995

motion blur,931motion model,979motion parallax, 949, 966motion planning, 986Motwani, R., 682, 760,1064, 1073Motzkin, T. S., 761,1083Moutarlier, P., 1012,1083movies

movies2001: A Space Odyssey, 552

moviesA.I., 1040

moviesThe Matrix, 1037

moviesThe Terminator, 1037

Mozetic, I., 799,1082MPI (mutual preferential

independence), 625MRS (metalevel reasoning system), 345MST, 112, 119Mueller, E. T., 439, 470,1083, 1089Muggleton, S. H., 789, 795, 797, 800,

921,1071, 1083, 1089, 1090Muller, M., 186, 194,1083, 1088Muller, U., 762, 967,1080multiagent environments, 161multiagent planning, 425–430multiagent systems,60, 667multiattribute utility theory,622, 638multibody planning,425, 426–428multiplexer,543multiply connected network,528multivariate linear regression,720Mumford, D., 967,1083MUNIN, 552Murakami, T., 186Murga, R., 158,1080Murphy, K., 555, 558, 604, 605, 1012,

1066, 1071, 1073, 1083, 1090Murphy, R., 1014,1083Murray-Rust, P., 469,1083Murthy, C., 360,1083Muscettola, N., 28, 60, 431, 432,1077,

1083music, 14Muslea, I., 885,1083mutagenicity, 797

mutation, 21,128, 153mutex,380mutual exclusion,380mutual preferential independence

(MPI), 625mutual utility independence (MUI),626MYCIN, 23, 548, 557Myerson, R., 688,1083myopic policy,632mysticism, 12

Nn-armed bandit,841n-gram model, 861Nadal, J.-P., 762,1082Nagasawa, Y., 1042,1081Nagel, T., 1042,1083Naım, P., 553,1086naive Bayes,499, 503, 505, 808–809,

820, 821, 825naked, 214Nalwa, V. S., 12,1083Naor, A., 278,1064Nardi, D., 471,1064, 1067narrow content,1028NASA, 28, 392, 432, 472, 553, 972Nash, J.,1083Nash equilibrium, 669, 685NASL, 434NATACHATA , 1021natural kind,443natural numbers,303natural stupidity, 454Nau, D. S., 111, 187, 191, 192, 195,

372, 386, 395, 396, 432,1071–1073, 1079, 1083, 1084,1089, 1091

navigation function,994Nayak, P., 60, 157, 432, 472,1079, 1083Neal, R., 762,1083Nealy, R., 193nearest-neighbor filter,601nearest-neighbors,738, 814nearest-neighbors regression,742neatvs.scruffy, 25Nebel, B., 394, 395,1076, 1078, 1083needle in a haystack, 242Nefian, A., 604,1083negation,244negative example,698negative literal, 244negligence, 1036Nelson, P. C., 111,1071Nemirovski, A., 155,1065, 1083NERO, 430, 435

1118 Index

Nesterov, Y., 155,1083Netto, E., 110,1083network tomography, 553neural network, 16, 20, 24, 186,727,

727–737expressiveness, 16feed-forward,729hardware, 16learning, 16, 736–737multilayer, 22, 731–736perceptron, 729–731radial basis function, 762single layer,seeperceptron

neurobiology, 968NEUROGAMMON, 851neuron,10, 16, 727, 1030neuroscience,10, 10–12, 728

computational,728Nevill-Manning, C. G., 921,1083NEW-CLAUSE, 793Newborn, M., 111,1085Newell, A., 3, 17, 18, 26, 60, 109, 110,

191, 275, 276, 336, 358, 393,432, 799, 1047,1079, 1084,1089

Newman, P., 1012,1066, 1071Newton, I., 1, 47, 131, 154, 570, 760,

1084Newton–Raphson method,132Ney, H., 604, 883, 922,1078, 1084Ng, A. Y., 686, 759, 850, 852, 855–857,

883, 1013,1066, 1068, 1078,1084

Nguyen, H., 883,1078Nguyen, X., 394, 395,1084Niblett, T., 800,1068Nicholson, A., 558, 604, 686, 687,

1070, 1079, 1084Nielsen, P. E., 358,1077Niemela, I., 472,1084Nigam, K., 884, 885,1069, 1077, 1084Nigenda, R. S., 395,1084Niles, I., 469,1084, 1085Nilsson, D., 639,1084Nilsson, N. J., 2, 27, 31, 59, 60,

109–111, 119, 156, 191, 275,314, 350, 359, 367, 393, 432,434, 555, 761, 799, 1012, 1019,1034,1072, 1073, 1075, 1084,1091

Nine-Men’s Morris, 194Niranjan, M., 605, 855,1070, 1087Nisan, N., 688,1084NIST, 753nitroaromatic compounds, 797Niv, Y., 854,1070

Nivre, J., 920,1079Nixon, R., 459, 638, 906Nixon diamond, 459Niyogi, S., 314,1090NLP (natural language processing),2,

860no-good,220, 385no-regret learning,753NOAH, 394, 433Nobel Prize, 10, 22Nocedal, J., 760,1067Noda, I., 195, 1014,1078node

child, 75current, in local search,121parent,75

node consistency,208Noe, A., 1041,1084noise,701, 705–706, 712, 776, 787, 802noisy-AND, 561noisy-OR,518noisy channel model,913nominative case, 899nondeterminism

angelic,411demonic,410

nondeterministic environment,43nonholonomic,976NONLIN, 394NONLIN+, 431, 432nonlinear,589nonlinear constraints,205nonmonotonicity,458nonmonotonic logic, 251,458,

458–460, 471Nono, 330nonstationary, 857nonterminal symbol, 889,890, 1060Normal–Wishart, 811normal distribution, 1058

standard,1058normal form, 667normalization (of a probability

distribution),493normalization (of attribute ranges),739Norman, D. A., 884,1066normative theory,619North, O., 330North, T., 21,1072Norvig, P., 28, 358, 444, 470, 604, 759,

883, 921, 922,1074, 1078, 1084,1087

notationinfix, 303logical, 4prefix,304

noughts and crosses, 162, 190, 197Nourbakhsh, I., 156,1073Nowak, R., 553,1068Nowatzyk, A., 192,1076Nowick, S. M., 279,1084Nowlan, S. J., 155,1075NP (hard problems), 1054–1055NP-complete, 8, 71, 109, 250, 276, 471,

529, 762, 787,1055NQTHM, 360NSS chess program, 191nuclear power, 561number theory, 800Nunberg, G., 862, 883, 921,1078, 1084NUPRL, 360Nussbaum, M. C., 1041,1084Nyberg, L., 11,1067

OO() notation, 1054O’Malley, K., 688,1092O’Reilly, U.-M., 155,1084O-PLAN , 408, 431, 432Oaksford, M., 638,1068, 1084object, 288, 294

composite,442object-level state space,102object-oriented programming, 14, 455objective case, 899objective function,15, 121objectivism,491object model,928observable, 42observation model, 568observation prediction, 142observation sentences, 6occupancy grid,1012occupied space,988occur check,327, 340Och, F. J., 29, 604, 921, 922,1067,

1084, 1093Ockham’s razor,696, 757–759, 777,

793, 805Ockham, W., 696, 758Oddi, A., 28,1068odometry,975Odyssey, 1040Office Assistant, 553offline search,147Ogasawara, G., 604,1076Ogawa, S., 11,1084Oglesby, F., 360,1074Oh, S., 606,1084Ohashi, T., 195,1091Olalainty, B., 432,1073

Index 1119

Olesen, K. G., 552–554,1064, 1084Oliver, N., 604,1084Oliver, R. M., 639,1084Oliver, S. G., 797,1078Olshen, R. A., 758,1067omniscience,38Omohundro, S., 27, 920, 1039,1084,

1089Ong, D., 556,1082ONLINE-DFS-AGENT, 150online learning,752, 846online planning, 415online replanning,993online search,147, 147–154, 157ontological commitment,289, 313, 482,

547ontological engineering,437, 437–440ontology,308, 310

upper, 467open-coding,341open-loop,66open-universe probability model

(OUPM),545, 552open-world assumption, 417open class,890OPENCYC, 469open list,seefrontierOPENM IND, 439operationality,783operations research,10, 60, 110, 111Oppacher, F., 155,1084OPS-5, 336, 358optical flow,939, 964, 967optimal brain damage,737optimal controllers,997optimal control theory, 155optimality, 121optimality (of a search algorithm),80,

108optimality theory (Linguistics), 921optimally efficient algorithm,98optimal solution,68optimism under uncertainty,151optimistic description (of an action),412optimistic prior, 842optimization,709

convex,133, 153optimizer’s curse,619, 637OPTIMUM-AIV, 432OR-SEARCH, 136orderability,612ordinal utility, 614Organon, 275, 469orientation,938origin function,545Ormoneit, D., 855,1084

OR node,135Osawa, E., 195, 1014,1078Osborne, M. J., 688,1084Oscar, 435Osherson, D. N., 759,1084Osindero, S., 1047,1075Osman, I., 112,1086Ostland, M., 556, 606,1085Othello, 186OTTER, 360, 364OUPM,545, 552outcome,482, 667out of vocabulary,864Overbeek, R., 360,1092overfitting,705, 705–706, 736, 802, 805overgeneration,892overhypotheses, 798Overmars, M., 1013,1078overriding,456Owens, A. J., 156,1072OWL, 469

PP (probability vector), 487P (s′ | s, a) (transition model), 646, 832PAC learning,714, 716, 759Padgham, L., 59,1084Page, C. D., 800,1069, 1084Page, L., 870, 884,1067PageRank,870Palacios, H., 433,1084Palay, A. J., 191,1084Palmer, D. A., 922,1084Palmer, J., 287,1080Palmer, S., 968,1084Palmieri, G., 761,1073Panini, 16, 919Papadimitriou, C. H., 154, 157, 277,

685, 686, 883, 1059,1070, 1079,1084

Papadopoulo, T., 968,1072Papavassiliou, V., 855,1084Papert, S., 22, 761,1082PARADISE, 189paradox, 471, 641

Allais, 620Ellsberg, 620St. Petersburg, 637

parallel distributed processing,seeneural network

parallelismAND-, 342OR-,342

parallel lines, 931parallel search,112parameter,520, 806

parameter independence,812parametric model,737paramodulation,354, 359Parekh, R., 921,1084Pareto dominated,668Pareto optimal,668Parisi, D., 921,1071Parisi, G., 555,1084Parisi, M. M. G., 278,1084Park, S., 356,1075Parker, A., 192,1084Parker, D. B., 761,1084Parker, L. E., 1013,1084Parr, R., 686, 854, 856, 857, 1050,1074,

1077–1079, 1084, 1087Parrod, Y., 432,1064parse tree,890parsing,892, 892–897Partee, B. H., 920,1086partial assignment,203partial evaluation, 799partial observability, 180, 658partial program,856PARTICLE-FILTERING, 598particle filtering,597, 598, 603, 605

Rao-Blackwellized,605, 1012partition,441part of, 441part of speech, 888Parzen, E., 827,1085Parzen window, 827Pasca, M., 885,1071, 1085Pascal’s wager, 504, 637Pascal, B., 5, 9, 504Pasero, R., 314, 358,1069Paskin, M., 920,1085PASSIVE-ADP-AGENT, 834PASSIVE-TD-AGENT, 837passive learning,831Pasula, H., 556, 605, 606,1081, 1085Patashnik, O., 194,1085Patel-Schneider, P., 471,1064path,67, 108, 403

loopy,75redundant,76

path consistency,210, 228path cost,68, 108PATHFINDER, 552path planning,986Patil, R., 471, 894, 920,1068, 1071Patrick, B. G., 111,1085Patrinos, A., 27,1069pattern database,106, 112, 379

disjoint,107pattern matching,333Paul, R. P., 1013,1085

1120 Index

Paulin-Mohring, C., 359,1066Paull, M., 277,1072Pauls, A., 920,1085Pavlovic, V., 553,1093Pax-6 gene, 966payoff function, 162,667Pazzani, M., 505, 826,1071PCFG

lexicalized,897, 919, 920P controller,998PD controller,999PDDL (Planing Domain Definition

Language), 367PDP (parallel distributed processing),

761Peano, G., 313,1085Peano axioms,303, 313, 333Pearce, J., 230,1085Pearl, J., 26, 61, 92, 110–112, 154, 191,

229, 509, 511, 517, 549,552–555, 557, 558, 644, 826,827,1070, 1073, 1074, 1076,1078, 1085

Pearson, J., 230,1085PEAS description,40, 42Pease, A., 469,1084, 1085Pecheur, C., 356,1075Pednault, E. P. D., 394, 434,1085peeking,708, 737PEGASUS, 850, 852, 859Peirce, C. S., 228, 313, 454, 471, 920,

1085Pelikan, M., 155,1085Pell, B., 60, 432,1083Pemberton, J. C., 157,1085penalty, 56Penberthy, J. S., 394,1085Peng, J., 855,1085PENGI, 434penguin, 435Penix, J., 356,1075Pennachin, C., 27,1074Pennsylvania, Univ. of, 14Penn Treebank, 881, 895Penrose, R., 1023,1085Pentagon Papers, 638Peot, M., 433, 554,1085, 1088percept,34perception, 34, 305,928, 928–965perception layer,1005perceptron, 20,729, 729–731, 761

convergence theorem, 20learning rule,724network,729representational power, 22sigmoid,729

percept schema,416percept sequence,34, 37Pereira, F., 28, 339, 341, 470, 759, 761,

884, 885, 889, 919, 1025,1071,1074, 1079, 1083, 1085, 1088,1091

Pereira, L. M., 341,1091Peres, Y., 278, 604, 605,1064, 1080,

1081Perez, P., 961,1080perfect information, 666perfect recall, 675performance element,55, 56performance measure,37, 40, 59, 481,

611Perkins, T., 439,1089Perlis, A., 1043,1085Perona, P., 967,1081perpetual punishment,674perplexity,863Perrin, B. E., 605,1085persistence action,380persistence arc,594persistent (variable), 1061persistent failure model,593Person, C., 854,1083perspective, 966perspective projection,930Pesch, E., 432,1066Peshkin, M., 156,1092pessimistic description (of an action),

412Peters, S., 920,1071Peterson, C., 555,1085Petrie, K., 230,1073Petrie, T., 604, 826,1065Petrik, M., 434,1085Petrov, S., 896, 900, 920,1085Pfeffer, A., 191, 541, 556, 687,1078,

1085Pfeifer, G., 472,1071Pfeifer, R., 1041,1085phase transition, 277phenomenology, 1026Philips, A. B., 154, 229,1082Philo of Megara, 275philosophy, 5–7, 59, 1020–1043phone (speech sound),914phoneme,915phone model,915phonetic alphabet, 914photometry, 932photosensitive spot, 963phrase structure,888, 919physicalism,1028, 1041physical symbol system,18

Pi, X., 604,1083Piccione, C., 687,1093Pickwick, Mr., 1026pictorial structure model,958PID controller,999Pieper, G., 360,1092pigeons, 13Pijls, W., 191,1085pineal gland, 1027Pineau, J., 686, 1013,1085Pinedo, M., 432,1085ping-pong, 32, 830pinhole camera,930Pinkas, G., 229,1085Pinker, S., 287, 288, 314, 921,1085,

1087Pinto, D., 885,1085Pipatsrisawat, K., 277,1085Pippenger, N., 434,1080Pisa, tower of, 56Pistore, M., 275,1088pit, bottomless, 237Pitts, W., 15, 16, 20, 278, 727, 731, 761,

963,1080, 1082pixel, 930PL-FC-ENTAILS?,258PL-RESOLUTION, 255Plaat, A., 191,1085Place, U. T., 1041,1085PLAN -ERS1, 432PLAN -ROUTE, 270planetary rover,971PLANEX , 434Plankalkul, 14plan monitoring, 423PLANNER, 24, 358planning, 52, 366–436

and acting, 415–417as constraint satisfaction, 390as deduction, 388as refinement, 390as satisfiability, 387blocks world, 20case-based,432conformant, 415, 417–421, 431,433,

994contingency,133, 415, 421–422, 431decentralized,426fine-motion,994graph,379, 379–386, 393

serial,382hierarchical, 406–415, 431hierarchical task network, 406history of, 393linear,394multibody,425, 426–428

Index 1121

multieffector,425non-interleaved,398online, 415reactive,434regression,374, 394route, 19search space, 373–379sensorless, 415, 417–421

planning and control layer,1006plan recognition,429PlanSAT,372

bounded, 372plateau (in local search),123Plato, 275, 470, 1041Platt, J., 760,1085player (in a game),667Plotkin, G., 359, 800,1085Plunkett, K., 921,1071ply, 164poetry, 1Pohl, I., 110, 111, 118,1085point-to-point motion,986pointwise product,526poker, 507Poland, 470Poli, R., 156,1079, 1085Policella, N., 28,1068policy, 176, 434, 647, 684, 994

evaluation,656, 832gradient,849improvement,656iteration,656, 656–658, 685, 832

asynchronous,658modified,657

loss,655optimal,647proper,650, 858search,848, 848–852, 1002stochastic,848value,849

POLICY-ITERATION, 657polite convention (Turing’s), 1026, 1027Pollack, M. E., 434,1069polytree,528, 552, 575POMDP-VALUE -ITERATION, 663Pomerleau, D. A., 1014,1085Ponce, J., 968,1072Ponte, J., 884, 922,1085, 1093Poole, D., 2, 59, 553, 556, 639,1078,

1085, 1093Popat, A. C., 29, 921,1067Popescu, A.-M., 885,1072Popper, K. R., 504, 759,1086population (in genetic algorithms),127Porphyry, 471Port-Royal Logic, 636

Porter, B., 473,1091Portner, P., 920,1086Portuguese, 778pose, 956,958, 975Posegga, J., 359,1065positive example,698positive literal, 244positivism, logical,6possibility axiom,388possibility theory,557possible world,240, 274, 313, 451, 540Post, E. L., 276,1086post-decision disappointment,637posterior probability,seeprobability,

conditionalpotential field,991potential field control, 999Poultney, C., 762,1086Poundstone, W., 687,1086Pourret, O., 553,1086Powers, R., 857,1088Prade, H., 557,1071Prades, J. L. P., 637,1086Pradhan, M., 519, 552,1086pragmatic interpretation, 904pragmatics, 904Prawitz, D., 358,1086precedence constraints,204precision,869precondition,367

missing,423precondition axiom, 273predecessor,91predicate, 902predicate calculus,seelogic, first-orderpredicate indexing,328predicate symbol,292prediction,139, 142, 573, 603preference,482, 612

monotonic,616preference elicitation,615preference independence,624premise,244president, 449Presley, E., 448Press, W. H., 155,1086Preston, J., 1042,1086Price, B., 686,1066Price Waterhouse, 431Prieditis, A. E., 105, 112, 119,1083,

1086Princeton, 17Principia Mathematica, 18Prinz, D. G., 192,1086PRIOR-SAMPLE, 531prioritized sweeping,838, 854

priority queue,80, 858prior knowledge, 39,768, 778, 787prior probability,485, 503prismatic joint,976prisoner’s dilemma,668private value, 679probabilistic network,seeBayesian

networkprobabilistic roadmap,993probability, 9, 26, 480–565, 1057–1058

alternatives to, 546axioms of, 488–490conditional,485, 503, 514conjunctive, 514density function,487, 1057distribution,487, 522history, 506judgments, 516marginal,492model,484, 1057

open-universe,545prior, 485, 503theory, 289,482, 636

probably approximately correct (PAC),714, 716, 759

PROBCUT, 175probit distribution,522, 551, 554problem,66, 108

airport-siting, 643assembly sequencing, 74bandit,840, 855conformant,138constraint optimization,2078-queens, 71, 1098-puzzle, 102, 105formulation,65, 68–69frame,266, 279generator,56halting, 325inherently hard, 1054–1055million queens, 221, 229missionaries and cannibals, 115monkey and bananas, 113, 396n queens, 263optimization,121

constrained,132piano movers, 1012real-world,69relaxed,105, 376robot navigation, 74sensorless,138solving, 22touring,74toy, 69traveling salesperson, 74underconstrained,263

1122 Index

VLSI layout, 74, 125procedural approach,236, 286procedural attachment, 456,466process,447, 447PRODIGY, 432production, 48production system, 322,336, 357, 358product rule,486, 495PROGOL, 789, 795, 797, 800programming language, 285progression, 393Prolog, 24,339, 358, 394, 793, 899

parallel, 342Prolog Technology Theorem Prover

(PTTP), 359pronunciation model,917proof,250proper policy,650, 858property (unary relation),288proposal distribution,565proposition

probabilistic, 483symbol,244

propositional attitude,450propositionalization,324, 357, 368, 544propositional logic, 235, 243–247, 274,

286proprioceptive sensor,975PROSPECTOR, 557Prosser, P., 229,1086protein design,75prototypes, 896Proust, M., 910Provan, G. M., 519, 552,1086pruning,98, 162, 167, 705

forward,174futility, 185in contingency problems, 179in EBL, 783

pseudocode, 1061pseudoexperience, 837pseudoreward,856PSPACE, 372, 1055PSPACE-complete, 385, 393psychological reasoning,473psychology, 12–13

experimental, 3, 12psychophysics, 968public key encryption, 356Puget, J.-F., 230, 800,1073, 1087Pullum, G. K., 889, 920, 921,1076,

1086PUMA, 1011Purdom, P., 230,1067pure strategy,667pure symbol,260

Puterman, M. L., 60, 685,1086Putnam, H., 60, 260, 276, 350, 358, 505,

1041, 1042,1070, 1086Puzicha, J., 755, 762,1065Pylyshyn, Z. W., 1041,1086

QQ(s, a) (value of action in state), 843Q-function, 627,831Q-learning,831, 843, 844, 848, 973Q-LEARNING-AGENT, 844QA3, 314QALY, 616, 637Qi, R., 639,1093QUACKLE, 187quadratic dynamical systems, 155quadratic programming,746qualia,1033qualification problem,268, 481, 1024,

1025qualitative physics, 444,472qualitative probabilistic network, 557,

624quantification, 903quantifier,295, 313

existential, 297in logic, 295–298nested, 297–298universal, 295–296, 322

quantization factor,914quasi-logical form,904Qubic, 194query (logical),301query language,867query variable, 522question answering,872, 883queue,79

FIFO,80, 81LIFO, 80, 85priority, 80, 858

Quevedo, T., 190quiescence,174Quillian, M. R., 471,1086Quine, W. V., 314, 443, 469, 470,1086Quinlan, J. R., 758, 764, 791, 793, 800,

1086Quirk, R., 920,1086QXTRACT, 885

RR1, 24, 336, 358Rabani, Y., 155,1086Rabenau, E., 28,1068Rabideau, G., 431,1073

Rabiner, L. R., 604, 922,1086Rabinovich, Y., 155,1086racing cars, 1050radar, 10radial basis function,762Radio Rex, 922Raedt, L. D., 556,1078Raghavan, P., 883, 884,1081, 1084Raiffa, H., 9, 621, 625, 638, 687,1078,

1081Rajan, K., 28, 60, 431,1064, 1077Ralaivola, L., 605,1085Ralphs, T. K., 112,1086Ramakrishnan, R., 275,1080Ramanan, D., 960,1086Ramsey, F. P., 9, 504, 637,1086RAND Corporation, 638randomization, 35,50randomized weighted majority

algorithm,752random restart, 158, 262random set,551random surfer model,871random variable, 486, 515

continuous, 487, 519, 553indexed,555

random walk,150, 585range finder,973

laser, 974range sensor array, 981Ranzato, M., 762,1086Rao, A., 61,1092Rao, B., 604,1076Rao, G., 678Raphael, B., 110, 191, 358,1074, 1075Raphson, J., 154, 760,1086rapid prototyping, 339Raschke, U., 1013,1069Rashevsky, N., 10, 761,1086Rasmussen, C. E., 827,1086Rassenti, S., 688,1086Ratio Club, 15rational agent,4, 4–5, 34, 36–38, 59, 60,

636, 1044rationalism,6, 923rationality,1, 36–38

calculative,1049limited, 5perfect, 5,1049

rational thought, 4Ratner, D., 109,1086rats, 13Rauch, H. E., 604,1086Rayner, M., 784,1087Rayson, P., 921,1080Rayward-Smith, V., 112,1086

Index 1123

RBFS, 99–101, 109RBL, 779, 784–787, 798RDF, 469reachable set,411reactive control,1001reactive layer,1004reactive planning,434real-world problem,69realizability,697reasoning, 4, 19,234

default, 458–460, 547intercausal, 548logical, 249–264, 284uncertain, 26

recall,869Rechenberg, I., 155,1086recognition,929recommendation, 539reconstruction,929recurrent network,729, 762RECURSIVE-BEST-FIRST-SEARCH, 99RECURSIVE-DLS,88recursive definition, 792recursive estimation,571Reddy, R., 922,1081reduction, 1059Reeson, C. G., 228,1086Reeves, C., 112,1086Reeves, D., 688,1092reference class,491, 505reference controller,997reference path,997referential transparency,451refinement (in hierarchical planning),

407reflectance, 933, 952REFLEX-VACUUM-AGENT, 48reflex agent,48, 48–50, 59, 647, 831refutation,250refutation completeness, 350regex, 874Regin, J., 228,1086regions,941regression, 393,696, 760

linear,718, 810nonlinear,732tree,707

regression to the mean,638regret,620, 752regular expression,874regularization,713, 721Reichenbach, H., 505,1086Reid, D. B., 606,1086Reid, M., 111,1079Reif, J., 1012, 1013,1068, 1086reification,440

REINFORCE, 849, 859reinforcement,830reinforcement learning, 685,695,

830–859, 1025active, 839–845Bayesian,835distributed, 856generalization in, 845–848hierarchical,856, 1046multiagent, 856off-policy, 844on-policy,844

Reingold, E. M., 228,1066Reinsel, G., 604,1066Reiter, R., 279, 395, 471, 686,1066,

1086REJECTION-SAMPLING, 533rejection sampling,532relation,288relational extraction,874relational probability model (RPM),

541, 552relational reinforcement learning,857relative error,98relaxed problem,105, 376relevance, 246,375, 779, 799relevance (in information retrieval),867relevance-based learning (RBL),779,

784–787, 798relevant-states,374Remote Agent, 28, 60, 356, 392, 432REMOTE AGENT, 28renaming,331rendering model,928Renner, G., 155,1086Renyi, A., 504,1086repeated game, 669,673replanning, 415, 422–434REPOP, 394representation,seeknowledge

representationatomic,57factored,58structured,58

representation theorem,624REPRODUCE, 129reserve bid, 679resolution, 19, 21,253, 252–256, 275,

314, 345–357, 801closure,255, 351completeness proof for, 350input,356inverse,794, 794–797, 800linear,356strategies, 355–356

resolvent,252, 347, 794

resource constraints, 401resources, 401–405, 430response, 13restaurant hygiene inspector, 183result, 368result set,867rete,335, 358retrograde,176reusable resource,402revelation principle,680revenue equivalence theorem,682Reversi, 186revolute joint,976reward, 56,646, 684, 830

additive,649discounted,649shaping,856

reward-to-go,833reward function, 832, 1046rewrite rule, 364, 1060Reynolds, C. W., 435,1086Riazanov, A., 359, 360,1086Ribeiro, F., 195,1091Rice, T. R., 638,1082Rich, E., 2,1086Richards, M., 195,1086Richardson, M., 556, 604,1071, 1086Richardson, S., 554,1073Richter, S., 395,1075, 1086ridge (in local search),123Ridley, M., 155,1086Rieger, C., 24,1086Riesbeck, C., 23, 358, 921,1068, 1088right thing, doing the, 1, 5, 1049Riley, J., 688,1087Riley, M., 889,1083Riloff, E., 885,1077, 1087Rink, F. J., 553,1083Rintanen, J., 433,1087Ripley, B. D., 763,1087risk aversion,617risk neutrality,618risk seeking,617Rissanen, J., 759,1087Ritchie, G. D., 800,1087Ritov, Y., 556, 606,1085Rivest, R., 759, 1059,1069, 1087RMS (root mean square), 1059Robbins algebra,360Roberts, G., 30,1071Roberts, L. G., 967,1087Roberts, M., 192,1065Robertson, N., 229,1087Robertson, S., 868Robertson, S. E., 505, 884,1069, 1087Robinson, A., 314, 358, 360,1087

1124 Index

Robinson, G., 359,1092Robinson, J. A., 19, 276, 314, 350, 358,

1087Robocup,1014robot,971, 1011

game (with humans), 1019hexapod, 1001mobile,971navigation, 74soccer, 161, 434,1009

robotics,3, 592, 971–1019robust control,994Roche, E., 884,1087Rochester, N., 17, 18, 1020,1082Rock, I., 968,1087Rockefeller Foundation, 922Roger, G., 111,1075rollout, 180Romania, 65, 203Roomba,1009Roossin, P., 922,1067root mean square,1059Roscoe, T., 275,1080Rosenblatt, F., 20, 761,1066, 1087Rosenblatt, M., 827,1087Rosenblitt, D., 394,1081Rosenbloom, P. S., 26, 27, 336, 358,

432, 799, 1047,1075, 1079Rosenblueth, A., 15,1087Rosenbluth, A., 155, 554,1082Rosenbluth, M., 155, 554,1082Rosenholtz, R., 953, 968,1081Rosenschein, J. S., 688,1087, 1089Rosenschein, S. J., 60, 278, 279,1077,

1087Ross, P. E., 193,1087Ross, S. M., 1059,1087Rossi, F., 228, 230,1066, 1087rotation, 956Roth, D., 556,1070Roughgarden, T., 688,1084Roussel, P., 314, 358, 359,1069, 1087route finding, 73Rouveirol, C., 800,1087Roveri, M., 396, 433,1066, 1068Rowat, P. F., 1013,1087Roweis, S. T., 554, 605,1087Rowland, J., 797,1078Rowley, H., 968,1087Roy, N., 1013,1087Rozonoer, L., 760,1064RPM,541, 552RSA (Rivest, Shamir, and Adelman),

356RSAT, 277Rubik’s Cube, 105

Rubin, D., 604, 605, 826, 827,1070,1073, 1087

Rubinstein, A., 688,1084rule,244

causal,317, 517condition–action,48default,459diagnostic,317, 517if–then, 48, 244implication, 244situation–action, 48uncertain, 548

rule-based system, 547, 1024with uncertainty, 547–549

Rumelhart, D. E., 24, 761,1087Rummery, G. A., 855,1087Ruspini, E. H., 557,1087Russell, A., 111,1071Russell, B., 6, 16, 18, 357,1092Russell, J. G. B., 637,1087Russell, J. R., 360,1083Russell, S. J., 111, 112, 157, 191, 192,

198, 278, 345, 432, 444, 556,604–606, 686, 687, 799, 800,826, 855–857, 1012, 1048, 1050,1064, 1066, 1069–1071, 1073,1076, 1077, 1081–1085, 1087,1090, 1092, 1093

Russia, 21, 192, 489Rustagi, J. S., 554,1087Ruzzo, W. L., 920,1074Ryan, M., 314,1076RYBKA , 186, 193Rzepa, H. S., 469,1083

SS-set,774Sabharwal, A., 277, 395,1074, 1076Sabin, D., 228,1087Sacerdoti, E. D., 394, 432,1087Sackinger, E., 762, 967,1080Sadeh, N. M., 688,1064Sadri, F., 470,1087Sagiv, Y., 358,1065Sahami, M., 29, 883, 884,1078, 1087Sahin, N. T., 288,1087Sahni, S., 110,1076SAINT , 19, 156St. Petersburg paradox, 637, 641Sakuta, M., 192,1087Salisbury, J., 1013,1081Salmond, D. J., 605,1074Salomaa, A., 919,1087Salton, G., 884,1087Saltzman, M. J., 112,1086

SAM , 360sample complexity,715sample space,484sampling, 530–535sampling rate,914Samuel, A. L., 17, 18, 61, 193, 850,

854, 855,1087Samuelson, L., 688,1081Samuelson, W., 688,1087Samuelsson, C., 784,1087Sanders, P., 112,1069Sankaran, S., 692,1080Sanna, R., 761,1073Sanskrit, 468, 919Santorini, B., 895, 921,1081SAPA, 431Sapir–Whorf hypothesis, 287Saraswat, V., 228,1091Sarawagi, S., 885,1087SARSA,844Sastry, S., 60, 606, 852, 857, 1013,

1075, 1084SAT, 250Satia, J. K., 686,1087satisfaction (in logic),240satisfiability,250, 277satisfiability threshold conjecture,264,

278satisficing,10, 1049SATMC, 279Sato, T., 359, 556,1087, 1090SATPLAN , 387, 392, 396, 402, 420, 433SATPLAN, 272saturation,351SATZ, 277Saul, L. K., 555, 606,1077, 1088Saund, E., 883,1087Savage, L. J., 489, 504, 637,1088Sayre, K., 1020,1088scaled orthographic projection,932scanning lidars,974Scarcello, F., 230, 472,1071, 1074scene,929Schabes, Y., 884,1087Schaeffer, J., 112, 186, 191, 194, 195,

678, 687,1066, 1069, 1081,1085, 1088

Schank, R. C., 23, 921,1088Schapire, R. E., 760, 761, 884,1072,

1088Scharir, M., 1012,1088Schaub, T., 471,1070Schauenberg, T., 678, 687,1066scheduling,403, 401–405Scheines, R., 826,1089schema (in a genetic algorithm),128

Index 1125

schema acquisition, 799Schervish, M. J., 506,1070Schickard, W., 5Schmid, C., 968,1088Schmidt, G., 432,1066Schmolze, J. G., 471,1088Schneider, J., 852, 1013,1065Schnitzius, D., 432,1070Schnizlein, D., 687,1091Schoenberg, I. J., 761,1083Scholkopf, B., 760, 762,1069, 1070,

1088Schomer, D., 288,1087Schoning, T., 277,1088Schoppers, M. J., 434,1088Schrag, R. C., 230, 277,1065Schroder, E., 276,1088Schubert, L. K., 469,1076Schulster, J., 28,1068Schultz, W., 854,1088Schultze, P., 112,1079Schulz, D., 606, 1012,1067, 1088Schulz, S., 360,1088, 1090Schumann, J., 359, 360,1071, 1080Schutze, H., 883–885, 920, 921,1081,

1088Schutze, H., 862, 883,1078Schwartz, J. T., 1012,1088Schwartz, S. P., 469,1088Schwartz, W. B., 505,1074scientific discovery, 759Scott, D., 555,1088Scrabble,187, 195scruffy vs.neat, 25search, 22, 52,66, 108

A*, 93–99alpha–beta, 167–171, 189, 191B*, 191backtracking, 87,215, 218–220, 222,

227beam,125, 174best-first,92, 108bidirectional, 90–112breadth-first,81, 81–83, 108, 408conformant, 138–142continuous space, 129–133, 155current-best-hypothesis, 770cutting off, 173–175depth-first,85, 85–87, 108, 408depth-limited,87, 87–88general, 108greedy best-first,92, 92heuristic,81, 110hill-climbing, 122–125, 150in a CSP, 214–222incremental belief-state,141

informed, 64, 81,92, 92–102, 108Internet, 464iterative deepening,88, 88–90, 108,

110, 173, 408iterative deepening A*, 99, 111learning to, 102local, 120–129, 154, 229, 262–263,

275, 277greedy,122

local, for CSPs, 220–222local beam,125, 126memory-bounded, 99–102, 111memory-bounded A*,101, 101–102,

112minimax, 165–168, 188, 189nondeterministic, 133–138online,147, 147–154, 157parallel,112partially observable, 138–146policy, 848, 848–852, 1002quiescence,174real-time,157, 171–175recursive best-first (RBFS), 99–101,

111simulated annealing, 125stochastic beam,126strategy,75tabu,154, 222tree,163uniform-cost,83, 83–85, 108uninformed, 64,81, 81–91, 108, 110

search cost,80search tree,75, 163Searle, J. R., 11, 1027, 1029–1033,

1042,1088Sebastiani, F., 884,1088Segaran, T., 688, 763,1088segmentation (of an image),941segmentation (of words), 886, 913Sejnowski, T., 763, 850, 854,1075,

1083, 1090Self, M., 826,1068Selfridge, O. G., 17Selman, B., 154, 229, 277, 279, 395,

471,1074, 1077, 1078, 1088semantic interpretation, 900–904, 920semantic networks, 453–456, 468, 471semantics,240, 860

database,300, 343, 367, 540logical, 274

Semantic Web, 469semi-supervised learning,695semidecidable, 325, 357semidynamic environment,44Sen, S., 855,1084sensitivity analysis,635

sensor, 34, 41,928active,973failure, 592, 593model, 579, 586, 603passive,973

sensor interface layer,1005sensorless planning, 415, 417–421sensor model, 566, 579, 586, 603, 658,

928, 979sentence

atomic,244, 294–295, 299complex,244, 295in a KB, 235, 274as physical configuration, 243

separator (in Bayes net), 499sequence form,677sequential

environment,43sequential decision problem, 645–651,

685sequential environment,43sequential importance-sampling

resampling, 605serendipity, 424Sergot, M., 470,1079serializable subgoals,392Serina, I., 395,1073Sestoft, P., 799,1077set (in first-order logic),304set-cover problem,376SETHEO, 359set of support,355set semantics,367Settle, L., 360,1074Seymour, P. D., 229,1087SGP, 395, 433SGPLAN, 387Sha, F., 1025,1088Shachter, R. D., 517, 553, 554, 559, 615,

634, 639, 687,1071, 1088, 1090shading,933, 948, 952–953shadow,934Shafer, G., 557,1088shaft decoder,975Shah, J., 967,1083Shahookar, K., 110,1088Shaked, T., 885,1072Shakey, 19, 60, 156, 393, 397, 434, 1011Shalla, L., 359,1092Shanahan, M., 470,1088Shankar, N., 360,1088Shannon, C. E., 17, 18, 171, 192, 703,

758, 763, 883, 913, 1020,1082,1088

Shaparau, D., 275,1088shape,957

1126 Index

from shading, 968Shapiro, E., 800,1088Shapiro, S. C., 31,1088Shapley, S., 687,1088Sharir, M., 1013,1074Sharp, D. H., 761,1069Shatkay, H., 1012,1088Shaw, J. C., 109, 191, 276,1084Shawe-Taylor, J., 760,1069Shazeer, N. M., 231,1080Shelley, M., 1037,1088Sheppard, B., 195,1088Shewchuk, J., 1012,1070Shi, J., 942, 967,1088Shieber, S., 30, 919,1085, 1088Shimelevich, L. I., 605,1093Shin, M. C., 685,1086Shinkareva, S. V., 288,1082Shmoys, D. B., 110, 405, 432,1080Shoham, Y., 60, 195, 230, 359, 435,

638, 688, 857,1064, 1079, 1080,1088

short-term memory, 336shortest path, 114Shortliffe, E. H., 23, 557,1067, 1088shoulder (in state space),123Shpitser, I., 556,1085SHRDLU, 20, 23, 370Shreve, S. E., 60,1066sibyl attack,541sideways move (in state space),123Sietsma, J., 762,1088SIGART, 31sigmoid function, 726sigmoid perceptron,729signal processing, 915significance test,705signs,888Siklossy, L., 432,1088Silver, D., 194,1073Silverstein, C., 884,1088Simard, P., 762, 967,1080Simmons, R., 605, 1012,1088, 1091Simon’s predictions, 20Simon, D., 60,1088Simon, H. A., 3, 10, 17, 18, 30, 60, 109,

110, 191, 276, 356, 393, 639,800, 1049,1077, 1079, 1084,1088, 1089

Simon, J. C., 277,1089Simonis, H., 228,1089Simons, P., 472,1084SIMPLE-REFLEX-AGENT, 49simplex algorithm, 155SIMULATED -ANNEALING, 126

simulated annealing, 120, 125, 153, 155,158, 536

simulation of world, 1028simultaneous localization and mapping

(SLAM), 982Sinclair, A., 124, 155,1081, 1086Singer, P. W., 1035,1089Singer, Y., 604, 884,1072, 1088Singh, M. P., 61,1076Singh, P., 27, 439,1082, 1089Singh, S., 1014,1067Singh, S. P., 157, 685, 855, 856,1065,

1077, 1078, 1090Singhal, A., 870,1089singly connected network,528singular,1056singular extension,174singularity,12

technological,1038sins, seven deadly, 122SIPE, 431, 432, 434SIR, 605Sittler, R. W., 556, 606,1089situated agent, 1025situation,388situation calculus, 279,388, 447Sjolander, K., 604,1079skeletonization, 986,991Skinner, B. F., 15, 60,1089Skolem, T., 314, 358,1089Skolem constant,323, 357Skolem function,346, 358skolemization, 323,346slack,403Slagle, J. R., 19,1089SLAM, 982slant,957Slate, D. J., 110,1089Slater, E., 192,1089Slattery, S., 885,1069Sleator, D., 920,1089sliding-block puzzle,71, 376sliding window,943Slocum, J., 109,1089Sloman, A., 27, 1041,1082, 1089Slovic, P., 2, 638,1077small-scale learning,712Smallwood, R. D., 686,1089Smarr, J., 883,1078Smart, J. J. C., 1041,1089SMA∗, 109Smith, A., 9Smith, A. F. M., 605, 811, 826,1065,

1074, 1090Smith, B., 28, 60, 431, 470,1077, 1089Smith, D. A., 920,1089

Smith, D. E., 156, 157, 345, 359, 363,395, 433,1067, 1073, 1079,1085, 1089, 1091

Smith, G., 112,1086Smith, J. E., 619, 637,1089Smith, J. M., 155, 688,1089Smith, J. Q., 638, 639,1084, 1089Smith, M. K., 469,1089Smith, R. C., 1012,1089Smith, R. G., 61,1067Smith, S. J. J., 187, 195,1089Smith, V., 688,1086Smith, W. D., 191, 553,1065, 1083SMODELS, 472Smola, A. J., 760,1088Smolensky, P., 24,1089smoothing, 574–576, 603, 822, 862,

863, 938linear interpolation,863online, 580

Smullyan, R. M., 314,1089Smyth, P., 605, 763,1074, 1089SNARC, 16Snell, J., 506,1074Snell, M. B., 1032,1089SNLP, 394Snyder, W., 359,1064SOAR, 26, 336, 358, 432, 799, 1047soccer, 195social laws,429society of mind, 434Socrates, 4Soderland, S., 394, 469, 885,1065,

1072, 1089softbot,41, 61soft margin,748softmax function,848soft threshold, 521software agent,41software architecture,1003Soika, M., 1012,1066Solomonoff, R. J., 17, 27, 759,1089solution,66, 68, 108, 134, 203, 668

optimal,68solving games, 163–167soma, 11Sompolinsky, H., 761,1064sonar sensors,973Sondik, E. J., 686,1089sonnet, 1026Sonneveld, D., 109,1089Sontag, D., 556,1082Sorensson, N., 277,1071Sosic, R., 229,1089soul, 1041

Index 1127

soundness (of inference),242, 247, 258,274, 331

sour grapes, 37Sowa, J., 473,1089Spaan, M. T. J., 686,1089space complexity,80, 108spacecraft assembly, 432spam detection,865spam email, 886Sparck Jones, K., 505, 868, 884,1087sparse model,721sparse system,515SPASS, 359spatial reasoning,473spatial substance,447specialization,771, 772species, 25, 130, 439–441, 469, 817,

860, 888, 948, 1035, 1042spectrophotometry, 935specularities,933specular reflection,933speech act,904speech recognition, 25,912, 912–919,

922sphex wasp, 39, 425SPI (Symbolic Probabilistic Inference),

553Spiegelhalter, D. J., 553–555, 639, 763,

826,1069, 1073, 1080, 1082,1089

Spielberg, S., 1040,1089SPIKE, 432SPIN, 356spin glass, 761Spirtes, P., 826,1089split point,707Sproull, R. F., 639,1072Sputnik, 21square roots, 47SRI, 19, 314, 393, 638Srinivasan, A., 797, 800,1084, 1089Srinivasan, M. V., 1045,1072Srivas, M., 356,1089Srivastava, B., 432,1077SSD (sum of squared differences), 940SSS* algorithm, 191Staab, S., 469,1089stability

of a controller,998static vs. dynamic,977strict,998

stack, 80Stader, J., 432,1064STAGE, 154STAHL , 800Stallman, R. M., 229,1089

STAN, 395standardizing apart,327, 363, 375Stanfill, C., 760,1089Stanford University, 18, 19, 22, 23, 314Stanhope Demonstrator, 276Staniland, J. R., 505,1070STANLEY , 28, 1007, 1008, 1014, 1025start symbol,1060state, 367

repeated,75world, 69

State-Action-Reward-State-Action(SARSA),844

state abstraction,377state estimation,145, 181, 269, 275,

570, 978recursive,145, 571

States, D. J., 826,1076state space,67, 108

metalevel, 102state variable

missing,423static environment,44stationarity (for preferences),649stationarity assumption,708stationary distribution,537, 573stationary process,568, 568–570, 603statistical mechanics, 761Stefik, M., 473, 557,1089Stein, J., 553,1083Stein, L. A., 1051,1089Stein, P., 192,1078Steiner, W., 1012,1067stemming,870Stensrud, B., 358,1090step cost,68Stephenson, T., 604,1089step size,132stereopsis, binocular, 948stereo vision,974Stergiou, K., 228,1089Stern, H. S., 827,1073Sternberg, M. J. E., 797,1089, 1090Stickel, M. E., 277, 359, 884, 921,1075,

1076, 1089, 1093stiff neck, 496Stiller, L., 176,1089stimulus, 13Stob, M., 759,1084stochastic beam search,126stochastic dominance,622, 636stochastic environment,43stochastic games,177stochastic gradient descent,720Stockman, G., 191,1089Stoffel, K., 469,1089

Stoica, I., 275,1080Stoic school, 275Stokes, I., 432,1064Stolcke, A., 920,1089Stoljar, D., 1042,1081Stone, C. J., 758,1067Stone, M., 759,1089Stone, P., 434, 688,1089Stork, D. G., 763, 827, 966,1071, 1089Story, W. E., 109,1077Strachey, C., 14, 192, 193,1089, 1090straight-line distance,92Strat, T. M., 557,1087strategic form,667strategy,133, 163, 181, 667strategy profile,667Stratonovich, R. L., 604, 639,1089strawberries, enjoy, 1021Striebel, C. T., 604,1086string (in logic),471STRIPS, 367, 393, 394, 397, 432, 434,

799Stroham, T., 884,1069Strohm, G., 432,1072strong AI,1020, 1026–1033, 1040strong domination,668structured representation,58, 64Stuckey, P. J., 228, 359,1077, 1081STUDENT, 19stuff, 445stupid pet tricks, 39Stutz, J., 826,1068stylometry,886Su, Y., 111,1071subcategory,440subgoal independence,378subjective case, 899subjectivism,491submodularity,644subproblem,106Subrahmanian, V. S., 192,1084Subramanian, D., 278, 472, 799, 1050,

1068, 1087, 1089, 1090substance, 445

spatial,447temporal,447

substitutability (of lotteries),612substitution,301, 323subsumption

in description logic,456in resolution,356

subsumption architecture,1003subsumption lattice, 329successor-state axiom,267, 279, 389successor function, 67Sudoku,212

1128 Index

Sulawesi, 223SUMMATION , 1053summer’s day, 1026summing out, 492, 527sum of squared differences,940Sun Microsystems, 1036Sunstein, C., 638,1090Sunter, A., 556,1072Superman, 286superpixels,942supervised learning,695, 846, 1025support vector machine,744, 744–748,

754sure thing, 617surveillance, 1036survey propagation,278survival of the fittest, 605Sussman, G. J., 229, 394,1089, 1090Sussman anomaly, 394,398Sutcliffe, G., 360,1090Sutherland, G. L., 22,1067Sutherland, I., 228,1090Sutphen, S., 194,1088Suttner, C., 360,1090Sutton, C., 885,1090Sutton, R. S., 685, 854–857,1065, 1090Svartvik, J., 920,1086Svestka, P., 1013,1078Svetnik, V. B., 605,1093Svore, K., 884,1090Swade, D., 14,1090Swartz, R., 1022,1067Swedish, 32Swerling, P., 604,1090Swift, T., 359,1090switching Kalman filter,589, 608syllogism, 4,275symbolic differentiation, 364symbolic integration, 776symmetry breaking (in CSPs),226synapse,11synchro drive,976synchronization,427synonymy, 465, 870syntactic ambiguity,905, 920syntactic categories,888syntactic sugar,304syntactic theory (of knowledge),470syntax, 23,240, 244

of logic, 274of natural language, 888of probability, 488

synthesis,356deductive,356

synthesis of algorithms, 356Syrjanen, T., 472,1084, 1090

systems reply, 1031Szafron, D., 678, 687,1066, 1091Szathmary, E., 155,1089Szepesvari, C., 194,1078

TT (fluent holds), 446T-SCHED, 432T4, 431TABLE-DRIVEN-AGENT, 47table lookup,737table tennis, 32tabu search,154, 222tactile sensors,974Tadepalli, P., 799, 857,1090Tait, P. G., 109,1090Takusagawa, K. T., 556,1085Talos, 1011TAL PLANNER, 387Tamaki, H., 359, 883,1084, 1090Tamaki, S., 277,1077Tambe, M., 230,1085Tank, D. W., 11,1084Tardos, E., 688,1084Tarjan, R. E., 1059,1090Tarski, A., 8, 314, 920,1090Tash, J. K., 686,1090Taskar, B., 556,1073, 1090task environment,40, 59task network, 394Tasmania, 222Tate, A., 394, 396, 408, 431, 432,1064,

1065, 1090Tatman, J. A., 687,1090Tattersall, C., 176,1090taxi, 40, 694

in Athens, 509automated, 56, 236, 480, 695, 1047

taxonomic hierarchy, 24, 440taxonomy,440, 465, 469Taylor, C., 763, 968,1070, 1082Taylor, G., 358,1090Taylor, M., 469,1089Taylor, R., 1013,1081Taylor, W., 9, 229, 277,1068Taylor expansion,982TD-GAMMON , 186, 194, 850, 851Teh, Y. W., 1047,1075telescope, 562television, 860Teller, A., 155, 554,1082Teller, E., 155, 554,1082Teller, S., 1012,1066Temperley, D., 920,1089template,874

temporal difference learning, 836–838,853, 854

temporal inference, 570–578temporal logic,289temporal projection, 278temporal reasoning, 566–609temporal substance,447Tenenbaum, J., 314,1090Teng, C.-M., 505,1079Tennenholtz, M., 855,1067tennis, 426tense,902term (in logic),294, 294ter Meulen, A., 314,1091terminal states,162terminal symbol,890, 1060terminal test,162termination condition, 995term rewriting, 359Tesauro, G., 180, 186, 194, 846, 850,

855,1090test set,695TETRAD, 826Teukolsky, S. A., 155,1086texel,951text classification,865, 882TEXTRUNNER, 439, 881, 882, 885texture,939, 948, 951texture gradient, 967Teyssier, M., 826,1090Thaler, R., 637, 638,1090thee and thou, 890THEO, 1047Theocharous, G., 605,1090theorem,302

incompleteness, 8, 352, 1022theorem prover, 2, 356theorem proving,249, 393

mathematical, 21, 32Theseus, 758Thiele, T., 604,1090Thielscher, M., 279, 470,1090thingification, 440thinking humanly, 3thinking rationally, 4Thitimajshima, P., 555,1065Thomas, A., 554, 555, 826,1073Thomas, J., 763,1069Thompson, H., 884,1066Thompson, K., 176, 192,1069, 1090thought, 4, 19,234

laws of, 4thrashing,1023-SAT, 277, 334, 362threshold function,724Throop, T. A., 187, 195,1089

Index 1129

Thrun, S., 28, 605, 686, 884,1012–1014,1067, 1068, 1072,1083–1085, 1087, 1090, 1091

Tibshirani, R., 760, 761, 763, 827,1073,1075

tic-tac-toe, 162, 190, 197Tikhonov, A. N., 759,1090tiling, 737tilt, 957time (in grammar),902time complexity,80, 108time expressions, 925time interval, 470time of flight camera,974time slice (in DBNs),567Tinsley, M., 193Tirole, J., 688,1073Tishby, N., 604,1072tit for tat, 674Titterington, D. M., 826,1090TLPLAN, 387TMS, 229,461, 460–462, 472, 1041Tobarra, L., 279,1064Toffler, A., 1034,1090tokenization, 875Tomasi, C., 951, 968,1090toothache, 481topological sort,223torque sensor,975Torralba, A., 741,1090Torrance, M. C., 231,1073Torras, C., 156, 433,1077total cost,80, 102Toth, P., 395,1068touring problem,74toy problem,69TPTP, 360trace,904tractability of inference,8, 457trading, 477tragedy of the commons,683trail, 340training

curve,724set,695

replicated,749weighted,749

transfer model (in MT),908transhumanism,1038transient failure,592transient failure model,593transition matrix, 564transition model,67, 108, 134, 162, 266,

566, 597, 603, 646, 684, 832,979

transition probability,536

transitivity (of preferences),612translation model,909transpose,1056transposition (in a game),170transposition table,170traveling salesperson problem, 74traveling salesperson problem (TSP),

74, 110, 112, 119Traverso, P., 275, 372, 386, 395, 396,

433,1066, 1068, 1073, 1088tree, 223TREE-CSP-SOLVER, 224TREE-SEARCH, 77treebank,895, 919

Penn, 881, 895tree decomposition,225, 227tree width,225, 227, 229, 434, 529trial, 832triangle inequality,95trichromacy,935Triggs, B., 946, 968,1069Troyanskii, P., 922Trucco, E., 968,1090truth,240, 295

functionality,547, 552preserving inference,242table,245, 276

truth maintenance system (TMS), 229,461, 460–462, 472, 1041

assumption-based,462justification-based,461

truth value,245Tsang, E., 229,1076Tsitsiklis, J. N., 506, 685, 686, 847, 855,

857, 1059,1066, 1081, 1084,1090

TSP,74, 110, 112, 119TT-CHECK-ALL , 248TT-ENTAILS?,248Tumer, K., 688,1090Tung, F., 604,1086tuple,291turbo decoding,555Turcotte, M., 797,1090Turing, A., 2, 8, 14, 16, 17, 19, 30, 31,

54, 192, 325, 358, 552, 761, 854,1021, 1022, 1024, 1026, 1030,1043, 1052,1090

Turing award, 1059Turing machine, 8, 759Turing Test,2, 2–4, 30, 31, 860, 1021

total,3Turk, 190Tversky, A., 2, 517, 620, 638,1072,

1077, 1090TWEAK, 394

Tweedie, F. J., 886,1078twin earths,1041two-finger Morra, 6662001: A Space Odyssey, 552type signature,542typical instance, 443Tyson, M., 884,1075

UU (utility), 611u⊤ (best prize), 615u⊥ (worst catastrophe), 615UCPOP, 394UCT (upper confidence bounds on

trees), 194UI (Universal Instantiation), 323Ulam, S., 192,1078Ullman, J. D., 358, 1059,1064, 1065,

1090Ullman, S., 967, 968,1076, 1090ultraintelligent machine,1037Ulysses, 1040unbiased (estimator),618uncertain environment,43uncertainty, 23, 26, 438, 480–509, 549,

1025existence,541identity,541, 876relational,543rule-based approach to, 547summarizing, 482and time, 566–570

unconditional probability,seeprobability, prior

undecidability, 8undergeneration,892unicorn, 280unification,326, 326–327, 329, 357

and equality, 353equational,355

unifier,326most general (MGU),327, 329, 353,

361UNIFORM-COST-SEARCH, 84uniform-cost search,83, 83–85, 108uniform convergence theory,759uniform prior, 805uniform probability distribution, 487uniform resource locator (URL), 463UNIFY, 328UNIFY-VAR, 328Unimate, 1011uninformed search, 64,81, 81–91, 108,

110unique action axioms,389unique names assumption, 299, 540

1130 Index

unit (in a neural network),728unit clause,253, 260, 355United States, 13, 629, 640, 753, 755,

922, 1034, 1036unit preference, 355unit preference strategy,355unit propagation,261unit resolution,252, 355units function,444universal grammar,921Universal Instantiation,323universal plan, 434unmanned air vehicle (UAV),971unmanned ground vehicle (UGV),971UNPOP, 394unrolling,544, 595unsatisfiability, 274unsupervised learning,694, 817–820,

1025UOSAT-II, 432update, 142upper ontology, 467URL, 463Urmson, C., 1014,1091urn-and-ball, 803URP, 638Uskov, A. V., 192,1064Utgoff, P. E., 776, 799,1082utilitarianism, 7utility, 9, 53, 162, 482

axioms of, 613estimation,833expected,53, 61, 483, 610, 611, 616function,53, 54, 162, 611, 615–621,

846independence,626maximum expected,483, 611of money, 616–618multiattribute, 622–626, 636, 648multiplicative,626node,627normalized,615ordinal,614theory,482, 611–615, 636

utility-based agent, 1044utopia, 1052UWL, 433

Vvacuum tube, 16vacuum world, 35, 37, 62, 159

erratic,134slippery, 137

vagueness, 547Valiant, L., 759,1091

validationcross, 737, 759, 767

validation, cross,708validation set,709validity, 249, 274value,58VALUE -ITERATION, 653value determination, 691value function,614

additive,625value iteration,652, 652–656, 684

point-based, 686value node,seeutility nodevalue of computation, 1048value of information, 628–633, 636,

644, 659, 839, 1025, 1048value of perfect information,630value symmetry,226VAMPIRE, 359, 360van Beek, P., 228–230, 395, 470,1065,

1078, 1087, 1091van Bentham, J., 314,1091Vandenberghe, L., 155,1066van Harmelen, F., 473, 799,1091van Heijenoort, J., 360,1091van Hoeve, W.-J., 212, 228,1091vanishing point,931van Lambalgen, M., 470,1091van Maaren, H., 278,1066van Nunen, J. A. E. E., 685,1091van Run, P., 230,1065van der Gaag, L., 505,1081Van Emden, M. H., 472,1091Van Hentenryck, P., 228,1091Van Roy, B., 847, 855,1090, 1091Van Roy, P. L., 339, 342, 359,1091Vapnik, V. N., 759, 760, 762, 763, 967,

1066, 1069, 1080, 1091Varaiya, P., 60, 856,1072, 1079Vardi, M. Y., 470, 477,1072variabilization (in EBL), 781variable,58

atemporal,266elimination,524, 524–528, 552, 553,

596in continuous state space,131indicator,819logic, 340in logic, 295ordering, 216, 527random, 486, 515

Boolean, 486continuous, 487, 519, 553

relevance, 528Varian, H. R., 688, 759,1081, 1091variational approximation,554

variational parameter,554Varzi, A., 470,1068Vaucanson, J., 1011Vauquois, B., 909,1091Vazirani, U., 154, 763,1064, 1078Vazirani, V., 688,1084VC dimension,759VCG, 683Vecchi, M. P., 155, 229,1078vector,1055vector field histograms,1013vector space model, 884vehicle interface layer,1006Veloso, M., 799,1091Vempala, S., 883,1084Venkataraman, S., 686,1074Venugopal, A., 922,1093Vere, S. A., 431,1091verification,356

hardware, 312Verma, T., 553, 826,1073, 1085Verma, V., 605,1091Verri, A., 968,1090VERSION-SPACE-LEARNING, 773VERSION-SPACE-UPDATE, 773version space,773, 774, 798version space collapse, 776Vetterling, W. T., 155,1086Vickrey, W., 681Vickrey-Clarke-Groves,683Vienna, 1028views, multiple, 948Vinge, V., 12, 1038,1091Viola, P., 968, 1025,1091virtual counts,812visibility graph,1013vision,3, 12, 20, 228, 929–965Visser, U., 195, 1014,1091Visser, W., 356,1075Vitali set, 489Vitanyi, P. M. B., 759,1080Viterbi, A. J., 604,1091Viterbi algorithm,578Vlassis, N., 435, 686,1089, 1091VLSI layout, 74, 110, 125vocabulary,864Volk, K., 826,1074von Mises, R., 504,1091von Neumann, J., 9, 15, 17, 190, 613,

637, 687,1091von Stengel, B., 677, 687,1078von Winterfeldt, D., 637,1091von Kempelen, W., 190von Linne, C., 469Voronkov, A., 314, 359, 360,1086,

1087

Index 1131

Voronoi graph,991Vossen, T., 396,1091voted perceptron, 760VPI (value of perfect information), 630

WWadsworth, C. P., 314,1074Wahba, G., 759,1074Wainwright, M. J., 278, 555,1081, 1091Walden, W., 192,1078Waldinger, R., 314, 394,1081, 1091Walker, E., 29,1069Walker, H., 826,1074WALK SAT,263, 395Wall, R., 920,1071Wallace, A. R., 130,1091Wallace, D. L., 886,1083Walras, L., 9Walsh, M. J., 156,1072Walsh, T., 228, 230, 278,1066, 1087,

1089Walsh, W., 688,1092Walter, G., 1011Waltz, D., 20, 228, 760,1089, 1091WAM, 341, 359Wang, D. Z., 885,1067Wang, E., 472,1090Wang, Y., 194,1091Wanner, E., 287,1091Warmuth, M., 109, 759,1066, 1086WARPLAN, 394Warren, D. H. D., 339, 341, 359, 394,

889,1085, 1091Warren, D. S., 359,1090Warren Abstract Machine (WAM), 341,

359washing clothes, 927Washington, G., 450wasp, sphex, 39, 425Wasserman, L., 763,1091Watkins, C. J., 685, 855,1091Watson, J., 12Watson, J. D., 130,1091Watt, J., 15Wattenberg, M., 155,1077Waugh, K., 687,1091WBRIDGE5, 195weak AI,1020, 1040weak domination,668weak method,22Weaver, W., 703, 758, 763, 883, 907,

908, 922,1088, 1091Webber, B. L., 31,1091Weber, J., 604,1076Wefald, E. H., 112, 191, 198, 1048,

1087

Wegbreit, B., 1012,1083Weglarz, J., 432,1066Wei, X., 885,1085Weibull, J., 688,1091Weidenbach, C., 359,1091weight,718weight (in a neural network),728WEIGHTED-SAMPLE, 534weighted linear function,172weight space,719Weinstein, S., 759,1084Weiss, G., 61, 435,1091Weiss, S., 884,1064Weiss, Y., 555, 605, 741,1083,

1090–1092Weissman, V., 314,1074Weizenbaum, J., 1035, 1041,1091Weld, D. S., 61, 156, 394–396, 432,

433, 469, 472, 885, 1036,1069,1071, 1072, 1079, 1085, 1089,1091, 1092

Wellman, M. P., 10, 555, 557, 604, 638,685–688, 857, 1013,1070, 1076,1091, 1092

Wells, H. G., 1037,1092Wells, M., 192,1078Welty, C., 469,1089Werbos, P., 685, 761, 854,1092Wermuth, N., 553,1080Werneck, R. F., 111,1074Wertheimer, M., 966Wesley, M. A., 1013,1092West, Col., 330Westinghouse, 432Westphal, M., 395,1086Wexler, Y., 553,1092Weymouth, T., 1013,1069White, J. L., 356,1075Whitehead, A. N., 16, 357, 781,1092Whiter, A. M., 431,1090Whittaker, W., 1014,1091Whorf, B., 287, 314,1092wide content,1028Widrow, B., 20, 761, 833, 854,1092Widrow–Hoff rule,846Wiedijk, F., 360,1092Wiegley, J., 156,1092Wiener, N., 15, 192, 604, 761, 922,

1087, 1092wiggly belief state, 271Wilczek, F., 761,1065Wilensky, R., 23, 24, 1031,1092Wilfong, G. T., 1012,1069Wilkins, D. E., 189, 431, 434,1092Williams, B., 60, 278, 432, 472,1083,

1092

Williams, C. K. I., 827,1086Williams, R., 640Williams, R. J., 685, 761, 849, 855,

1085, 1087, 1092Williamson, J., 469,1083Williamson, M., 433,1072Willighagen, E. L., 469,1083Wilmer, E. L., 604,1080Wilson, A., 921,1080Wilson, R., 227,1092Wilson, R. A., 3, 1042,1092Windows, 553Winikoff, M., 59, 1084Winker, S., 360,1092Winkler, R. L., 619, 637,1089winner’s curse,637Winograd, S., 20,1092Winograd, T., 20, 23, 884,1066, 1092Winston, P. H., 2, 20, 27, 773, 798,

1065, 1092Wintermute, S., 358,1092Witbrock, M., 469,1081Witten, I. H., 763, 883, 884, 921,1083,

1092Wittgenstein, L., 6, 243, 276, 279, 443,

469,1092Wizard, 553Wohler, F., 1027Wojciechowski, W. S., 356,1092Wojcik, A. S., 356,1092Wolf, A., 920,1074Wolfe, D., 186,1065Wolfe, J., 157, 192, 432,1081, 1087,

1092Wolpert, D., 688,1090Wong, A., 884,1087Wong, W.-K., 826,1083Wood, D. E., 111,1080Woods, W. A., 471, 921,1092Wooldridge, M., 60, 61,1068, 1092Woolsey, K., 851workspace representation,986world model, in disambiguation, 906world state, 69World War II, 10, 552, 604World Wide Web (WWW), 27, 462,

867, 869worst possible catastrophe, 615Wos, L., 359, 360,1092wrapper (for Internet site),466wrapper (for learning),709Wray, R. E., 358,1092Wright, O. and W., 3Wright, R. N., 884,1085Wright, S., 155, 552,1092Wu, D., 921,1092

1132 Index

Wu, E., 885,1067Wu, F., 469,1092wumpus world,236, 236–240, 246–247,

279, 305–307, 439, 499–503,509

Wundt, W., 12Wurman, P., 688,1092WWW, 27, 462, 867, 869

XXCON, 336XML, 875xor, 246, 766Xu, J., 358,1092Xu, P., 29, 921,1067

YYakimovsky, Y., 639,1072Yale, 23Yan, D., 431,1073Yang, C. S., 884,1087Yang, F., 107,1092Yang, Q., 432,1092Yannakakis, M., 157, 229,1065, 1084Yap, R. H. C., 359,1077Yardi, M., 278,1068Yarowsky, D., 27, 885,1092Yates, A., 885,1072

Yedidia, J., 555,1092Yglesias, J., 28,1064Yip, K. M.-K., 472,1092Yngve, V., 920,1092Yob, G., 279,1092Yoshikawa, T., 1013,1092Young, H. P., 435,1092Young, M., 797,1078Young, S. J., 896, 920,1080Younger, D. H., 920,1092Yu, B., 553,1068Yudkowsky, E., 27, 1039,1093Yung, M., 110, 119,1064, 1075Yvanovich, M., 432,1070

ZZ-3, 14Zadeh, L. A., 557,1093Zahavi, U., 107,1092Zapp, A., 1014,1071Zaragoza, H., 884,1069Zaritskii, V. S., 605,1093zebra puzzle, 231Zecchina, R., 278,1084Zeldner, M., 908Zelle, J., 902, 921,1093Zeng, H., 314,1082Zermelo, E., 687,1093

zero-sum game, 161, 162, 199,670Zettlemoyer, L. S., 556, 921,1082, 1093Zhai, C., 884,1079Zhang, H., 277,1093Zhang, L., 277, 553,1083, 1093Zhang, N. L., 553, 639,1093Zhang, W., 112,1079Zhang, Y., 885,1067Zhao, Y., 277,1083Zhivotovsky, A. A., 192,1064Zhou, R., 112,1093Zhu, C., 760,1067Zhu, D. J., 1012,1093Zhu, W. L., 439,1089Zilberstein, S., 156, 422, 433, 434,

1075, 1085Zimdars, A., 857,1087Zimmermann, H.-J., 557,1093Zinkevich, M., 687,1093Zisserman, A., 960, 968,1075, 1086Zlotkin, G., 688,1087Zog, 778Zollmann, A., 922,1093Zuckerman, D., 124,1081Zufferey, J. C., 1045,1072Zuse, K., 14, 192Zweben, M., 432,1070Zweig, G., 604,1093Zytkow, J. M., 800,1079