Showing papers in "Artificial Intelligence in 1970"

TL;DR: One of the vision projects of the Stanford Research Institute Artificial Intelligence Group is described, which uses regions as basic data and progresses by successive partitioning of the picture toward an interpretable “goal partition”, which is then explored by a heuristic decision tree.

TL;DR: A class of graph-searching procedures is described which uses a heuristic function to guide search, and a number of theoretical results for this model, and the intuition for these results, relate the efficiency of search to the accuracy of the heuristics used.

TL;DR: Procedures are developed which permit a problem-solving program employing heuristics in production rule form to learn to improve its performance by evaluating and modifying existingHeuristics and hypothesizing new ones, either during an explicit training process or during normal program operation.

TL;DR: An effort to design a heuristic problem-solving program which accepts problems stated in a nondeterministic programming language and applies constraint satisfaction methods and heuristic search methods to find solutions.

TL;DR: The main purpose is to emphasize the great variety of possible applications of the results, especially for solving problems of the kind: "Find a sequence of actions that will achieve a given goal."

TL;DR: A version of the heuristically guided search algorithm presented which is guaranteed to succeed with the minimum amount of storage is presented and is proved to exploit the clustering of chromosome data.

TL;DR: The purpose of this paper is to supply some of the details of an algorithm for constructing proofs for theorems of an axiomatic theorý which is a portion of plane geometry.

TL;DR: It is shown that, in the language of first-order predicate calculus for example, inductive inference systems can be designed with the property of relative completeness, i.e., relative to a set of sentences and to the level of deductive power available to the system.

TL;DR: It is proved that, if a set S of clauses is R-unsatisfiable and if F is the set of the functionally reflexive axioms for S, then the empty clause can be derived from S & {x = x} & F using renamable resolution plus renamables paramodulation.