Showing papers in "Artificial Intelligence in 1977"

TL;DR: A light sensing apparatus is described which employs a GaAsP MOS light-receiving element to which a potential is applied for creating a depletion region.

TL;DR: In this paper, a rule-based system for computer-aided circuit analysis, called EL, is presented, which is written in a rule language called ARS, and implemented by ARS as pattern-directed invocation demons monitoring an associative data base.

TL;DR: The gradient space, popularized by Huffman and Mackworth in a slightly different context, is a helpful tool in the development of new methods for exploiting three-dimensional shape information in image intensities.

TL;DR: The MYCIN system has begun to exhibit a high level of performance as a consultant on the difficult task of selecting antibiotic therapy for bacteremia and issues of representation and design for the system are discussed.

TL;DR: Techniques for generating structured, symbolic descriptions of complex curved objects by segmenting them into simpler sub-parts by matching these descriptions with stored descriptions of models are presented.

TL;DR: This talk reviews those efforts in automatic theorem proving, during the past few years, which have emphasized techniques other than resolution.

TL;DR: The construction of a time specialist is discussed, a program knowledgable about time in general which can be used by a higher level program to deal with the temporal aspects of its problem-solving.

TL;DR: This paper analyzes the complexity of heuristic search algorithms, i.e. algorithms which find the shortest path in a graph by using an estimate to guide the search and presents a new search algorithm which runs in O(N2) steps in the worst case and which never requires more steps than A*.

TL;DR: Examples are used to show: (1) that the value of (hn) may be a function of the state of the search as well as the available heuristic information and (2) that there exist admissible search algorithms which can not be simulated by any A ∗ algorithm.

TL;DR: A new approach for integrating the segmentation and interpretation phases of scene analysis using a generalization of Waltz's filtering algorithm, which demonstrates that segmentation is much improved when integrated with interpretation.

TL;DR: 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 as mentioned in this paper.

TL;DR: AM as mentioned in this paper is a computer program that develops new mathematical concepts and formulates conjectures involving them; AM is guided in this exploration by a collection of 250 more or less general heuristic rules.

TL;DR: The paper describes the methods used for analyzing a situation and for modifying unsuccessful plans and some results found by the program.

TL;DR: Directed recursive labelnode hypergraphs (DRLHs) are defined as a new representation-language combining 3 generalizations of directed labeled graphs.

TL;DR: An analysis of the efficiency of the alpha-beta algorithm is carried out based on a probabilistic model in which terminal node scores depend on random branch values, which shows no upper bound on the expected number of terminal nodes scored.

TL;DR: A relational production composition theorem is demonstrated that without a sponge-like component in the antecedent of a production, composition of two arbitrary productions is in general impossible.

TL;DR: This paper describes a general structural pattern recognition system that introduces code —a description language for patterns based on boolean logic and set theory and gives internal machine representations for concepts and objects which directly influence the efficiency of the system.

TL;DR: A theorem prover for elementary number theory is described which proves theorems not by representing them as diagrams as in a semantic net, but rather by represent them in the traditional manner as lists.

TL;DR: This paper presents several methods for analysing finite state problems to discover certain types of symmetry based on techniques used in Sequential Machine Theory, especially the use of partitions that have the Substitution Property.