Europe
Knowledge-Based Simulation of Genetic Regulation in Bacteriophage Lambda. Scott Meyers, Peter Friedland, Aug 1983 card 1 of 1
Simuldtois serve two major purposes: the first is the verification of scientific thP.ories the second is xperimental result prcliction. Thr? verification function is called upon when existing t:leories are btling cxtended or new theories are being ç enerated to explain experimental data: the predictive capabilities are used to predict laboratory results in order to eliminate a great deal of experimmtal effort. An esoecially important role for a simulation pro.warn would be as par; of a larger employing art ficial innelligence techniques to develop mcd.els of a biological system bar:ed on experimental OUSerwitiOris. Such a program would accept as Input observations of a s; stem cud would!fiocii:ce as output a model for tn.t system that could account for the observations. The r.:niu!ation portion of such a program would be a crucial tool for ensuring that on:y theories mat were con::..-4 with thc data were dewloocci. It's a major research goal Cf the HOLDEN pi met to explore methods tor building a systym
Automatic Programming Robert Elschlager and Jorge Phillips Handbook of Artificial Intelligence
Theorem Proving Vision Robotics Information Processing Psychology Learning and Inductive Inference Planning and Related Problem-solving Techniques Automatic Programming (AP) Is a new, dynamic, and not precisely defined area of artificial intelligence. This overview discusses the definitions, history, motivating forces and goals of automatic programming and includes a brief description of the basic characteristics and central issues of AP systems. The article begins with a section discussing the various possible definitions of automatic programming, the background in which it has achieved existence, as well as some of its general motivating forces and goals. The next section describes four characteristics of all AP systems: the method by which a user of such a system specifies or describes the desired program, the target language in which the system writes the program, the problem or application area to which the system is addressed, and the approach or operational method employed by the system. Next, a section discusses four basic issues, one or more of which concern all AP systems: the representation and processing of partial or incomplete information; the transformation of structures, and especially the transformation of program descriptions into other descriptions (in this chapter, the term program description includes the user's specification of the desired program, any Internal representations of the progrrm, as well as the target language implementation); the efficiency of the target language Imp,ementation; and the system's capabilities for aiding in the understanding of the program.
Stanford Heuristic Programming Project July 1979 Memo HPP-79-21 Computer Science Department Report No. STAN-CS-79-754
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.
Report 77-27 Overview and Bibliography of Distributed Stanford -- KSL Databases
Because of the recent - echnological advances in computer networks and communications, and because of the cost reduction of computer hardware, there has been a great interest in distributed data bases including some attempts at actual implementations. In this paper, we will first define what we mean by a distributed data base. Then we will give some of the reasons why people are so interested in this new field. After classifying the different types of distributed data bases, we will describe the current areas of research. Finally, we will give an annotated bibliography that lists the most important papers in thi:3 area.
Report 77-05 A Review of Knowledge-Based Problem
It is generally accepted that problem solving systems require a wealth of domain specific knowledge for effective performance in complex domains. This report takes the view that all domain specific knowledge should be expressed in a knowledge base. With this in mind, the ideas and techniques from problem solving and knowledge base research are reviewed and outstanding problems are identified. Finally, a task domain is characterized in terms of objects, actions, and control/strategy knowledge and suggestions are made for creating a uniform knowledge base management system to be used for knowledge acquisition, DD "" 1473
Knowledge-Based Simulation of DNA Metabolism: Prediction of Action and Envisionment of Pathways
Our understanding of any process can be measured by the extent to which a simulation we create mimics the real behavior of that process. Deviations of a simulation indicate either limitations or errors in our knowledge. In addition, these observed differences often suggest verifiable experimental hypotheses to extend our knowledge. The biochemical approach to understanding biological processes is essentially one of simulation. A biochemist typically prepares a cell-free extract that can mediate a well-described physiological process. The extract is then fractionated to purify the components that catalyze individual reactions.