Knowledge about a particular type of ore deposit is encoded in a computational model representing observable geological features and the relative significance thereof.

Get Citation Alerts New Citation Alert added! You will be notified whenever a record that you have chosen has been cited. To manage your alert preferences, click on the button below. Aided Design 8, 1 (Jan. An experimental system for computer controlled mechanical assembly.

Successive utterances in coherent discourse refer to the same entities.

Human programmers seem to know a lot about programming. This suggests a way to try to build automatic programming systems: encode this knowledge in some machine-usable form. In order to test the viability of this approach, knowledge about elementary symbolic programming has been codified into a set of about four hundred detailed rules, and a system, called PECOS, has been built for applying these rules to the task of implementing abstract algorithms. The implementation techniques covered by the rules include the representation of mappings as tables, sets of pairs, property list markings, and inverted mappings, as well as several techniques for enumerating the elements of a collection. The generality of the rules is suggested by the variety of domains in which PECOS has successfully implemented abstract algorithms, including simple symbolic programming, sorting, graph theory, and even simple number theory. In each case, PECOS's knowledge of different techniques enabled the construction of several alternative implementations. In addition, the rules can be used to explain such programming tricks as the use of property list markings to perform an intersection of two linked lists in linear time. Extrapolating from PECOS's knowledge-based approach and from three other approaches to automatic programming (deductive, transformational, high level language), the future of automatic programming seems to involve a changing role for deduction and a range of positions on the generality-power spectrum.

... we began to program a computer understanding system thatwould attempt to process input texts. An item crucial to our ability to accomplishthis task was what we called a script. A script is a frequently repeated causalchain of events that describes a standard situation. In understanding, when it ispossible to notice that one of these standard event chains has been initiated,then it is possible to understand predictively. That is, if we know we are in arestaurant then we can understand where an "order" fits with what we justheard, who might be ordering what from whom, what preconditions (menu,sitting down) might have preceded the "order", and what is likely to happennext. All this information comes from the restaurant script.Hayes, J.E., D. Michie, and L. I. Mikulich (Eds.), Machine Intelligence 9, Ellis Horwood.

This approach leads to an infinite sequence of algorithms I. Surface Models

I will remain Ion8 and deeply indebted to Herb Simon, H. T. Kung, AI Newell, Jay

—A class of LISP programs that is analogous to the finite-state automata is defined, and an algorithm is given for constructing such programs from examples of their input-output behavior. It is shown that the algorithm has robust performance for a wide variety of inputs and that it converges to a solution on the basis of minimum input information.IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. SMC-8, NO. 8,

W'e present a formal syntax and semantics for the SNePS Semantic Network P recessing System (Shapiro 1979), based on a \leinongian theory of the intensional objects of thought (Rapaport 198Sa). Such a theory avoids possible worlds and is appropriate t or AI considered as "computational philosophy"-AI as the study of how intelligence is possible-or "computational psychology"- .ql

This language must satisfy minimal criteria, as follows.