Goto

Collaborating Authors

 Wellness



Machine Intelligence 4

AI Classics

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.




Report 85 20 Stanford KSL

AI Classics

An increasing number of Artificial Intelligence (Al) programs are implemented on high-performance workstations with a bitmap display, a mouse input device, and a keyboard. The programming environment (usually a dialect of LISP) generally provides support for multiple, overlapping windows, and various kinds of menus including pop up menus. The user can move, reshape, close, and scroll the windows. Additionally, a programmer can designate arbitrary regions of a window to be selectable with the mouse. This means that a user can invoke an action by pressing and releasing a mouse button while the mouse cursor is in the designated region.




Stanford Heuristic Programming Project July 1979 Memo HPP-79-21 Computer Science Department Report No. STAN-CS-79-754

AI Classics

Theorem Proving Vision Robotics Information Processing Psychology Learning and Inductive Inference Planning and Related Problem-solving Techniques A. Natural Language Processing Ovnrview The most common way that human beings communicate Is by speaking or writing In one of the "natural" languages, like English, French, or Chinese. Computer programming languages, on the other hand, seem awkward to humans. These "artificial" languages are designed to have a rigid format, or syntax, so that a computer program reading and compiling code written In an artificial language can understand what the programmer means. In addition to being structurally simpler than natural languages, the artificial languages can express easily only those concepts that are important In programming: "Do this then do that," "See it such and such Is true," etc. The things that can be expressed In a language are referred to as the semantics of the language. The research on understanding natural language described in this section of the Handbook is concerned with programs that deal with the full range of meaning of languages like English.


A domain-independent production-rula system for consultation programs. William van Melte Heuristic Programming Project Department of Computer Sc;ence Stanford University Stanford, California 94305

AI Classics

EMYCIN is a programming system for writing knowledge-based consultation programs with a production-rule representation of knowledge. Several major components of the system, Including an explanation program and knowledge acquisition routines, are described. EMYCIN has been used to build consultation systems in several areas of medicine, as well as an engineering domain. These experiences lead to some general conclusions regarding the potential applicability of EMYCIN to new domains. Keywords: knowledge-based systems, production rules, knowledge representation, automated consultant.


S Report 77-11 Stanford -- KSL

AI Classics

Report 77-11 Structure Elucidation Based on Computer S Stanford -- KSL Analysis of High and Low Resolution Mass Spectral Data. A tremendous effort has been directed toward development of advanced instrumentation for mass spectrometrlc analysis. Advancements include everincreasing sensitivities and resolving powers, new ionization techniques, metastable ion probes of ion decomposition and structure and computer systems for rapid acquisition and reduction of data. We sometimes lose sight of the fact that these developments are designed to provide information about chemical and biochemic,a1 structures at greater TeTTE--aTrin greater detail than previously available. The ultimate goal in most research in mass spectrometry is to provide powerful tools for molecular structure elucidation, either directly, by exploitation of existing techniques, or indirectly by development of new techniques. Concurrently, several computer-based techniques designed to assist chemists in the analysis and interpretation of mass spectral data have been developed. Reprinted with permission from Smith, Dennis H. and Carhart, Raymond E. in "High Performance Mass Spectrometry: Chemical Applications," Michael Gross, Ed., in ACS SYMPOSIUM SERIES, No. 70; American Chemical Society: Washington, D.C., 1978, pp.325-347. Library search procedures (2) and their extensions (I) or attern recoviitioz programs (4) may provide clues to t e identity of the structure or be used to determine the structure uniquely. A computer program for analysis of spectra based on classspecific fragmentation rules, is available (5). There are several reasons or this lag: There is no formal theory.