Showing papers in "Artificial Intelligence in 1972"

TL;DR: A formal model is presented which represents the structure underlying temporal references in natural language, and a computer question answering program, "Chronos", which uses the concepts of tense and time-segment relations, illustrates and supports the validity of the model.

TL;DR: Interpret as mentioned in this paper is a heuristic scene description system that uses knowledge about the world in a variety of ways to produce a description of the scene that is consistent with its input.

TL;DR: The authors describes the operation of an augmented recursive transition network parser and demonstrates the natural way in which perceptual strategies, based on the results of psycholinguistic experimentation, can be represented in the transition network grammatical notation.

TL;DR: A computer simulation of paranoid processes in the form of a dialogue algorithm was subjected to a validation study using indistinguishability tests and it is concluded that the model provides a successful simulation of naturally occurring paranoid processes.

TL;DR: An algorithm is presented which when given a complete description of a set of Turing machine computations finds a Turing machine which is capable of doing those computations.

TL;DR: This program, based on a brute force search of the move tree with no forward pruning, using material as the only terminal evaluation function, and using a limited positional analysis at the top level for a tiebreak between moves which are materially equal is proposed.

TL;DR: In this article, some relatively simple concepts have been developed which, when incorporated into existing automatic theorem proving programs, enable them to prove efficiently a number of the limit theorems of elementary calculus, including the theorem that differentiable functions are continuous.

TL;DR: It is argued that the incompleteness of this latter strategy for consequence-finding recommends it above the other two as a complete strategy for theorem-proving.

TL;DR: It is shown how they can be played as though they were positional or decomposable by using the homomorphisms, and it is proven that they "preserve" winning strategies.

TL;DR: The problem of timetable compilation for a single-track railway is a job-shop scheduling problem but with differences that handicap the generation of feasible solutions, so the way to resolve a conflict is selected by a lookahead method which enables to obtain good enough solutions by using a very rough estimate function.

TL;DR: In this article, a method for eliminating quantifiers in the elementary theory of addition on the real numbers (EAR) has been described, which has been programmed and demonstrated its usefulness in solving problems related to linear programming.