Methods of Information in Medicine, 12: 45-51. Reprinted in Clancey & Shortliffe, Ch.2

In IJCAI-73, pp. 1–11.

Abduction is a basic form of logical inference, which is said to engender the use of plans, perceptual models, intuitions, and analogical reasoning - all aspects of Intelligent behavior that have so far failed to find representation in existing formal deductive systems. This paper explores the abductive reasoning process and develops a model for it s mechanization, .which consists of an embedding of deductive logic in an iterative hypothesis and test procedure. An application of the method to the problem of medical diagnosis is discussed.In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.

A theorem prover for part of arithmetic in described which proves theorems by representing them in the form of a diagram or network. The nodes of this network represent 'ideal integers', i.e. objects which have all the properties of integers, without being any particular intoger. The links in the network represent relationships between 'ideal integers'. The procedures which draw these diagrams make elementary deductions based on their built-in knowledge of the functions and predicates of arithmetic. This theorem prover is intended as a model of some kinds of human problem-solving behaviour. Also found at EdinburghIn IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.

The paper deals with the problem of development the multilevel control algorithms fo r six-legged automatic walker, which provide the walker with the possibility to analyse the terrain profile before it while moving over rough terrain , and to synthesize adequate, rather reasonable kinematics of body and legs for walker's locomotion along the route and climbing over obstacles on it s way. DC simulation and analysis of walker's model moving image on DC display screen make it possible to evaluate the algorithms developed and to find ways for their improvement.In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.

in Roger Schank and Kenneth Colby (eds), Computer Models of Thought and Language, pp. 187-247, San Francisco: W. H. Freeman and Co., 1973

This paper proposes a modular ACTOR architecture and definitional method for artificial intelligence that is conceptually based on a single kind of object: actors [or, if you will, virtual processors, activation frames, or streams]. The formalism makes no presuppositions about the representation of primitive data structures and control structures. Such structures can be programmed, micro-coded, or hard wired 1n a uniform modular fashion. In fact it is impossible to determine whether a given object is "really" represented as a list, a vector, a hash table, a function, or a process. The architecture will efficiently run the coming generation of PLANNER-like artificial intelligence languages including those requiring a high degree of parallelism. The efficiency is gained without loss of programming generality because it only makes certain actors more efficient; it does not change their behavioral characteristics. The architecture is general with respect to control structure and does not have or need goto, interrupt, or semaphore primitives. The formalism achieves the goals that the disallowed constructs are intended to achieve by other more structured methods.In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.

IJCAI 1973: 629-640. Also IEEE Trans. Computers 25(4): 439-449 (1976).

Eugene, Oregon: Condon Lecture Publications, 1973. Also MIT Al Laboratory, memo 252.

This paper presents a machine designed for compact representation and rapid execution of LISP programs. The machine language is a factor of 2 to 5 more compact than S-expressions or conventional compiled code, and the.compiler is extremely simple. The encoding scheme is potentiall y applicable to data as wel l as program. The machine also provides for user-defined data structures.In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.