K.A.PATON 411 24 Centromere finding: some shape descriptors for small chromosome outlines.

The equivalence problem for program schemes, or for programs, is reduced to the proving of a theorem in second-order logic. This work extends Manna's first-order logic reductions. Some examples of the technique are given together with a suggested method for obtaining proofs in special cases by firstorder methods. INTRODUCTION Several workers in recent years have considered using techniques and ideas of various mathematical theories of computation for proving interesting results about computer programs. This paper is concerned with two of these approaches.

R.M.BURSTALL 373 23 Assertions: programs written without specifying unnecessary order.

Networks as models of word storage: G. R. Kiss

In recent years there has been a great deal of interest in the commercial applications of knowledge-based (KB) systems (commonly called expert systems). Interest in KB systems was spurred on by the development of programs that can solve complex tasks at an expert level.

The Stanford University component of this research is funded in part by ARPA contract #MDA903-80-C-0107, NIH contract # NIH RR 00785-10, ONR contract #N00014-79-C-0302. Compiled oy Bruce G. Buchanan November 1982 Abbreviations Used in This Bibliography: AAAI American Association for An:ficial Intelligence ACM Association for Computing Machinery AFIPS American Federation of Information Processing Societies ECAI European Conference on Artificial Intelligence IEEE Institute for Electrical and Electronic Engineers IFIPS International Federation of Information Processing Societies IJCAI International Joint Cr nferences on Artificial Intelligence SIGPLAN ACM Specia! Abe, N., ltoh, F., and Tsuji, S. Toward a learning of object models using analogical objects and verbal instruction. Addis, T. R., and Hartley, R. T. A faultfinding aid u,sing a content addressable file store. ICL Technical Note TN 79, ICL Ltd., London, 1979.

The first computers were numerical calculators that did not appear to embody much intelligence at all. But before these machines were even designed.

Reserved Function Names 109 Appendix Ili.

This papei describes a device-independent diagnostic program called DART. DART differs from previous approaches to diagnosis taken in the Artificial Intelligence community in that it works directly from design descriptions rather than MYCIN-like symptom-fault rules. DART differs from previous approaches to diagnosis taken in the design automation community in that is more general and in many cases more efficient. DART uses a device-independent language for describing devices and a device-independent inference procedure for diagnosis. The resulting generality allows it to be applied to a wide class of devices ranging from digital logic to nuclear reactors. Although this generality engenders some computational overhead on small problems, it facilitates the use of multiple design descriptions and thereby makes possible combinatoric savings that more than offsets this overhead on problems of realistic size.

Reprinted with permission from the Journal of the American Chemical Society, Vol.99,No.7,pp.2063-2069. Abstract: A stereoisomerizat ion mode can be defined as a set of symmetry equivalent degenerate rearrangements of a molecular skeleton. The key mathematical constructions in this definition are the double cosets of the skeletal point group in some larger permutation group of identically substituted skeletal sites. S,,L x S.s. is defined which includes all permutations which act on ligand and site labels separately. The generalized stereoisomerization modes are found to be collections of double cosets in this group.