WorldCat Identities

Stanford Artificial Intelligence Project

Overview
Works: 22 works in 24 publications in 1 language and 58 library holdings
Classifications: Q335, 651.8
Publication Timeline
Key
Publications about Stanford Artificial Intelligence Project Publications about Stanford Artificial Intelligence Project
Publications by Stanford Artificial Intelligence Project Publications by Stanford Artificial Intelligence Project
Most widely held works about Stanford Artificial Intelligence Project
 
Most widely held works by Stanford Artificial Intelligence Project
Memo ( )
in English and held by 14 WorldCat member libraries worldwide
Artificial intelligence memoranda of the AI Laboratory, Computer Science Department, Stanford University, 1963-1982 ( Book )
1 edition published in 1983 in English and held by 12 WorldCat member libraries worldwide
Catalogue, Artificial intelligence memoranda of the AI Laboraory, Computer Science Department, Stanford University, 1963-1982 ( Book )
1 edition published in 1983 in English and held by 12 WorldCat member libraries worldwide
Project technical report by Stanford Artificial Intelligence Project ( Book )
2 editions published between 1969 and 1970 in English and held by 3 WorldCat member libraries worldwide
Algebraic simplification by Horace Enea ( Book )
1 edition published in 1964 in English and held by 1 WorldCat member library worldwide
Basic additions to the Mark IV Simplification routine to date attempt to extend the power of the program in several areas where modifications were straightforward and did not involve changes in the basic philosophy of simplification
Dendral--a computer program for generating and filtering chemical structures by Georgia Sutherland ( Book )
1 edition published in 1967 in English and held by 1 WorldCat member library worldwide
Memos ( )
in Undetermined and held by 1 WorldCat member library worldwide
ON THE SYNTHESIS OF FINITE-STATE ACCEPTORS by Alan W Biermann ( Book )
1 edition published in 1970 in English and held by 1 WorldCat member library worldwide
Two algorithms are presented for solving the following problem: given a finite-set S of strings of symbols, find a finite-state machine which will accept the strings of S and possibly some additional strings which 'resemble' those of S. The approach used is to directly construct the states and transitions of the acceptor machine from the string information. The algorithms include a parameter which enable one to increase the exactness of the resulting machine's behavior as much as desired by increasing the number of states in the machine. The properties of the algorithms are presented and illustrated with a number of examples. The paper gives a method for identifying a finite-state language from a randomly chosen finite subset of the language if the subset is large enough and if a bound is known on the number of states required to recognize the language. Finally, some of the uses of the algorithms and their relationship to the problem of grammatical inference are discussed
Contextual analysis of phonemes of English by D. Raj Reddy ( Book )
1 edition published in 1969 in English and held by 1 WorldCat member library worldwide
It is now well known that the acoustic characteristics of a phoneme depend on both the preceding and following phonemes. This paper provides some needed contextual and probabilistic data about trigram phonemic sequences of spoken English. Since there are approximately 40 to the 3rd power such sequences, one must discover and study only the more commonly occurring sequences. To this purpose, three types of tables are presented, viz., (a) Commonly occurring trigram sequences of the form /abc/ for every phoneme /b/. (b) Commonly occurring sequences /abc/ for every pair of phonemes /a/ and /c/. (c) Commonly occurring word boundary sequences of the form /-ab/ and /ab-/ where /-/ represents the silence phoneme. Entries of the above tables contain examples of usage and probabilities of occurrence for each such sequence. (Author)
An information-processing model of intermediate-level cognition by Joseph Becker ( Book )
1 edition published in 1970 in English and held by 1 WorldCat member library worldwide
The report describes a formal information-processing model of an 'Intermediate-Level' cognitive system. The model includes memory structures for the storage of experience, and processes for responding to new events on the basis of previous experience. In addition, the proposed system contains a large number of mechanisms for making the response-selection process highly efficient, in spite of the vast amount of stored information that the system must cope with. These devices include procedures for heuristically evaluating alternative subprocesses, for guiding the search through memory, and for reorganizing the information in memory into more efficient representations. (Author)
MEMO AIM by Stanford Artificial Intelligence Project ( )
in Undetermined and held by 1 WorldCat member library worldwide
Situations, actions, and causal laws by John McCarthy ( Book )
1 edition published in 1963 in English and held by 1 WorldCat member library worldwide
A formal theory is given concerning situations, causality and the possibility and effects of actions is given. The theory is intended to be used by the Advice Taker, a computer program that is to decide what to do by reasoning. Some simple examples are given of descriptions of situations and deductions that certain goals can be achieved. (Author)
The application of theorem proving to question-answering systems by Claude Cordell Green ( Book )
1 edition published in 1969 in English and held by 1 WorldCat member library worldwide
The paper shows how a question-answering system can use first-order logic as its language and an automatic theorem prover, based upon the resolution inference principle, as its deductive mechanism. The resolution proof procedure is extended to a constructive proof procedure. An answer construction algorithm is given whereby the system is able not only to produce yes or no answers but also to find or construct an object satisfying a specified condition. A working computer program, QA3, based on these ideas, is described. Methods are presented for solving state transformation problems. In addition to question-answering, the program can do automatic programming, control and problem solving for a simple robot, pattern recognition, and puzzles. (Author)
Edge detection in pictures by computer using planning by Michael D Kelly ( Book )
1 edition published in 1970 in English and held by 1 WorldCat member library worldwide
The paper describes a program for extracting an accurate outline of a man's head from a digital picture. The program accepts as input digital, grey scale pictures containing people standing in front of various backgrounds. The output of the program is an ordered list of the points which form the outline of the head. The edges of background objects and the interior details of the head have been suppressed. The program is successful because of an improved method for edge detection which uses heuristic planning, a technique drawn from artificial intelligence research in problem solving. A brief, edge detection using planning consists of three steps. A new digital picture is prepared from the original; the new picture is smaller and has less detail. Edges of objects are located in the reduced picture. The edges found in the reduced picture are used as a plan for finding edges in the original picture. (Author)
Modelling, trajectory calculation and servoing of a computer controlled arm by Richard Paul Collins Paul ( Book )
1 edition published in 1974 in English and held by 1 WorldCat member library worldwide
Predicate calculus with "undefined" as a truth-value by John McCarthy ( Book )
1 edition published in 1963 in English and held by 1 WorldCat member library worldwide
Second-order mathematical theory of computation by Zohar Manna ( Book )
1 edition published in 1970 in English and held by 1 WorldCat member library worldwide
Notes on theory of computation and pattern recognition by T Itō ( Book )
1 edition published in 1968 in English and held by 1 WorldCat member library worldwide
Heuristic dendral : a family of LISP programs by Georgia L Sutherland ( Book )
1 edition published in 1969 in English and held by 1 WorldCat member library worldwide
The Heuristic Dendral program for generating explanatory hypotheses in organic chemistry is described as an application of the programming language LISP. The description emphasizes the non-chemical aspects of the program, particularly the 'topologist' which generates all tree graphs of a collection of nodes. (Author)
Memo by Stanford Artificial Intelligence Project ( )
in English and held by 1 WorldCat member library worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.85 (from 0.00 for MEMO AIM / ... to 0.97 for Memo ...)
Alternative Names

controlled identity Stanford Artificial Intelligence Laboratory

Artificial Intelligence Project
Stanford Artificial Intelligence Project
Stanford University Artificial Intelligence Project
Stanford University Department of Computer Science Artificial Intelligence Project
Stanford University Department of Computer Science Stanford Artificial Intelligence Project
Languages
English (21)