Generality in artificial intelligence

Communications of the ACM

Volumn 30, Issue 12, 1987, Pages 1030-1035

  McCarthy, John ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Common sense; generality in AI; John McCarthy; Turing Award

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SOFTWARE;

ARTIFICIAL INTELLIGENCE PROGRAMS; BEHAVIOR REPRESENTATION; GENERAL PROBLEM SOLVER; KNOWLEDGE REPRESENTATION; NONMONOTONICITY;

ARTIFICIAL INTELLIGENCE;

EID: 0023535206     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/33447.33448     Document Type: Article

References (22)

1. Black, F. A deductive question answering system. Doctoral dissertation, Harvard Univ., Cambridge, Mass., 1964.
2. Buchanan, B.G., and Shortliffe, E.H., Eds. Rule-based expert systems: The MYCIN experiments of the Stanford Heuristic Programming Project. Stanford, Calif., 1984.
3. Davis, R., Buchanan, B., and Shortliffe, E. Production rules as a representation for a knowledge-based consultation program. Artif. lntell. 8, 1 (Feb. 1977), 15–45.
4. Doyle, J. Truth maintenance systems for problem solving. In Proceedings of the 5th International Joint Conference on Artificial Intelligence (Cambridge, Mass., Aug. 22-25). IJCAI, 1977, p. 247.
5. Ernst, G.W., and Newell, A. GPS: A Case Study in Generality and Problem Solving. Academic Press, New York, 1969.
6. Fikes, R., and Nilsson, N. STRIPS: A new approach to the application of theorem proving to problem solving. Artif. lntell. 2, 3–4 (Jan. 1971), 189–208.
7. Friedberg, R.M. A learning machine. IBM J. Res. Dev. 2, 1 (Jan. 1958), 2–13.
8. Friedberg, R.M., Dunham, B., and North, J.H. A learning machine, Part II. IBM J. Res. Dev. 3, 3 (July 1959), 282–287.
9. Green, C. Theorem-proving by resolution as a basis for question answering systems. In Machine Intelligence 4, B. Meltzer and D. Michie, Eds. Edinburgh University Press, Edinburgh, U.K., 1969, pp. 183–205.
10. Laird, J.E., Newell, A., and Rosenbloom, P.S. Soar: An architecture for general intelligence. Artif. lntell. 33 (1987), 1–64.
11. Lifschitz, V. Computing circumscription. In Proceedings of the 9th International joint Conference on Artificial Intelligence, vol. 1 (Los Angeles, Calif., Aug. 19-23). IJCAI, 1985, pp. 121–127.
12. McCarthy, J. Programs with common sense. In Proceedings of the Teddington Conference on the Mechanization of Thought Processes, vol. 1 (Teddington, U.K., Nov. 24-27). Her Majesty’s Stationery Office, London, 1960, pp. 77–84. (Reprinted: M. Minsky, Ed. Semantic Information Processing, MIT Press, Cambridge, Mass.)
13. McCarthy, J. First order theories of individual concepts and propositions. In Machine Intelligence 9, D. Michie, Ed. University of Edinburgh Press, Edinburgh, U.K., 1979.
14. McCarthy, J. Circumscription—A form of non-monotonic reasoning. Artif. lntell. 13, 1, 2 (Apr. 1980), 27–39.
15. McCarthy, J. Some expert systems need common sense. In Computer Culture: The Scientific, Intellectual and Social Impact of the Computer, vol. 426, Heinz Pagels, Ed. Annals of the New York Academy of Sciences, New York Academy of Sciences, New York, 1983, pp. 129–137.
16. McCarthy, J, Applications of circumscription to formalizing common sense knowledge. Artif. lntell. 28, 1 (Feb. 1986), 89–116.
17. McCarthy, I., and Hayes, P.J. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence 4, D. Michie, Ed. Elsevier North-Holland, New York, 1969, 463–502.
18. McDermott, D., and Doyle, J. Non-monotonic logic I. Artif. lntell. 13, 1-2 (Apr. 1980), 41–72.
19. Newell, A., and Simon, H.A. Human Problem Solving. Prentice-Hall, Englewood Cliffs, N.J., 1972.
20. Newell, A., Shaw, J.C., and Simon, H.A. Preliminary description of general problem solving program-I (GPS-I). C1P Work. Pap. 7, Carnegie Institute of Technology, Pittsburgh, Pa., Dec. 1957.
21. Newell, A., Shaw, J.C., and Simon, H.A. A variety of intelligent learning in a general problem solver. In Self-Organizing Systems, M.C. Yovits and S. Cameron, Eds. Pergamon Press, Elmford, N.Y., pp. 153–189.
22. Reiter, R. A logic for default reasoning. Artif. lntell. 13, 1–2 (Apr. 1980), 81–132.