Not enough data to create a plot.
Try a different view from the menu above.
Speech understanding systems: Final report of a study group
Newell, A. | Barnett, J. | Forgie, J. | Klatt, D. H. | Licklider, J. C. R. | Munson, J. | Reddy, D. R. | Woods, W. A.
"A five-year interdisciplinary effort by speech scientists and computer scientists has demonstrated the feasibility of programming a computer system to “understand” connected speech, i.e., translate it into operational form and respond accordingly. An operational system (HARPY) accepts speech from five speakers, interprets a 1000-word vocabulary, and attains 91 percent sentence accuracy. This Steering Committee summary report describes the project history, problem, goals, and results." Amsterdam: North- Holland.
A spatially-oriented information processor which simulates the motions of rigid objects
Artificial Intelligence 4:29-40
An effective heuristic algorithm for the travelling-salesman problem
Operations Research, 21 (2), 498-516.
The fourteen primitive actions and their inferences
Memo 183, AI Laboratory, Stanford University.
Computer-Assisted Clinical Decision Making
Methods of Information in Medicine, 12: 45-51. Reprinted in Clancey & Shortliffe, Ch.2
On the Mechanization of Abductive Logic
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.
Doing Arithmetic With Diagrams
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.
Control Algorithm of the Walker Climbing Over Obstacles
Okhotsimski, D.E., A.K, Platonov
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.