Generality in artificial intelligence

@article{McCarthy1987GeneralityIA,
  title={Generality in artificial intelligence},
  author={J. McCarthy},
  journal={Commun. ACM},
  year={1987},
  volume={30},
  pages={1029-1035}
}
My 1971 Turing Award Lecture was entitled "Generality in Artificial Intelligence." The topic turned out to have been overambitious in that I discovered I was unable to put my thoughts on the subject in a satisfactory written form at that time. It would have been better to have reviewed my previous work rather than attempt something new, but such was not my custom at that time. I am grateful to ACM for the opportunity to try again. Unfortunately for our science, although perhaps fortunately for… Expand
Artificial Intelligence: From programs to solvers
TLDR
The problem of generality in AI is revisited, the way in which this ’Models and Solvers’ agenda addresses the problem is looked at, and the relevance of this agenda to the grand AI goal of a computational account of intelligence and human cognition is discussed. Expand
Decidability of Contextual Reasoning
TLDR
The purpose of this paper is to show that propositional contextual reasoning is decidable. Expand
What Computers Still Can't Do
TLDR
In defending “symbolic AI”, one development-formalized nonmonotonic reasoning is emphasized, because it illustrates intermittent but definite progress in logic-based AI. Expand
Making Robots Conscious of Their Mental States
TLDR
Thinking about consciousness with a view to designing it provides a new approach to some of the problems of consciousness studied by philosophers and one advantage is that it focusses on the aspects of consciousness important for intelligent behavior. Expand
Comparing formal theories of context in AI
TLDR
This paper proposes the first in depth comparison between these two formalizations, both from a technical and a conceptual point of view, and presents a comparison of the epistemological adequacy of PLC and MCS/LMS for the representation of the most important issues about contexts. Expand
On the Measure of Intelligence
TLDR
A new formal definition of intelligence is articulate, describing intelligence as skill-acquisition efficiency and highlighting the concepts of scope, generalization difficulty, priors, and experience, and a set of guidelines for what a general AI benchmark should look like are proposed. Expand
Behavioural artificial intelligence: an agenda for systematic empirical studies of artificial inference
TLDR
It is argued that due to the complexity and opacity of artificial inference, one needs to initiate systematic empirical studies of artificial intelligent behavior similar to what has previously been done to study human cognition, judgment and decision making, to provide valid knowledge about the judgments and decisions made by intelligent systems. Expand
A Framework for Searching for General Artificial Intelligence
TLDR
This document seeks to describe and unify principles that guide the basis of the development of general artificial intelligence, and defines intelligence as the ability to acquire skills that narrow this search, diversify it and help steer it to more promising areas. Expand
Contextual Reasoning
It is widely agreed on that most cognitive processes are contextual in the sense that they depend on the environment, or context, inside which they are carried on. Even concentrating on the issue ofExpand
Dealing with expected and unexpected obstacles
TLDR
It is argued that this is not the case, and a general methodology for combining generality and locality is proposed, essentially based on the notion of context. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 44 REFERENCES
SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE
TLDR
The formalism of this paper represents an advance over McCarthy (1963) and Green (1969) in that it permits proof of the correctness of strategies that contain loops and strategies that involve the acquisition of knowledge; and it is also somewhat more concise. Expand
Some Expert Systems Need Common Sense
  • JOHN MCCARTHY
  • Psychology, Medicine
  • Annals of the New York Academy of Sciences
  • 1984
TLDR
The object of this lecture is to describe common sense abilities and the problems that require them in an expert system, a program for advising physicians on treating bacterial infections of the blood and meningitis. Expand
A Learning Machine: Part I
TLDR
It is proposed that the program of a stored-program computer be gradually improved by a learning procedure which tries many programs and chooses, from the instructions that may occupy a given location, the one most often associated with a successful result. Expand
A Logic for Default Reasoning
  • R. Reiter
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1980
TLDR
This paper proposes a logic for default reasoning, develops a complete proof theory and shows how to interface it with a top down resolution theorem prover, and provides criteria under which the revision of derived beliefs must be effected. Expand
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
We describe a new problem solver called STRIPS that attempts to find a sequence of operators in a space of world models to transform a given initial world model into a model in which a given goalExpand
Applications of Circumscription to Formalizing Common Sense Knowledge
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. TheExpand
Non-Monotonic Logic I
TLDR
A model and proof theories, a proof procedure, and applications for one non-monotonic logic are developed, and it is proved the completeness of the non-Monotonic predicate calculus and the decidability of theNon- monotonic sentential calculus. Expand
First Order Theories of Individual Concepts and Propositions.
We discuss rst order theories in which individual concepts are admitted as mathematical objects along with the things that reify them. This allows very straightforward formalizations of knowledge,Expand
A Learning Machine: Part II
An effort is made to improve the performance of the learning machine described in Part I, and the over-all effect of various changes is considered. Comparative runs by machines without the scoringExpand
Truth Maintenance Systems for Problem Solving
TLDR
It is shown that reasoning programs which take care to record the logical justifications for program beliefs can apply several powerful, but simple, domain-independent algorithms to maintain the consistency of program beliefs and realize substantial search efficiencies. Expand
...
1
2
3
4
5
...