CSE 472/572, Spring 2001

MISCELLANEOUS REFERENCES

Last Update: 12 January 2001

Note: NEW material is highlighted

On EPAM:

  1. Feigenbaum, Edward A. (1963), "The Simulation of Verbal Learning Behavior", in Edward A. Feigenbaum & Jerome Feldman (eds.), Computers and Thought (New York: McGraw-Hill). (Lockwood & SEL Q335.5 .F4)
  2. Slagle, James R. (1971), Artificial Intelligence: The Heuristic Programming Approach (New York: McGraw-Hill), Ch. 12. (SEL Q335 .S57)
  3. EPAM: Overview
  4. Do a Google search on "EPAM and Feigenbaum"

On the History of AI

  1. McCorduck, Pamela (1979), Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence (San Francisco: W.H. Freeman); (SEL Q335 .M23)

On SOAR:

  1. Lehman, Jill Fain; Laird, John E.; & Rosenbloom, Paul (1998), ``A Gentle Introduction to Soar: An Architecture for Human Cognition'', in Scarborough, Don, & Sternberg, Saul (eds.), Methods, Models, and Conceptual Issues, Vol. 4 of Osherson, Daniel N. (general ed.), An Invitation to Cognitive Science; 2nd edition (Cambridge, MA: MIT Press): 211-253.

On Conceptual Dependency:

  1. Schank, Roger C., & Riesbeck, Christopher K. (eds.) (1981), Inside Computer Understanding: Five Programs Plus Miniatures (Hillsdale, NJ: Lawrence Erlbaum Associates)

  2. Sterling, Leon, & Shapiro, Ehud (1986), The Art of Prolog: Advanced Programming Techniques (Cambridge, MA: MIT Press): 234.

On the Semantics of Semantic Networks:

  1. Mc Dermott, Drew (1976), ``Artificial Intelligence Meets Natural Stupidity,'' in John Haugeland (ed.), < i>Mind Design: Philosophy, Psychology, Artificial Intelligence (Cambridge, MA: MIT Press, 1981): 143-160.

On the 8- and 15-puzzles:

  1. Doran, J. E., & Michie, D. (1966), ``Experiments with the Graph Traverser Program'', Proceedings of the Royal Society of London, Series A. Mathematical and Physical Sciences 294: 235-259, esp. pp. 242-250. (SEL Q41 .L7(2))

  2. Nilsson, Nils J. (1971), Problem-Solving Methods in Artificial Intelligence (New York: McGraw-Hill) (SEL Q335 .N52 1971)

  3. Nilsson, Nils J. (1980), Principles of Artificial Intelligence (Palo Alto: Tioga).

  4. Archive of newsgroups on the 8.and.15.puzzles

On computer chess:

  1. Marsland, T. Anthony (1992), ``Computer Chess and Search'', in Stuart C. Shapiro (ed.) (1992), Encyclopedia of Artificial Intelligence, 2nd edition (New York: John Wiley): 224-241.

  2. Zobrist, Albert L. (1993), ``Computer Games: Traditional Games'', in Anthony Ralston & Edwin D. Reilly (eds.), Encyclopedia of Computer Science, 3rd edition (New York: Van Nostrand Reinhold): 290-294.

On translating from English to first-order predicate logic:

  1. Schagrin, Morton L. (1979), The Language of Logic: A Self-Instruction Text, 2nd ed. (New York: Random House).

  2. Otto, Herbert R. (1978), The Linguistic Basis of Logic Translation (Washington, DC: University Press of America), ISBN 0-8191-0617-8.

On Gödel's Theorem:

  1. Hofstadter, Douglas R. (1979), Gödel, Escher, Bach: An Eternal Golden Braid (New York: Basic Books).

  2. Nagel, Ernest, & Newman, James R. (1958), Gödel's Proof (New York: New York University Press).

On natural-deduction systems:

  1. Gries, David (1981), The Science of Programming (New York: Springer-Verlag), Ch. 3.

  2. Schagrin, Morton L.; Rapaport, William J.; & Dipert, Randall R. (1985), Logic: A Computer Approach (New York: McGraw-Hill).



Copyright © 2000 by William J. Rapaport (rapaport@cse.buffalo.edu)
file: 572/S01/refs.12ja01.html