Circumscription—A Form of Non-Monotonic Reasoning

Elsevier eBooksPublished 1 January 1981

John McCarthy

Citations227

Abstract

Humans and intelligent computer programs must often jump to the conclusion that the objects they can determine to have certain properties or relations are the only objects that do. Circumscription formalizes such conjectural reasoning.

Keywords

Computer Science

Artificial IntelligenceA logic for default reasoning

3,920 Citations1980Raymond Reiter

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.

Elsevier eBooksSome Philosophical Problems from the Standpoint of Artificial Intelligence

3,289 Citations1981John McCarthy, Patrick J. Hayes

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.

Artificial IntelligenceNon-monotonic logic I

891 Citations1980Drew McDermott, Jon Doyle

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.

View PDF

Programs with common sense

805 Citations1960John McCarthy

This paper discusses programs to manipulate in a suitable formal language (most likely a part of the predicate calculus) common instrumental statements, where the basic program will draw immediate conclusions from a list of premises.

Elsevier eBooksEPISTEMOLOGICAL PROBLEMS OF ARTIFICIAL INTELLIGENCE

327 Citations1981John McCarthy

This chapter further explains this division of AI, explains some of the epistemological problems, and presents some new results and approaches.

Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot

318 Citations1972Carl Hewitt

PANNER is a formalism for proving theorems and manipulating models in a robot built out of a number of problem-solving primitives together with a hierarchical multiprocess backtrack control structure.

Elsevier eBooksOn Representations of Problems of Reasoning about Actions

268 Citations1981Saul Amarel

The chapter discusses a specific problem of transportation scheduling to evaluate the effects of alternative formulations of this problem on the expected efficiency of mechanical procedures for solving it and also to examine the processes that come into play when a transition takes place from a given problem formulation into a better one.

CogPrints (Cogprints)Ascribing Mental Qualities to Machines

240 Citations1979John McCarthy

Some new definitional tools are proposed: definitions relative to an approximate theory and second order structural definitions for mental qualities to a machine.

CogPrints (Cogprints)First Order Theories of Individual Concepts and Propositions.

182 Citations1979John McCarthy

Rst order theories in which individual concepts are admitted as mathematical objects along with the things that reify them allows very straightforward formalizations of knowledge, belief, wanting, and necessity in ordinary rst order logic without modal operators.

Artificial IntelligenceThe mathematics of non-monotonic reasoning

100 Citations1980Martin Davis

Part I of this memo discusses minimal entailment and minimal completion suggested by McCarthy (now included in his more general notion of circumscription) and Part II discusses the “non-monotonic logic” of McDermott and Doyle.