Linguistic competence cannot in principle be divorced from linguistic performance in order to abstract universal properties of grammars. Rules of grammar inevitably incorporate perceptual strategies and constraints, and grammaticality and acceptability are related to predictability.
A parser for a speech understanding system is described. The parser uses a best-first strategy in which alternative paths are assigned priorities and paths are suspended as long as there is a higher priority alternative to explore.
This paper describes a theorem prover that embodies knowledge about programming constructs, such as numbers, arrays, lists, and expressions. The program can reason about these concepts and is used as part of a program verification system that uses the Floyd-Naur explication of program semantics.
Under the terms of National Science Foundation, Grant GK 36487, the Stanford Research Institute has been studying equipment needs for artificial intelligence research. SRI proposes a two-year program to design, fabricate, and test a prototype system consisting of the vehicle, arm, and vision system.
This report summaries the results of a three-year project aimed at the design and implementation of computer languages to aid in expressing problem solving procedures in several areas of artificial intelligence including automatic programming, theorem proving, and robot planning.
A preliminary version of QLISP is described. QLISP permits free intermingling of QA4-like constructs with INTERLISP code. The preliminary version contains features similar to those of QA4 except for the backtracking of control environments.
This report describes the talks and discussions occurring at an informal Workshop on Automatic Problem Solving held at Pajaro Dunes, CA, on May 14-16, 1973.
This paper describes current progress in Artificial Intelligence (AI). Particular emphasis is given to describing AI as an independent field of study having both applied-technological and scientific-theoretical branches.
