Showing papers in "Artificial Intelligence in 1971"

TL;DR: In this paper, the authors describe a problem solver called STRIPS that attempts to find a sequence of operators in a space of world models to transform a given initial world model in which a given goal formula can be proven to be true.

TL;DR: It is argued that at least two types of description of the pattern must be utilised if any significant pattern generalisation is to be achieved, and in general that all picture interpretation tasks involve descriptions in two domains.

TL;DR: Linear resolution with selection function (SL-resolution) as mentioned in this paper is a restricted form of linear resolution with a selection function which chooses from each clause a single literal to be resolved upon in that clause.

TL;DR: The requirements for intelligent decision-making proposed by McCarthy and Hayes are criticised as too narrow, and more general requirements are suggested instead.

TL;DR: This paper describes a non-anthropomorphically based method of decomposing a scene subjected to a special form of illumination into elementary planar areas and addresses the application of grid coding to other problems in recording and extracting information from 3-D images.

TL;DR: A theorem proving program has been written in LISP which attempts to speed up automatic theorem proving by the use of heuristics, applicable to the proof of any theorem in mathematics, while others are designed for set theory.

TL;DR: In this article, a paradigm enabling heuristic problem solving programs to exploit an analogy between a current unsolved problem and similar but previously solved problems to simplify its search for a solution is outlined.

TL;DR: An attempt is being made to automate protocol analysis, which is a form of data analysis in psychology for inferring the information processes used by a human from his verbal behavior while solving a problem.

TL;DR: In this paper, an algorithm for searching for a minimal solution graph in an AND/OR graph is described and if the “lower bound” condition is satisfied, the algorithm is guaranteed to find a minimal solutions graph when one exists.

TL;DR: It is demonstrated that falsehood preserving rules lead from consequences to axioms, and thus they can be used for hypothesis generation and may be used as an hypothesis generating machine if one employs the methods outlined.

TL;DR: An extraction procedure for proofs generated by the resolution principle is presented, which uses a given proof to find solutions for existential quantifiers in the statement proved in terms of known quantities in the initial data.

TL;DR: A new theorem-proving program to solve problems expressed in the first-order predicate calculus with equality has been implemented and extensively tested, enabling the successful solution of a large number of problems with widely differing characteristics.

TL;DR: This paper argues that predicate calculus has significant advantages above competing deep structures if the way of using it is carefully selected, and gives hints on how various natural-language constructions can be encoded in a consistent way.