Artificial intelligence: Foundations of computational agents

Artificial Intelligence: Foundations of Computational Agents

Volumn 9780521519007, Issue , 2010, Pages 1-662

  Poole, David L ^a   Mackworth, Alan K ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; COMPUTER AIDED INSTRUCTION; KNOWLEDGE REPRESENTATION; ONLINE SYSTEMS; STUDENTS; TEXTBOOKS;

COHERENT FRAMEWORKS; COMPUTATIONAL AGENTS; ENGINEERING APPLICATIONS; FIRST-YEAR GRADUATES; LECTURE SLIDES; ONLINE LEARNING ENVIRONMENT; SCIENCE AND ENGINEERING; UNDERGRADUATE STUDENTS;

EDUCATION;

EID: 84924485966     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511794797     Document Type: Book

References (319)

1. Aamodt, A. and Plaza, E. (1994). Case-based reasoning: foundational issues, methodological variations, and system approaches. AI Communications, 7(1): 39-59. 341
2. Abelson, H. and DiSessa, A. (1981). Turtle Geometry: The Computer as a Medium for Exploring Mathematics. MIT Press, Cambridge, MA. 66
3. Abramson, H. and Rogers, M.H. (Eds.) (1989). Meta-Programming in Logic Programming. MIT Press, Cambridge, MA. 592
4. Agre, P.E. (1995). Computational research on interaction and agency. Artificial Intelligence, 72: 1-52. 66
5. Aha, D.W., Marling, C., and Watson, I. (Eds.) (2005). The Knowledge Engineering Review, special edition on case-based reasoning, volume 20 (3). Cambridge University Press. 341
6. Albus, J.S. (1981). Brains, Behavior and Robotics. BYTE Publications, Peterborough, NH. 66
7. Allais, M. and Hagen, O. (Eds.) (1979). Expected Utility Hypothesis and the Allais Paradox. Reidel, Boston, MA. 380
8. Allen, J., Hendler, J., and Tate, A. (Eds.) (1990). Readings in Planning. Morgan Kaufmann, San Mateo, CA. 367
9. Anderson, M. and Leigh Anderson, S.L. (2007). Machine ethics: Creating an ethical intelligent agent. AI Magazine, 28(4): 15-26. 632
10. Andrieu, C., de Freitas, N., Doucet, A., and Jordan, M.I. (2003). An introduction to MCMC for machine learning. Machine Learning, 50(1-2): 5-43. 275
11. Antoniou, G. and van Harmelen, F. (2008). A Semantic Web Primer. MIT Pres, Cambridge, MA, 2nd edition. 591
12. Apt, K. and Bol, R. (1994). Logic programming and negation: A survey. Journal of Logic Programming, 19, 20: 9-71. 207, 542
13. Aristotle (350 B.C.). Categories. Translated by E. M. Edghill, http://www.classicallibrary.org/Aristotle/categories/. 567
14. Asimov, I. (1950). I, Robot. Doubleday, Garden City, NY. 631
15. Bacchus, F. and Grove, A. (1995). Graphical models for preference and utility. In Uncertainty in Artificial Intelligence (UAI-95), pp. 3-10. 413
16. Bacchus, F., Grove, A.J., Halpern, J.Y., and Koller, D. (1996). From statistical knowledge bases to degrees of belief. Artificial Intelligence, 87(1-2): 75-143. 274
17. Bacchus, F. and Kabanza, F. (1996). Using temporal logic to control search in a forward chaining planner. In M. Ghallab and A. Milani (Eds.), New Directions in AI Planning, pp. 141-153. ISO Press, Amsterdam. 367
18. Bäck, T. (1996). Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, NY. 152
19. Ballard, B.W. (1983). The *-minimax search procedure for trees containing chance nodes. Artificial Intelligence, 21(3): 327-350. 449
20. Baum, E.B. (2004). What is Thought? MIT Press. 491
21. Bayes, T. (1763). An essay towards solving a problem in the doctrine of chances. Philosophical Transactions of the Royal Society of London, 53: 370-418. Reprinted in Biometrika 45, 298-315, 1958. Reprinted in S. J. Press, Bayesian Statistics, 189-217, Wiley, New York, 1989. 340
22. Beckett, D. and Berners-Lee (2008). Turtle - terse RDF triple language. http://www.w3.org/TeamSubmission/turtle/. 592
23. Bell, J.L. and Machover, M. (1977). A Course in Mathematical Logic. North-Holland, Amsterdam. 207
24. Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. 413
25. Bernardo, J.M. and Smith, A.F.M. (1994). Bayesian Theory. Wiley. 341
26. Berners-Lee, T., Hendler, J., and Lassila, O. (2001). The semantic web: A new form of web content that is meaningful to computers will unleash a revolution of new possibilities. Scientific American, pp. 28-37. 591
27. Bertelè, U. and Brioschi, F. (1972). Nonserial dynamic programming, volume 91 of Mathematics in Science and Engineering. Academic Press. 151
28. Bertsekas, D.P. (1995). Dynamic Programming and Optimal Control. Athena Scientific, Belmont, Massachusetts. Two volumes. 413
29. Bertsekas, D.P. and Tsitsiklis, J.N. (1996). Neuro-Dynamic Programming. Athena Scientific, Belmont, Massachusetts. 486
30. Besnard, P. and Hunter, A. (2008). Elements Of Argumentation. MIT Press, Cambridge, MA. 208
31. Bishop, C.M. (1995). Neural Networks for Pattern Recognition. Oxford University Press, Oxford, England. 341
32. Bishop, C.M. (2008). Pattern Recognition and Machine Learning. Springer-Verlag, New York. 341
33. Blum, A. and Furst, M. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90: 281-300. 367
34. Bobrow, D.G. (1993). Artificial intelligence in perspective: a retrospective on fifty volumes of Artificial Intelligence. Artificial Intelligence, 59: 5-20. 41
35. Bobrow, D.G. (1967). Natural language input for a computer problem solving system. In M. Minsky (Ed.), Semantic Information Processing, pp. 133-215. MIT Press, Cambridge MA. 8
36. Boddy, M. and Dean, T.L. (1994). Deliberation scheduling for problem solving in timeconstrained environments. Artificial Intelligence, 67(2): 245-285. 41
37. Bodlaender, H.L. (1993). A tourist guide through treewidth. Acta Cybernetica, 11(1-2): 1-21. 274
38. Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., and Poole, D. (2004). Cp-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research, 21: 135-191. 413
39. Boutilier, C., Dean, T., and Hanks, S. (1999). Decision-theoretic planning: Structual assumptions and computational leverage. Journal of Artificial Intelligence Research, 11: 1-94. 413
40. Bowen, K.A. (1985). Meta-level programming and knowledge representation. New Generation Computing, 3(4): 359-383. 592
41. Bowling, M. and Veloso, M. (2002). Multiagent learning using a variable learning rate. Artificial Intelligence, 136(2): 215-250. 449
42. Brachman, R.J. and Levesque, H.J. (Eds.) (1985). Readings in Knowledge Representation. Morgan Kaufmann, San Mateo, CA. 41, 591, 646
43. Brachman, R. and Levesque, H. (2004). Knowledge Representation and Reasoning. Morgan Kaufmann. 591, 618
44. Breiman, L., Friedman, J.H., Olshen, R.A., and Stone, C.J. (1984). Classification and Regression Trees. Wadsworth and Brooks, Monterey, CA. 341
45. Briscoe, G. and Caelli, T. (1996). A Compendium of Machine Learning, Volume 1: Symbolic Machine Learning. Ablex, Norwood, NJ. 341
46. Brooks, R.A. (1986). A robust layered control system for a mobile robot. IEEE Journal of Robotics and Automation, 2(1): 14-23. Reprinted in Shafer and Pearl [1990]. 66
47. Brooks, R.A. (1991). Intelligence without representation. Artificial Intelligence, 47: 139-159. 66
48. Brooks, R. (1990). Elephants don’t play chess. Robotics and Autonomous Systems, 6: 3-15. 41
49. Bryce, D. and Kambhampati, S. (2007). A tutorial on planning graph based reachability heuristics. AI Magazine, 28(47-83): 1. 367
50. Buchanan, B. and Shortliffe, E. (Eds.) (1984). Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project. Addison-Wesley, Reading, MA. 9
51. Buchanan, B.G. and Feigenbaum, E.A. (1978). Dendral and meta-dendral: Their applications dimension. Artificial Intelligence, 11: 5-24. 9
52. Buchanan, B.G. (2005). A (very) brief history of artificial intelligence. AI Magazine, 26(4): 53-60. 3
53. Buntine, W. (1992). Learning classification trees. Statistics and Computing, 2: 63-73. 341
54. Burch, R. (2008). Charles Sanders Peirce. The Stanford Encyclopedia of Philosophy. http://plato.stanford.edu/archives/spr2008/entries/peirce/. 207
55. Campbell, M., Hoane Jr., A.J., and Hse, F.H. (2002). Deep blue. Artificial Intelligence, 134(1-2): 57-83. 449
56. Castillo, E., Gutiérrez, J.M., and Hadi, A.S. (1996). Expert Systems and Probabilistic Network Models. Springer Verlag, New York. 274
57. Chapman, D. (1987). Planning for conjunctive goals. Artificial Intelligence, 32(3): 333-377. 367
58. Cheeseman, P. (1990). On finding the most probable model. In J. Shranger and P. Langley (Eds.), Computational Models of Scientific Discovery and Theory Formation, chapter 3, pp. 73-95. Morgan Kaufmann, San Mateo, CA. 341
59. Cheeseman, P., Kelly, J., Self, M., Stutz, J., Taylor, W., and Freeman, D. (1988). Autoclass: A Bayesian classification system. In Proc. Fifth International Conference on Machine Learning, pp. 54-64. Ann Arbor, MI. Reprinted in Shavlik and Dietterich [1990]. 486
60. Cheng, J. and Druzdzel, M. (2000). AIS-BN: An adaptive importance sampling algorithm for evidential reasoning in large Bayesian networks. Journal of Artificial Intelligence Research, 13: 155-188. 275
61. Chesnevar, C., Maguitman, A., and Loui, R. (2000). Logical models of argument. ACM Comput. Surv., 32(4): 337-383. 208
62. Chomsky, N. (1957). Syntactic Structures. Mouton and Co., The Hague. 521
63. Chrisley, R. and Begeer, S. (2000). Artificial intelligence: Critical Concepts in Cognitive Science. Routledge, London and New York. 41, 645
64. Clark, K.L. (1978). Negation as failure. In H. Gallaire and J. Minker (Eds.), Logic and Databases, pp. 293-322. Plenum Press, New York. 207, 542
65. Cohen, P.R. (2005). If not Turing’s test, then what? AI Magazine, 26(4): 61-67. 40
66. Colmerauer, A., Kanoui, H., Roussel, P., and Pasero, R. (1973). Un système de communication homme-machine en français. Technical report, Groupe de Researche en Intelligence Artificielle, Université d’Aix-Marseille. 207
67. Colmerauer, A. and Roussel, P. (1996). The birth of Prolog. In T.J. Bergin and R.G. Gibson (Eds.), History of Programming Languages. ACM Press/Addison-Wesley. 9, 542
68. Copi, I.M. (1982). Introduction to Logic. Macmillan, New York, sixth edition. 207
69. Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. (2001). Introduction to Algorithms. MIT Press and McGraw-Hill, second edition. 106
70. Cover, T.M. and Thomas, J.A. (1991). Elements of information theory. Wiley, New York. 275
71. Culberson, J. and Schaeffer, J. (1998). Pattern databases. Computational Intelligence, 14(3): 318-334. 106
72. Dahl, V. (1994). Natural language processing and logic programming. Journal of Logic Programming, 19, 20: 681-714. 542
73. Darwiche, A. (2009). Modeling and Reasoning with Bayesian Networks. Cambridge University Press. 274, 486
74. Dasarathy, B.V. (1991). NN concepts and techniques. In B.V. Dasarathy (Ed.), Nearest Neighbour (NN) Norms: NN Pattern Classification Techniques, pp. 1-30. IEEE Computer Society Press, New York. 341
75. Davis, E. (1990). Representations of Commonsense Knowledge. Morgan Kaufmann, San Mateo, CA. 591
76. Davis, J. and Goadrich, M. (2006). The relationship between precision-recall and roc curves. In Proceedings of the 23rd international conference on Machine Learning, pp. 233-240. 341
77. Davis, M., Logemann, G., and Loveland, D. (1962). A machine program for theorem proving. Communications of the ACM, 5(7): 394-397. 151
78. Davis, M. and Putnam, H. (1960). A computing procedure for quantification theory. Journal of the ACM, 7(3): 201-215. 151
79. de Kleer, J. (1986). An assumption-based TMS. Artificial Intelligence, 28(2): 127-162. 207, 208
80. de Kleer, J., Mackworth, A.K., and Reiter, R. (1992). Characterizing diagnoses and systems. Artificial Intelligence, 56: 197-222. 207
81. De Raedt, L., Frasconi, P., Kersting, K., and Muggleton, S.H. (Eds.) (2008). Probabilistic Inductive Logic Programming. Springer. 620
82. Dean, T. and Kanazawa, K. (1989). A model for reasoning about persistence and causation. Computational Intelligence, 5(3): 142-150. 275
83. Dean, T.L. and Wellman, M.P. (1991). Planning and Control. Morgan Kaufmann, San Mateo, CA. 41, 66
84. Dechter, R. (1996). Bucket elimination: A unifying framework for probabilistic inference. In E. Horvitz and F. Jensen (Eds.), Proc. Twelfth Conf. on Uncertainty in Artificial Intelligence (UAI-96), pp. 211-219. Portland, OR. 274
85. Dechter, R. (2003). Constraint Processing. Morgan Kaufmann. 151
86. Dellaert, F., Fox, D., Burgard, W., and Thrun, S. (1999). Monte Carlo localization for mobile robots. In IEEE International Conference on Robotics and Automation (ICRA99). 275
87. Dietterich, T.G. (2000). Hierarchical reinforcement learning with the maxq value function decomposition. Journal of Artificial Intelligence Research, 13: 227-303. 632
88. Dietterich, T.G. (2002). Ensemble learning. In M. Arbib (Ed.), The Handbook of Brain Theory and Neural Networks, pp. 405-408. MIT Press, Cambridge, MA, second edition. 341
89. Dijkstra, E.W. (1976). A discipline of programming. Prentice-Hall, Englewood Cliffs, NJ. 367
90. Dijkstra, E.W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1: 269-271. 106
91. Doucet, A., de Freitas, N., and Gordon, N. (Eds.) (2001). Sequential Monte Carlo in Practice. Springer-Verlag. 275
92. Doyle, J. (1979). A truth maintenance system. AI Memo 521, MIT Artificial Intelligence Laboratory. 207
93. Dresner, K. and Stone, P. (2008). A multiagent approach to autonomous intersection management. Journal of Artificial Intelligence Research, 31: 591-656. 632
94. Duda, R.O., Hart, P.E., and Stork, D.G. (2001). Pattern Classification. Wiley-Interscience, 2nd edition. 341, 486
95. Dung, P. (1995). On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence, 77(2): 321-357. 207
96. Dung, P., Mancarella, P., and Toni, F. (2007). Computing ideal sceptical argumentation. Artificial Intelligence, 171(10-15): 642-674. 207
97. Edwards, P. (Ed.) (1967). The Encyclopedia of Philosophy. Macmillan, New York. 287
98. Enderton, H.B. (1972). A Mathematical Introduction to Logic. Academic Press, Orlando, FL. 207
99. Felner, A., Korf, R.E., and Hanan, S. (2004). Additive pattern database heuristics. Journal of Artificial Intelligence Research (JAIR), 22: 279-318. 106
100. Fikes, R.E. and Nilsson, N.J. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2(3-4): 189-208. 367
101. Fischer, D. (1987). Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2: 139-172. Reprinted in Shavlik and Dietterich [1990]. 486
102. Forbus, K.D. (1996). Qualitative reasoning. In CRC Hand-book of Computer Science and Engineering. CRC Press. 66
103. Freuder, E.C. and Mackworth, A.K. (2006). Constraint satisfaction: An emerging paradigm. In P.V.B. F. Rossi and T.Walsh (Eds.), Handbook of Constraint Programming, pp. 13-28. Elsevier. 151
104. Friedman, N. and Goldszmidt, M. (1996a). Building classifiers using Bayesian networks. In Proc. 13th National Conference on Artificial Intelligence, pp. 1277-1284. Portland, OR. 486
105. Friedman, N. and Goldszmidt, M. (1996b). Learning Bayesian networks with local structure. In Proc. Twelfth Conf. on Uncertainty in Artificial Intelligence (UAI-96), pp. 252-262. 486
106. Friedman, N., Greiger, D., and Goldszmidt, M. (1997). Bayesian network classifiers. Machine Learning, 29: 103-130. 341
107. Gabbay, D.M., Hogger, C.J., and Robinson, J.A. (Eds.) (1993). Handbook of Logic in Artificial Intelligence and Logic Programming. Clarendon Press, Oxford, England. 5 volumes. 207
108. Gangemi, A., Guarino, N., Masolo, C., and Oltramari, A. (2003). Sweetening wordnet with dolce. AI Magazine, 24(3): 13-24. 592
109. Garcia-Molina, H., Ullman, J.D., and Widom, J. (2009). Database Systems: The Complete Book. Prentice Hall, 2nd edition. 542
110. Gardner, H. (1985). The Mind’s New Science. Basic Books, New York. 41
111. Gelman, A., Carlin, J.B., Stern, H.S., and Rubin, D.B. (2004). Bayesian Data Analysis. Chapman and Hall/CRC, 2nd edition. 341
112. Getoor, L. and Taskar, B. (Eds.) (2007). Introduction to Statistical Relational Learning. MIT Press, Cambridge, MA. 620
113. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA. 152
114. Goldberg, D.E. (2002). The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Addison-Wesley, Reading, MA. 152
115. Green, C. (1969). Application of theorem proving to problem solving. In Proc. 1st International Joint Conf. on Artificial Intelligence, pp. 219-237. Washington, DC. Reprinted in Webber and Nilsson [1981]. 207
116. Grenon, P. and Smith, B. (2004). Snap and span: Towards dynamic spatial ontology. Spatial Cognition and Computation, 4(1): 69-103. 592
117. Grünwald, P.D. (2007). The Minimum Description Length Principle. The MIT Press, Cambridge, MA. 275, 341
118. Halpern, J. (1997). A logical approach to reasoning about uncertainty: A tutorial. In X. Arrazola, K. Kortha, and F. Pelletier (Eds.), Discourse, Interaction and Communication. Kluwer. 274
119. Hart, P.E., Nilsson, N.J., and Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2): 100-107. 106
120. Hart, T.P. and Edwards, D.J. (1961). The tree prune (TP) algorithm. Memo 30, MIT Artificial Intelligence Project, Cambridge MA. 449
121. Hastie, T., Tibshirani, R., and Friedman, J. (2009). The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, second edition. 341
122. Haugeland, J. (1985). Artificial Intelligence: The Very Idea. MIT Press, Cambridge, MA. 6, 41, 66
123. Haugeland, J. (Ed.) (1997). Mind Design II: Philosohpy, Psycholgy, Artificial Intelligence. MIT Press, Cambridge, MA, revised and enlarged edition. 40, 646, 647, 651
124. Haussler, D. (1988). Quantifying inductive bias: AI learning algorithms and Valiant’s learning framework. Artificial Intelligence, 36(2): 177-221. Reprinted in Shavlik and Dietterich [1990]. 341
125. Hayes, P.J. (1973). Computation and deduction. In Proc. 2nd Symposium on Mathematical Foundations of Computer Science, pp. 105-118. Czechoslovak Academy of Sciences. 207
126. Heckerman, D. (1999). A tutorial on learning with Bayesian networks. In M. Jordan (Ed.), Learning in Graphical Models. MIT press. 486
127. Hendler, J., Berners-Lee, T., and Miller, E. (2002). Integrating applications on the semantic web. Journal of the Institute of Electrical Engineers of Japan, 122(10): 676-680. 591
128. Henrion, M. (1988). Propagating uncertainty in Bayesian networks by probabilistic logic sampling. In J.F. Lemmer and L.N. Kanal (Eds.), Uncertainty in Artificial Intelligence 2, pp. 149-163. Elsevier Science Publishers B.V. 275
129. Hertz, J., Krogh, A., and Palmer, R.G. (1991). Introduction to the Theory of Neural Computation. Lecture Notes, Volume I, Santa Fe Institute Studies in the Sciences of Complexity. Addison-Wesley, Reading, MA. 341
130. Hewitt, C. (1969). Planner: A language for proving theorems in robots. In Proc. 1st International Joint Conf. on Artificial Intelligence, pp. 295-301. Washington, DC. 207
131. Hillis, W.D. (2008). A forebrain for the world mind. Edge: World Question Center. http://www.edge.org/q2009/q09 12.html#hillis. 632
132. Hitzler, P., Krötzsch, M., Parsia, B., Patel-Schneider, P.F., and Rudolph, S. (2009). OWL 2 Web Ontology Language Primer. W3C. http://www.w3.org/TR/owl2-primer/. 592
133. Hobbs, J.R., Stickel, M.E., Appelt, D.E., and Martin, P. (1993). Interpretation as abduction. Artificial Intelligence, 63(1-2): 69-142. 207
134. Holland, J.H. (1975). Adaption in Natural and Artificial Systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press, Ann Arbor, MI. 152
135. Hoos, H.H. and Stützle, T. (2004). Stochastic Local Search: Foundations and Applications. Morgan Kaufmann/Elsevier. 152
136. Horvitz, E.J. (1989). Reasoning about beliefs and actions under computational resource constraints. In L. Kanal, T. Levitt, and J. Lemmer (Eds.), Uncertainty in Artificial Intelligence 3, pp. 301-324. Elsevier, New York. 41
137. Horvitz, E. (2006). Eric Horvitz forecasts the future. New Scientist, 2578: 72. 625
138. Howard, R.A. and Matheson, J.E. (1984). Influence diagrams. In R.A. Howard and J.E. Matheson (Eds.), The Principles and Applications of Decision Analysis. Strategic Decisions Group, Menlo Park, CA. 413
139. Howson, C. and Urbach, P. (2006). Scientific Reasoning: the Bayesian Approach. Open Court, Chicago, Illinois, 3rd edition. 341
140. Jaynes, E.T. (2003). Probability Theory: The Logic of Science. Cambridge University Press. 341
141. Jensen, F.V. (1996). An Introduction to Bayesian Networks. Springer Verlag, New York. 274
142. Jordan, M. and Bishop, C. (1996). Neural networks. Memo 1562, MIT Artificial Intelligence Lab, Cambridge, MA. 341
143. Joy, B. (2000). Why the future doesn’t need us. Wired. http://www.wired.com/wired/archive/8.04/joy.html. 631
144. Jurafsky, D. and Martin, J.H. (2008). Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition. Prentice Hall, second edition. 542
145. Kaelbling, L.P., Littman, M.L., and Moore, A.W. (1996). Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 4: 237-285. 486
146. Kakas, A. and Denecker, M. (2002). Abduction in logic programming. In A. Kakas and F. Sadri (Eds.), Computational Logic: Logic Programming and Beyond, number 2407 in LNAI, pp. 402-436. Springer Verlag. 207
147. Kakas, A.C., Kowalski, R.A., and Toni, F. (1993). Abductive logic programming. Journal of Logic and Computation, 2(6): 719-770. 207
148. Kambhampati, S., Knoblock, C.A., and Yang, Q. (1995). Planning as refinement search: a unified framework for evaluating design tradeoffs in partial order planning. Artificial Intelligence, 76: 167-238. Special issue on Planning and Scheduling. 367
149. Kautz, H. and Selman, B. (1996). Pushing the envelope: Planning, propositional logic and stochastic search. In Proc. 13th National Conference on Artificial Intelligence, pp. 1194-1201. Portland, OR. 367
150. Kearns, M. and Vazirani, U. (1994). An Introduction to Computational Learning Theory. MIT Press, Cambridge, MA. 341
151. Keeney, R.L. and Raiffa, H. (1976). Decisions with Multiple Objectives. John Wiley and Sons. 413
152. Kelly, K. (2008). A new kind of mind. Edge:World Question Center. http://www.edge.org/q2009/q09 1.html#kelly. 632
153. Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P. (1983). Optimization by simulated annealing. Science, 220: 671-680. 152
154. Kirsh, D. (1991a). Foundations of AI: the big issues. Artificial Intelligence, 47: 3-30. 41
155. Kirsh, D. (1991b). Today the earwig, tomorrow man? Artificial Intelligence, 47: 161-184. 66
156. Knuth, D.E. and Moore, R.W. (1975). An analysis of alpha-beta pruning. Artificial Intelligence, 6(4): 293-326. 449
157. Koller, D. and Friedman, N. (2009). Probabilsitic Graphical Models: Principles and Techniques. MIT Press. 274, 486
158. Koller, D. and Milch, B. (2003). Multi-agent influence diagrams for representing and solving games. Games and Economic Behavior, 45(1): 181-221. 449
159. Kolodner, J. and Leake, D. (1996). A tutorial introduction to case-based reasoning. In D. Leake (Ed.), Case-Based Reasoning: Experiences, Lessons, and Future Directions, pp. 31-65. AAAI Press/MIT Press. 341
160. Korf, K.E. (1985). Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence, 27(1): 97-109. 106
161. Kowalski, R. (1979). Logic for Problem Solving. Artificial Intelligence Series. North- Holland, New York. 542, 592, 618
162. Kowalski, R. and Sergot, M. (1986). A logic-based calculus of events. New Generation Computing, 4(1): 67-95. 620
163. Kowalski, R.A. (1974). Predicate logic as a programming language. In Information Processing 74, pp. 569-574. North-Holland, Stockholm. 207
164. Kowalski, R.A. (1988). The early history of logic programming. CACM, 31(1): 38-43. 9, 542
165. Koza, J.R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA. 152
166. Kuipers, B. (2001). Qualitative simulation. In R.A. Meyers (Ed.), Encyclopedia of Physical Science and Technology, pp. 287-300. Academic Press, NY, third edition. 66
167. Langley, P., Iba, W., and Thompson, K. (1992). An analysis of Bayesian classifiers. In Proc. 10th National Conference on Artificial Intelligence, pp. 223-228. San Jose, CA. 486
168. Laplace, P. (1812). Théorie Analytique de Probabilités. Courcier, Paris. 219, 223, 296
169. Latombe, J.C. (1991). Robot Motion Planning. Kluwer Academic Publishers, Boston. 66
170. Lawler, E.L. and Wood, D.E. (1966). Branch-and-bound methods: A survey. Operations Research, 14(4): 699-719. 106
171. Leibniz, G.W. (1677). The Method of Mathematics: Preface to the General Science. Selections reprinted by Chrisley and Begeer [2000]. 157
172. Lenat, D.B. and Feigenbaum, E.A. (1991). On the thresholds of knowledge. Artificial Intelligence, 47: 185-250. 41
173. Levesque, H.J. (1984). Foundations of a functional approach to knowledge representation. Artificial Intelligence, 23(2): 155-212. 207
174. Liu, A.L., Hile, H., Kautz, H., Borriello, G., Brown, P.A., Harniss, M., and Johnson, K. (2006). Indoor wayfinding: Developing a functional interface for individuals with cognitive impairments. In Proceedings of the 8th International ACM SIGACCESS Conference on Computers and Accessibility, pp. 95-102. Association for Computing Machinery, New York. 632
175. Lloyd, J.W. (1987). Foundations of Logic Programming. Symbolic Computation Series. Springer-Verlag, Berlin, second edition. 207, 542
176. Lopez, A. and Bacchus, F. (2003). Generalizing Graph Plan by formulating planning as a CSP. In IJCAI-03, pp. 954-960. 367
177. Lopez De Mantaras, R., Mcsherry, D., Bridge, D., Leake, D., Smyth, B., Craw, S., Faltings, B., Maher, M.L., Cox, M.T., Forbus, K., Keane, M., Aamodt, A., and Watson, I. (2005). Retrieval, reuse, revision and retention in case-based reasoning. The Knowledge Engineering Review, 20(3): 215-240. 341
178. Loredo, T. (1990). From Laplace to supernova SN 1987A: Bayesian inference in astrophysics. In P. Fougère (Ed.), Maximum Entropy and Bayesian Methods, pp. 81-142. Kluwer Academic Press, Dordrecht, The Netherlands. 341
179. Lowe, D.G. (1995). Similarity metric learning for a variable-kernel classifier. Neural Computation, 7: 72-85. 341
180. Luenberger, D.G. (1979). Introduction to Dynamic Systems: Theory, Models and Applications. Wiley, New York. 66
181. Mackworth, A.K. (1993). On seeing robots. In A. Basu and X. Li (Eds.), Computer Vision: Systems, Theory, and Applications, pp. 1-13. World Scientific Press, Singapore. 66
182. Mackworth, A.K. (2009). Agents, bodies, constraints, dynamics and evolution. AI Magazine. 632
183. Mackworth, A.K. (1977). On reading sketch maps. In Proc. Fifth International Joint Conf. on Artificial Intelligence, pp. 598-606. MIT, Cambridge, MA. 151
184. Manning, C. and Schütze, H. (1999). Foundations of Statistical Natural Language Processing. MIT Press, Cambridge, MA. 542
185. Mas-Colell, A., Whinston, M.D., and Green, J.R. (1995). Microeconomic Theory. Oxford University Press, New York, NY. 449
186. Matheson, J.E. (1990). Using influence diagrams to value information and control. In R.M. Oliver and J.Q. Smith (Eds.), Influence Diagrams, Belief Nets and Decision Analysis, chapter 1, pp. 25-48. Wiley. 413
187. McAllester, D. and Rosenblitt, D. (1991). Systematic nonlinear planning. In Proc. 9th National Conference on Artificial Intelligence, pp. 634-639. 367
188. McCarthy, J. (1986). Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence, 28(1): 89-116. 207
189. McCarthy, J. and Hayes, P.J. (1969). Some philosophical problems from the standpoint of artificial intelligence. In M. Meltzer and D. Michie (Eds.), Machine Intelligence 4, pp. 463-502. Edinburgh University Press. 8, 618
190. McCulloch, W. and Pitts, W. (1943). A logical calculus of ideas immanent in nervous activity. Bulletin of Mathematical Biophysics, 5: 115-133. 7
191. McDermott, D. and Hendler, J. (1995). Planning: What it is, what it could be, an introduction to the special issue on planning and scheduling. Artificial Intelligence, 76: 1-16. 367
192. McLuhan, M. (1964). Understanding Media: The Extensions of Man. New American Library, New York. 632
193. Meir, R. and Rätsch, G. (2003). An introduction to boosting and leveraging. In In Advanced Lectures on Machine Learning (LNAI2600), pp. 119-184. Springer. 341
194. Mendelson, E. (1987). Introduction to Mathematical Logic. Wadsworth and Brooks, Monterey, CA, third edition. 207
195. Michie, D., Spiegelhalter, D.J., and Taylor, C.C. (Eds.) (1994). Machine Learning, Neural and Statistical Classification. Series in Artificial Intelligence. Ellis Horwood, Hemel Hempstead, Hertfordshire, England. 341
196. Mihailidis, A., Boger, J., Candido, M., and Hoey, J. (2007). The use of an intelligent prompting system for people with dementia. ACM Interactions, 14(4): 34-37. 632
197. Minsky, M. (1961). Steps towards artificial intelligence. Proceedings of the IEEE, 49: 8-30. 106
198. Minsky, M. (1986). The Society of Mind. Simon and Schuster, New York. 29
199. Minsky, M. and Papert, S. (1988). Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge, MA, expanded edition. 7, 341
200. Minsky, M.L. (1975). A framework for representing knowledge. In P. Winston (Ed.), The Psychology of Computer Vision, pp. 211-277. McGraw-Hill, New York. Alternative version is in Haugeland [1997], and reprinted in Brachman and Levesque [1985]. 8
201. Minsky, M. (1952). A neural-analogue calculator based upon a probability model of reinforcement. Technical report, Harvard University Psychological Laboratories, Cambridge, MA. 7
202. Minton, S., Johnston, M.D., Philips, A.B., and Laird, P. (1992). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1-3): 161-205. 152
203. Mitchell, M. (1996). An Introduction to Genetic Algorithms. MIT Press, Cambridge, MA. 152
204. Mitchell, T. (1997). Machine Learning. McGraw-Hill, New York. 341
205. Mitchell, T.M. (1977). Version spaces: A candidate elimination approach to rule learning. In Proc. 5th International Joint Conf. on Artificial Intelligence, pp. 305-310. Cambridge, MA. 341
206. Motik, B., Patel-Schneider, P.F., and Grau, B.C. (Eds.) (2009a). OWL 2 Web Ontology Language Direct Semantics. W3C. http://www.w3.org/TR/owl2-semantics/. 592
207. Motik, B., Patel-Schneider, P.F., and Parsia, B. (Eds.) (2009b). OWL 2 Web Ontology Language Structural Specification and Functional-Style Syntax. W3C. http://www.w3.org/TR/owl2-syntax/. 592
208. Muggleton, S. (1995). Inverse entailment and Progol. New Generation Computing, 13(3,4): 245-286. 620
209. Muggleton, S. and De Raedt, L. (1994). Inductive logic programming: Theory and methods. Journal of Logic Programming, 19, 20: 629-679. 620
210. Muscettola, N., Nayak, P., Pell, B., and Williams, B. (1998). Remote agent: to boldly go where no AI system has gone before. Artificial Intelligence, 103: 5-47. 212
211. Nash, Jr., J.F. (1950). Equilibrium points in n-person games. Proceedings of the National Academy of Sciences of the United States of America, 36: 48-49. 436
212. Nau, D.S. (2007). Current trends in automated planning. AI Magazine, 28(4): 43-58. 367, 632
213. Neumann, J.V. and Morgenstern, O. (1953). Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ, third edition. 413, 424
214. Newell, A. and Simon, H.A. (1976). Computer science as empirical enquiry: Symbols and search. Communications of the ACM, 19: 113-126. Reprinted in Haugeland [1997]. 15, 41
215. Newell, A. and Simon, H.A. (1956). The logic theory machine: A complex information processing system. Technical Report P-868, The Rand Corporation. 7
216. Niles, I. and Pease, A. (2001). Towards a standard upper ontology. In C. Welty and B. Smith (Eds.), Proceedings of the 2nd International Conference on Formal Ontology in Information Systems (FOIS-2001). Ogunquit, Maine. 592
217. Nilsson, N. (2007). The physical symbol system hypothesis: Status and prospects. In e.a. M. Lungarella (Ed.), 50 Years of AI, Festschrift, volume 4850 of LNAI, pp. 9-17. Springer. 41
218. Nilsson, N.J. (1971). Problem-Solving Methods in Artificial Intelligence. McGraw-Hill, New York. 106
219. Nilsson, N.J. (2009). The Quest for Artificial Intelligence: A History of Ideas and Achievements. Cambridge University Press, Cambridge, England. 40
220. Nisan, N. (2007). Introduction to mechanisn design (for computer scientists). In N.N. et al. (Ed.), Algorithmic Game Theory, chapter 9, pp. 209-242. Cambridge University Press, Cambridge, England. 449
221. Nisan, N., Roughgarden, T., Tardos, E., and Vazirani, V.V. (Eds.) (2007). Algorithmic Game Theory. Cambridge University Press. 449
222. Noy, N.F. and Hafner, C.D. (1997). The state of the art in ontology design: A survey and comparative review. AI Magazine, 18(3): 53-74. 592
223. Ordeshook, P.C. (1986). Game theory and political theory: An introduction. Cambridge University Press, New York. 449
224. Panton, K., Matuszek, C., Lenat, D., Schneider, D., Witbrock, M., Siegel, N., and Shepard, B. (2006). Common sense reasoning - from Cyc to intelligent assistant. In Y. Cai and J. Abascal (Eds.), Ambient Intelligence in Everyday Life, LNAI 3864, pp. 1-31. Springer. 592
225. Pearl, J. (1984). Heuristics. Addison-Wesley, Reading, MA. 106, 449
226. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA. 274
227. Pearl, J. (2000). Causality: Models, Reasoning and Inference. Cambridge University Press. 208, 275
228. Peden, M.e.a. (Ed.) (2004). World Report on Road Traffic Injury Prevention. World Health Organization, Geneva. 632
229. Peng, Y. and Reggia, J.A. (1990). Abductive Inference Models for Diagnostic Problem-Solving. Symbolic Computation - AI Series. Springer-Verlag, New York. 207
230. Pereira, F.C.N. and Shieber, S.M. (2002). Prolog and Natural-Language Analysis. Microtome Publishing. 542
231. Pollack, M.E. (2005). Intelligent technology for an aging population: The use of ai to assist elders with cognitive impairment. AI Magazine, 26(2): 9-24. 632
232. Poole, D. (1993). Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence, 64(1): 81-129. 620
233. Poole, D. (1997). The independent choice logic for modelling multiple agents under uncertainty. Artificial Intelligence, 94: 7-56. Special issue on economic principles of multi-agent systems. 620
234. Poole, D., Goebel, R., and Aleliunas, R. (1987). Theorist: A logical reasoning system for defaults and diagnosis. In N. Cercone and G. McCalla (Eds.), The Knowledge Frontier: Essays in the Representation of Knowledge, pp. 331-352. Springer-Verlag, New York, NY. 207
235. Poole, D., Mackworth, A., and Goebel, R. (1998). Computational Intelligence: A Logical Approach. Oxford University Press, New York. xiv
236. Posner, M.I. (Ed.) (1989). Foundations of Cognitive Science. MIT Press, Cambridge, MA. 41
237. Price, C.J., Travé-Massuyàs, L., Milne, R., Ironi, L., Forbus, K., Bredeweg, B., Lee, M.H., Struss, P., Snooke, N., Lucas, P., Cavazza, M., and Coghill, G.M. (2006). Qualitative futures. The Knowledge Engineering Review, 21(04): 317-334. 66
238. Puterman, M. (1994). Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, New York. 413
239. Quinlan, J.R. (1986). Induction of decision trees. Machine Learning, 1: 81-106. Reprinted in Shavlik and Dietterich [1990]. 341
240. Quinlan, J.R. (1993). C4.5 Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA. 341
241. Quinlan, J.R. and Cameron-Jones, R.M. (1995). Induction of logic programs: FOIL and related systems. New Generation Computing, 13(3,4): 287-312. 620
242. Rabiner, L. (1989). A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2): 257-286. 275
243. Reiter, R. (1991). The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In V. Lifschitz (Ed.), Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pp. 359-380. Academic Press, San Diego, CA. 618
244. Reiter, R. (2001). Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press. 618
245. Riesbeck, C. and Schank, R. (1989). Inside Case-Based Reasoning. Lawrence Erlbaum, Hillsdale, NJ. 341
246. Robinson, J.A. (1965). A machine-oriented logic based on the resolution principle. Journal ACM, 12(1): 23-41. 207
247. Rosenblatt, F. (1958). The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65(6): 386-408. 7, 306
248. Rosenschein, S.J. and Kaelbling, L.P. (1995). A situated view of representation and control. Artificial Intelligence, 73: 149-173. 66
249. Rubinstein, R.Y. (1981). Simulation and the Monte Carlo Method. John Wiley and Sons. 275
250. Rumelhart, D.E., Hinton, G.E., and Williams, R.J. (1986). Learning internal representations by error propagation. In D.E. Rumelhart and J.L. McClelland (Eds.), Parallel Distributed Processing, chapter 8, pp. 318-362. MIT Press, Cambridge, MA. Reprinted in Shavlik and Dietterich [1990]. 341
251. Russell, B. (1917). Mysticism and Logic and Other Essays. G. Allen and Unwin, London. 597
252. Russell, S. and Norvig, P. (2010). Artificial Intelligence: A Modern Approach. Series in Artificial Intelligence. Prentice-Hall, Englewood Cliffs, NJ, third edition. 41
253. Russell, S. (1997). Rationality and intelligence. Artificial Intelligence, 94: 57-77. 41
254. Sacerdoti, E.D. (1975). The nonlinear nature of plans. In Proc. 4th International Joint Conf. on Artificial Intelligence, pp. 206-214. Tbilisi, Georgia, USSR. 367
255. Samuel, A.L. (1959). Some studies in machine learning using the game of checkers. IBM Journal on Research and Development, 3(3): 210-229. 7, 424
256. Sandholm, T. (2007). Expressive commerce and its application to sourcing: How we conducted $35 billion of generalized combinatorial auctions. AI Magazine, 28(3): 45-58. 41
257. Savage, L.J. (1972). The Foundation of Statistics. Dover, New York, 2nd edition. 413
258. Schank, R.C. (1990). What is AI, anyway? In D. Partridge and Y.Wilks (Eds.), The Foundations of Artificial Intelligence, pp. 3-13. Cambridge University Press, Cambridge, England. 41
259. Schapire, R.E. (2002). The boosting approach to machine learning: An overview. In MSRI Workshop on Nonlinear Estimation and Classification. Springer Verlag. 341
260. Schubert, L.K. (1990). Monotonic solutions to the frame problem in the situation calculus: An efficient method for worlds with fully specified actions. In H.E. Kyburg, R.P. Loui, and G.N. Carlson (Eds.), Knowledge Representation and Defeasible Reasoning, pp. 23-67. Kluwer Academic Press, Boston, MA. 618
261. Shachter, R. and Peot, M.A. (1992). Decision making using probabilistic inference methods. In Proc. Eighth Conf. on Uncertainty in Artificial Intelligence (UAI-92), pp. 276-283. Stanford, CA. 413
262. Shafer, G. and Pearl, J. (Eds.) (1990). Readings in Uncertain Reasoning. Morgan Kaufmann, San Mateo, CA. 639
263. Shanahan, M. (1989). Prediction is deduction, but explanation is abduction. In Proc. 11th International Joint Conf. on Artificial Intelligence (IJCAI-89), pp. 1055-1060. Detroit, MI. 207
264. Shanahan, M. (1997). Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, Cambridge, MA. 620
265. Shapiro, S.C. (Ed.) (1992). Encyclopedia of Artificial Intelligence. Wiley, New York, second edition. 41
266. Sharkey, N. (2008). The ethical frontiers of robotics. Science, 322(5909): 1800-1801. 630, 632
267. Shavlik, J.W. and Dietterich, T.G. (Eds.) (1990). Readings in Machine Learning. Morgan Kaufmann, San Mateo, CA. 341, 640, 642, 643, 648, 649, 651
268. Shelley, M.W. (1818). Frankenstein; or, The Modern Prometheus. Lackington, Hughes, Harding, Mavor and Jones, London. 632
269. Shoham, Y. and Leyton-Brown, K. (2008). Multiagent Systems: Algorithmic, Game Theoretic, and Logical Foundations. Cambridge University Press. 423, 449
270. Simon, H.A. (1995). Artificial intelligence: an empirical science. Artificial Intelligence, 77(1): 95-127. 41
271. Simon, H. (1996). The Sciences of the Artificial. MIT Press, Cambridge, MA, third edition. 41, 43, 66
272. Singer, P.W. (2009a). Robots at war: The new battlefield. The Wilson Quarterly. http://www.wilsoncenter.org/index.cfm?fuseaction=wq.essay&essay id=496613. 632
273. Singer, P.W. (2009b). Wired for War: The Robotics Revolution and Conflict in the 21st Century. Penguin, New York. 632
274. Smith, B. (2003). Ontology. In L. Floridi (Ed.), Blackwell Guide to the Philosophy of Computing and Information, pp. 155—166. Oxford: Blackwell. 591
275. Smith, B.C. (1991). The owl and the electric encyclopedia. Artificial Intelligence, 47: 251-288. 41
276. Smith, B.C. (1996). On the Origin of Objects. MIT Press, Cambridge, MA. 549
277. Somerville, M. (2006). The Ethical Imagination: Journeys of the Human Spirit. House of Anansi Press, Toronto. 632
278. Spall, J.C. (2003). Introduction to Stochastic Search and Optimization: Estimation, Simulation. Wiley. 152
279. Spiegelhalter, D.J., Franklin, R.C.G., and Bull, K. (1990). Assessment, criticism and improvement of imprecise subjective probabilities for a medical expert system. In M. Henrion, R.D. Shachter, L. Kanal, and J. Lemmer (Eds.), Uncertainty in Artificial Intelligence 5, pp. 285-294. North-Holland, Amsterdam, The Netherlands. 341
280. Spirtes, P., Glymour, C., and Scheines, R. (2000). Causation, Prediction, and Search. MIT Press, Cambridge MA, 2nd edition. 208, 275
281. Sterling, L. and Shapiro, E. (1986). The Art of Prolog. MIT Press, Cambridge, MA. 542
282. Stillings, N.A., Feinstein, M.H., Garfield, J.L., Rissland, E.L., Rosenbaum, D.A., Weisler, S.E., and Baker-Ward, L. (1987). Cognitive Science: An Introduction. MIT Press, Cambridge, MA. 41
283. Stone, P. (2007). Learning and multiagent reasoning for autonomous agents. In The 20th International Joint Conference on Artificial Intelligence (IJCAI-07), pp. 13-30. 632
284. Stone, P. and Veloso, M. (2000). Multiagent systems: A survey from a machine learning perspective. Autonomous Robots, 8: 345-383. 449
285. Sutton, R.S. and Barto, A.G. (1998). Reinforcement Learning: An Introduction. MIT Press, Canbridge, MA. 486
286. Tarski, A. (1956). Logic, Semantics, Metamathematics. Clarendon Press, Oxford, England. Papers from 1923 to 1938 collected and translated by J. H. Woodger. 207
287. Tate, A. (1977). Generating project networks. In Proc. 5th International Joint Conf. on Artificial Intelligence, pp. 888-893. Cambridge, MA. 367
288. Tharp, T. (2003). The Creative Habit: Learn It and Use It for Life. Simon and Schuster. 371
289. Thrun, S. (2006). Winning the darpa grand challenge. In Innovative Applications of Artificial Intelligence Conference, (IAAI-06), pp. 16-20. Boston, MA. 629
290. Thrun, S., Burgard, W., and Fox, D. (2005). Probabilistic Robotics. MIT Press, Cambridge, MA. 275
291. Turing, A. (1950). Computing machinery and intelligence. Mind, 59: 433-460. Reprinted in Haugeland [1997]. 5, 40
292. Tversky, A. and Kahneman, D. (1974). Judgment under uncertainty: Heuristics and biases. Science, 185: 1124-1131. 380
293. Valiant, L.G. (1984). A theory of the learnable. Communications of the ACM, 27: 1134-1142. Reprinted in Shavlik and Dietterich [1990]. 341
294. van Beek, P. and Chen, X. (1999). Cplan: A constraint programming approach to planning. In AAAI-99, pp. 585-590. 367
295. van Emden, M.H. and Kowalski, R.A. (1976). The semantics of predicate logic as a programming language. Journal ACM, 23(4): 733-742. 207
296. Visser, U. and Burkhard, H.D. (2007). Robocup: 10 years of achievements and challenges. AI Magazine, 28(2): 115-130. 632
297. Viswanathan, P., Mackworth, A.K., Little, J.J., and Mihailidis, A. (2007). Intelligent wheelchairs: Collision avoidance and navigation assistance for older adults with cognitive impairment. In Proc. Workshop on Intelligent Systems for Assisted Cognition. Rochester, NY. 632
298. Waldinger, R. (1977). Achieving several goals simultaneously. In E. Elcock and D. Michie (Eds.), Machine Intelligence 8: Machine Representations of Knowledge, pp. 94-136. Ellis Horwood, Chichester, England. 367
299. Walsh, T. (2007). Representing and reasoning with preferences. AI Magazine, 28(4): 59-69. 413
300. Warren, D.H.D. and Pereira, F.C.N. (1982). An efficient easily adaptable system for interpreting natural language queries. Computational Linguistics, 8(3-4): 110-122. 8
301. Webber, B.L. and Nilsson, N.J. (Eds.) (1981). Readings in Artificial Intelligence. Morgan Kaufmann, San Mateo, CA. 41, 642
302. Weiss, G. (Ed.) (1999). Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence. MIT Press, Cambridge, MA. 449
303. Weiss, S. and Kulikowski, C. (1991). Computer Systems that Learn: Classification and Prediction Methods from Statistics, Neural Nets, Machine Learning, and Expert Systems. Morgan Kaufmann, San Mateo, CA. 341
304. Weld, D. (1999). Recent advances in AI planning. AI Magazine, 20(2). 367
305. Weld, D.S. (1992). Qualitative physics: Albatross or eagle? Computational Intelligence, 8(2): 175-186. Introduction to special issue on the future of qualitative physics. 66
306. Weld, D.S. (1994). An introduction to least commitment planning. AI Magazine, 15(4): 27-61. 367
307. Weld, D. and de Kleer, J. (Eds.) (1990). Readings in Qualitative Reasoning about Physical Systems. Morgan Kaufmann, San Mateo, CA. 66
308. Whitley, D. (2001). An overview of evolutionary algorithms. Journal of Information and Software Technology, 43: 817-831. 152
309. Wilkins, D.E. (1988). Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann, San Mateo, CA. 367
310. Winograd, T. (1990). Thinking machines: Can there be? Are we? In D. Partridge and Y. Wilks (Eds.), The Foundations of Artificial Intelligence: A Sourcebook, pp. 167-189. Cambridge University Press, Cambridge, England. 41
311. Winograd, T. (1972). Understanding Natural Language. Academic Press, New York. 8
312. Woods, W.A. (2007). Meaning and links. AI Magazine, 28(4): 71-92. 591
313. Wooldridge, M. (2002). An Introduction to Multiagent Systems. John Wiley and Sons, Chichester, England. 449
314. Yang, Q. (1997). Intelligent Planning: A Decomposition and Abstraction-Based Approach. Springer-Verlag, New York. 367
315. Yang, S., and Mackworth, A.K. (2007). Hierarchical shortest pathfinding applied to route-planning for wheelchair users. In Proc. Canadian Conf. on Artificial Intelligence, AI-2007. Montreal, PQ. 632
316. Zhang, N.L. and Poole, D. (1994). A simple approach to Bayesian network computations. In Proc. of the Tenth Canadian Conference on Artificial Intelligence, pp. 171-178. 274
317. Zhang, N.L. (2004). Hierarchical latent class models for cluster analysis. Journal of Machine Learning Research, 5(6): 697-723. 341
318. Zhang, Y. and Mackworth, A.K. (1995). Constraint nets: A semantic model for hybrid dynamic systems. Theoretical Computer Science, 138: 211-239. 66
319. Zilberstein, S. (1996). Using anytime algorithms in intelligent systems. AI Magazine, 17(3): 73-83. 41