Selected Technical Reports

  1. Genesereth, M. R.: "A Fast Inference Algorithm for Semantic Networks", Memo No. 4, M.I.T. Mathlab Group, 1977.

  2. Genesereth, M. R.: "Why", HPP-80-19, Stanford University Heuristic Programming Project, 1980.

  3. Genesereth, M. R.: "Metaphors and Models", HPP-80-20, Stanford University Heuristic Programming Project, 1980.

  4. Finger, J. J., Genesereth, M. R.: "Residue: A Deductive Approach to Design", HPP-83-46, Stanford University Heuristic Programming Project, 1983.

  5. Greiner, R., Genesereth, M. R.: "The Role of Abstractions in Understanding Analogies", HPP-84-8, Stanford University Heuristic Programming Project, 1984.

  6. Genesereth, M. R., Smith, D. E.: "Procedural Hints in the Control of Reasoning", HPP-84-11, Stanford University Heuristic Programming Project, 1984.

  7. Genesereth, M. R., Ginsberg, M. L., Rosenschein, J. S.: "Solving the Prisoner's Dilemma", STAN-CS-84-1032, Stanford University Computer Science Department, 1984.

  8. Trietel, R., Genesereth, M. R.: "Choosing Directions for Rules", KSL-85-46, Stanford University Heuristic Programming Project, 1985.

  9. Genesereth, M. R.: "Discrete Systems Theory", Logic-89-6, Stanford University Computer Science Department, 1989.

  10. Sikka, V., Gensereth, M. R., Singh, N.: "A Fast Algorithm for Automatic Theorem Proving with Equality", Logic-91-2, Stanford University Computer Science Department, 1991.

  11. Genesereth, M. R., Keller, M. A., Mueller, G. C.: "Stanford Information Network", Logic Group, Stanford University Computer Science Department, April 1996.

  12. Nourbakhsh, I., Genesereth, M. R.: "Abstraction in Planning and Execution", Logic Group, Stanford University Computer Science Department, 1997.