- Title:
- The semantics of PASCAL in LCF
- Author:
- Aiello, Luigia, Aiello, Mario, and Weyhrauch, Richard W.
- Author (no Collectors):
- Aiello, Luigia, Aiello, Mario, and Weyhrauch, Richard W.
- Description:
- We define a semantics for the arithmetic part of PASCAL by giving it an interpretation in LCF, a language based on the typed $\lambda$-calculus. Programs are represented in terms of their abstract syntax. We show sample proofs, using LCF, of some general properties of PASCAL and the correctness of some particular programs. A program implementing the McCarthy Airline reservation system is proved correct.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- August 01, 1974
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), August 1, 1974
- Genre:
- technical reports
- Identifier:
- CS-TR-1974-447
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
« Previous |
1 - 24 of 239
|
Next »
Number of results to display per page
Search Results
- Title:
- Checking proofs in the metamathematics of first order logic
- Author:
- Aiello, Mario and Weyhrauch, Richard W.
- Author (no Collectors):
- Aiello, Mario and Weyhrauch, Richard W.
- Description:
- This is a report on some of the first experiments of any size carried out using the new first order proof checker FOL. We present two different first order axiomatizations of the metamathematics of the logic which FOL itself checks and show several proofs using each one. The difference between the axiomatizations is that one defines the metamathematics in a many sorted logic, the other does not.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- August 01, 1974
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), August 1, 1974
- Genre:
- technical reports
- Identifier:
- CS-TR-1974-467
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- A Symposium to Honor Mina Rees, AAAS 1982 Annual Convention
- Author:
- Feigenbaum, Edward A.
- Author (no Collectors):
- Feigenbaum, Edward A.
- Corporate Author:
- American Association for the Advancement of Science
- Topic:
- Computer science and Artificial intelligence
- Language:
- English
- Physical Description:
- 1 audio cassette
- Date:
- January 06, 1982
- Imprint:
- January 6, 1982
- Genre:
- speeches
- Series:
- 1991-030
- Box:
- 3
- Identifier:
- SC0340_1991-030_b03_29
- Location:
- SC0340, Accession 1991-030, Box 3
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Edward A. Feigenbaum papers, 1950-2007 (inclusive)
- Title:
- The translation of 'go to' programs to 'while' programs
- Author:
- Ashcroft, Edward A.
- Author (no Collectors):
- Ashcroft, Edward A.
- Description:
- In this paper we show that every flowchart program can be written without $underline{go to}$ statements by using $underline{while}$ statements. The main idea is to introduce new variables to preserve the values of certain variables at particular points in the program; or alternatively, to introduce special boolean variables to keep information about the course of the computation. The 'while' programs produced yield the same final results as the original flowchart program but need not perform computations in exactly the same way. However, the new programs do preserve the 'topology' of the original flowchart program, and are of the same order of efficiency. We also show that this cannot be done in general without adding variables.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- January 01, 1971
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), January 1, 1971
- Genre:
- technical reports
- Identifier:
- CS-TR-1971-188
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- Association for Computing Machinery (ACM) Turing Award (Master)
- Author:
- Feigenbaum, Edward A.
- Author (no Collectors):
- Feigenbaum, Edward A.
- Corporate Author:
- Association for Computing Machinery
- Topic:
- Computer science, Expert systems (Computer science), and Artificial intelligence
- Language:
- English
- Physical Description:
- 1 audio cassette
- Date:
- 1995
- Imprint:
- 1995
- Genre:
- speeches
- Series:
- 2005-071
- Box:
- 72
- Identifier:
- SC340_2005-101_b072_f17
- Location:
- SC0340, Accession 2005-071, Box 72
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Edward A. Feigenbaum papers, 1950-2007 (inclusive)
- Title:
- D724 Keynote Address: Artificial Intelligence (AI) as an Experimental Science by Herbert Simon - AAAI National Conference
- Author:
- Simon, Herbert A. (Herbert Alexander), 1916-2001
- Author (no Collectors):
- Simon, Herbert A. (Herbert Alexander), 1916-2001
- Corporate Author:
- Association for the Advancement of Artificial Intelligence
- Topic:
- Computer science, Artificial intelligence, and Expert systems (Computer science)
- Language:
- English
- Physical Description:
- 1 audio cassette
- Date:
- 1993
- Imprint:
- 1993
- Series:
- 2005-071
- Box:
- 72
- Identifier:
- SC0340_2005-101_b72_24
- Location:
- SC0340, Accession 2005-071, Box 72
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Edward A. Feigenbaum papers, 1950-2007 (inclusive)
- Title:
- IQ-17 Presidential Address: Toward an Theory of Knowledge, Reddy AAAI. Part 1
- Author:
- Reddy, Raj
- Author (no Collectors):
- Reddy, Raj
- Corporate Author:
- Association for the Advancement of Artificial Intelligence
- Topic:
- Computer science, Artificial intelligence, and Expert systems (Computer science)
- Language:
- English
- Physical Description:
- 1 audio cassette
- Date:
- 1988
- Imprint:
- 1988
- Genre:
- speeches
- Series:
- 2005-071
- Box:
- 72
- Identifier:
- SC0340_2005-101_b72_26
- Location:
- SC0340, Accession 2005-071, Box 72
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Edward A. Feigenbaum papers, 1950-2007 (inclusive)
- Title:
- IQ-17 Presidential Address: Toward an Theory of Knowledge, Reddy AAAI. Part 2
- Author:
- Reddy, Raj
- Author (no Collectors):
- Reddy, Raj
- Corporate Author:
- Association for the Advancement of Artificial Intelligence
- Topic:
- Computer science, Artificial intelligence, and Expert systems (Computer science)
- Language:
- English
- Physical Description:
- 1 audio cassette
- Date:
- 1988
- Imprint:
- 1988
- Genre:
- speeches
- Series:
- 2005-071
- Box:
- 72
- Identifier:
- SC0340_2005-101_b72_27
- Location:
- SC0340, Accession 2005-071, Box 72
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Edward A. Feigenbaum papers, 1950-2007 (inclusive)
- Title:
- Oliver Selfrideg, AAAI
- Author:
- Selfrideg, Oliver
- Author (no Collectors):
- Selfrideg, Oliver
- Corporate Author:
- Association for the Advancement of Artificial Intelligence
- Topic:
- Computer science, Expert systems (Computer science), and Artificial intelligence
- Language:
- English
- Physical Description:
- 1 audio cassette
- Date:
- 1992
- Imprint:
- 1992
- Genre:
- speeches
- Series:
- 2005-071
- Box:
- 72
- Identifier:
- SC340_2005-101_b072_f16
- Location:
- SC0340, Accession 2005-071, Box 72
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Edward A. Feigenbaum papers, 1950-2007 (inclusive)
- Title:
- Oliver Selfridge, AAAI
- Author:
- Selfridge, Oliver G.
- Author (no Collectors):
- Selfridge, Oliver G.
- Corporate Author:
- Association for the Advancement of Artificial Intelligence
- Topic:
- Computer science, Artificial intelligence, and Expert systems (Computer science)
- Language:
- English
- Physical Description:
- 1 audio cassette
- Date:
- 1992
- Imprint:
- 1992
- Genre:
- speeches
- Series:
- 2005-071
- Box:
- 72
- Identifier:
- SC0340_2005-101_b72_16
- Location:
- SC0340, Accession 2005-071, Box 72
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Edward A. Feigenbaum papers, 1950-2007 (inclusive)
- Title:
- Image contouring and comparing
- Author:
- Baumgart, Bruce G.
- Author (no Collectors):
- Baumgart, Bruce G.
- Description:
- A contour image representation is stated and an algorithm for converting a set of digital television images into this representation is explained. The algorithm consists of five steps: digital image thresholding, binary image contouring, polygon nesting, polygon smoothing, and polygon comparing. An implementation of the algorithm is the main routine of a program called CRE; auxiliary routines provide cart and turn table control, TV camera input, image display, and xerox printer output. A serendip application of CRE to type font construction is explained. Details about the intended application of CRE to the perception of physical objects will appear in sequels to this paper.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- October 01, 1973
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), October 1, 1973
- Genre:
- technical reports
- Identifier:
- CS-TR-1973-396
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- An overview of KRL, a Knowledge Representation Language
- Author:
- Bobrow, Daniel G. and Winograd, Terry A.
- Author (no Collectors):
- Bobrow, Daniel G. and Winograd, Terry A.
- Description:
- This paper describes KRL, a Knowledge Representation Language designed for use in understander systems. It outlines both the general concepts which underlie our research and the details of KRL-0, an experimental implementation of some of these concepts. KRL is an attempt to integrate procedural knowledge with a broad base of declarative forms. These forms provide a variety of ways to express the logical structure of the knowledge, in order to give flexibility in associating procedures (for memory and reasoning) with specific pieces of knowledge, and to control the relative accessibility of different facts and descriptions. The formalism for declarative knowledge is based on structured conceptual objects with associated descriptions. These objects form a network of memory units with several different sorts of linkages, each having well-specified implications for the retrieval process. Procedures can be associated directly with the internal structure of a conceptual object. This procedural attachment allows the steps for a particular operation to be determined by characteristics of the specific entities involved. The control structure of KRL is based on the belief that the next generation of intelligent programs will integrate data-directed and goal-directed processing by using multi-processing. It provides for a priority-ordered multi-process agenda with explicit (user-provided) strategies for scheduling and resource allocation. It provides procedure directories which operate along with process frameworks to allow procedural parameterization of the fundamental system processes for building, comparing, and retrieving memory structures. Future development of KRL will include integrating procedure definition with the descriptive formalism.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- November 01, 1976
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), November 1, 1976
- Genre:
- technical reports
- Identifier:
- CS-TR-1976-581
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- The use of sensory feedback in a programmable assembly system
- Author:
- Bolles, Robert C. and Paul, Richard P.
- Author (no Collectors):
- Bolles, Robert C. and Paul, Richard P.
- Description:
- This article describes an experimental, automated assembly system which uses sensory feedback to control an electro-mechanical arm and TV camera. Visual, tactile, and force feedback are used to improve positional information, guide manipulations, and perform inspections. The system has two phases: a 'planning' phase in which the computer is programmed to assemble some object, and a 'working' phase in which the computer controls the arm and TV camera in actually performing the assembly. The working phase is designed to be run on a mini-computer. The system has been used to assemble a water pump, consisting of a base, gasket, top, and six screws. This example is used to explain how the sensory data is incorporated into the control system. A movie showing the pump assembly is available from the Stanford Artificial Intelligence Laboratory.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- October 01, 1973
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), October 1, 1973
- Genre:
- technical reports
- Identifier:
- CS-TR-1973-394
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- BAOBAB, a parser for a rule-based system using a semantic grammar
- Author:
- Bonnet, Alain
- Author (no Collectors):
- Bonnet, Alain
- Description:
- Until a recent knowledge-based system is able to learn by itself, it must acquire new knowledge and new heuristics from human experts. This is traditionally done with the aid of a computer programmer acting as intermediary. The direct transfer of knowledge from an expert to the system requires a natural-language processor capable of handling a substantial subset of English. The development of such a natural-language processor is a long-term goal of automating knowledge acquisition; facilitating the interface between the expert and the system is a first step toward this goal. This paper descrtbes BAOBAB, a program designed and implemented for MYCIN (Shortliffe 1974), a medical consultation system for infectious disease diagnosis and therapy selection. BAOBAB is concerned with the problem of parsing - recognizing natural language sentences and encoding them into MYClN's internal representation. For this purpose, it uses a semantic grammar in which the non-terminal symbols denote semantic categories (e.g., infections and symptoms), or conceptual categorles whlch are common tools of knowledge representation in artificial intelligence (e.g., attributes, objects, values and predicate functions). This differs from a syntactic grammar in which non-terminal symbols are syntactic elements such as nouns or verbs.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- September 01, 1978
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), September 1, 1978
- Genre:
- technical reports
- Identifier:
- CS-TR-1978-668
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- Ray Kurtzweil Panel at Boston Computer Society, "Powersharing: People, Computers and You"
- Author:
- Feigenbaum, Edward A. and Kurzweil, Ray
- Author (no Collectors):
- Feigenbaum, Edward A. and Kurzweil, Ray
- Corporate Author:
- Boston Computer Society
- Topic:
- Computer science and Artificial intelligence
- Language:
- English
- Physical Description:
- 1 audio cassette
- Publication Info:
- Boston (Mass.)
- Date:
- 1985
- Place created:
- Boston (Mass.)
- Imprint:
- Boston (Mass.), 1985
- Genre:
- speeches
- Series:
- 1991-030
- Box:
- 3
- Identifier:
- SC0340_1991-030_b03_23
- Location:
- SC0340, Accession 1991-030, Box 3
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Edward A. Feigenbaum papers, 1950-2007 (inclusive)
- Title:
- The Heuristic DENDRAL program for explaining empirical data
- Author:
- Buchanan, Bruce G.
- Author (no Collectors):
- Buchanan, Bruce G.
- Description:
- The Heuristic DENDRAL program uses an information processing model of scientific reasoning to explain experimental data in organic chemistry. This report summarizes the organization and results of the program for computer scientists. The program is divided into three main parts: planning, structure generation, and evaluation. The planning phase infers constraints on the search space from the empirical data input to the system. The structure generation phase searches a tree whose termini are models of chemical molecules using pruning heuristics of various kinds. The evaluation phase tests the candidate structures against the original data. Results of the program's analyses of some test data are discussed.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- February 01, 1971
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), February 1, 1971
- Genre:
- technical reports
- Identifier:
- CS-TR-1971-203
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- Carnegie Mellon University speech
- Author:
- Feigenbaum, Edward A.
- Author (no Collectors):
- Feigenbaum, Edward A.
- Corporate Author:
- Carnegie-Mellon University
- Topic:
- Computer science and Artificial intelligence
- Language:
- English
- Physical Description:
- 1 digital video file
- Date:
- April 20, 2006
- Imprint:
- April 20, 2006
- Genre:
- speeches and Video recordings
- Series:
- 1991-030
- Identifier:
- SC0340_1991-030_CMU
- Location:
- SC0340, Accession 1991-030
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Edward A. Feigenbaum papers, 1950-2007 (inclusive)
- Title:
- Efficient compilation of linear recursive programs
- Author:
- Chandra, Ashok K.
- Author (no Collectors):
- Chandra, Ashok K.
- Description:
- We consider the class of linear recursive programs. A linear recursive program is a set of procedures where each procedure can make at most one recursive call. The conventional stack implementation of recursion requires time and space both proportional to n, the depth of recursion. It is shown that in order to implement linear recursion so as to execute in time n one doesn't need space proportional to n: $n^\epsilon$ for arbitrarily small $\epsilon$ will do. It is also known that with constant space one can implement linear recursion in time $n^2$. We show that one can do much better: $n^{1+\epsilon}$ for arbitrarily small $\epsilon$. We also describe an algorithm that lies between these two: it takes time n.log(n) and space log(n). It is shown that several problems are closely related to the linear recursion problem, for example, the problem of reversing an input tape given a finite automaton with several one-way heads. By casting all these problems into a canonical form, efficient solutions are obtained simultaneously for all.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- April 01, 1972
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), April 1, 1972
- Genre:
- technical reports
- Identifier:
- CS-TR-1972-282
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- On the power of programming features
- Author:
- Chandra, Ashok K. and Manna, Zohar
- Author (no Collectors):
- Chandra, Ashok K. and Manna, Zohar
- Description:
- We consider the power of several programming features such as counters, pushdown stacks, queues, arrays, recursion and equality. In this study program schemas are used as the model for computation. The relations between the powers of these features is completely described by a comparison diagram.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- January 01, 1973
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), January 1, 1973
- Genre:
- technical reports
- Identifier:
- CS-TR-1973-333
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- Program schemas with equality
- Author:
- Chandra, Ashok K.
- Author (no Collectors):
- Chandra, Ashok K.
- Description:
- We discuss the class of program schemas augmented with equality tests, that is, tests of equality between terms. In the first part of the paper we discuss and illustrate the "power" of equality tests. It turns out that the class of program schemas with equality is more powerful than the "maximal" classes of schemas suggested by other investigators. In the second part of the paper we discuss the decision problems of program schemas with equality. It is shown for example that while the decision problems normally considered for schemas (such as halting, divergence, equivalence, isomorphism and freedom) are solvable for Ianov schemas, they all become unsolvable if general equality tests are added. We suggest, however, limited equality tests which can be added to certain subclasses of program schemas while preserving their solvable properties.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- December 01, 1971
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), December 1, 1971
- Genre:
- technical reports
- Identifier:
- CS-TR-1971-250
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- Multidimensional analysis in evaluating a simulation of paranoid thought
- Author:
- Colby, Kenneth Mark and Hilf, Franklin Dennis
- Author (no Collectors):
- Colby, Kenneth Mark and Hilf, Franklin Dennis
- Description:
- The limitations of Turing's Test as an evaluation procedure are reviewed. More valuable are tests which ask expert judges to make ratings along multiple dimensions essential to the model. In this way the model's weaknesses become clarified and the model builder learns where the model must be improved.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- May 01, 1973
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), May 1, 1973
- Genre:
- technical reports
- Identifier:
- CS-TR-1973-346
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- Pattern-matching rules for the recognition of natural language dialogue expressions
- Author:
- Colby, Kenneth Mark, Parkison, Roger C., and Faught, William S.
- Author (no Collectors):
- Colby, Kenneth Mark, Parkison, Roger C., and Faught, William S.
- Description:
- Man-machine dialogues using everyday conversational English present problems for computer processing of natural language. Grammar-based parsers which perform a word-by-word, parts-of-speech analysis are too fragile to operate satisfactorily in real time intervieus allowing unrestricted English. In constructing a simulation of paranoid thought processes, we designed an algorithm capable of handling the linguistic expressions used by interviewers in teletyped diagnostic psychiatric interviews. The algorithm uses pattern-matching rules which attempt to characterize the input expressions by progressively transforming them into patterns uhich match, completely or fuzzily, abstract stored patterns. The power of this approach lies in its ability to ignore recognized and unrecognized words and still grasp the meaning of the message. The methods utilized are general and could serve any "host" system uhich takes natural language input.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- June 01, 1974
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), June 1, 1974
- Genre:
- technical reports
- Identifier:
- CS-TR-1974-431
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- Inference rules for program annotation
- Author:
- Dershowitz, Nachum and Manna, Zohar
- Author (no Collectors):
- Dershowitz, Nachum and Manna, Zohar
- Description:
- Methods are presented whereby an Algol-like program, given together with its specifications, can be documented automatically. The program is incrementally annotated with invariant relationships that hold between program variables at intermediate points in the program and explain the acutal workings of the program regardless of whether the program is correct. Thus this documentation can be used for proving the correctness of the program or may serve as an aid in the debugging of an incorrect program. The annotation techniques are formulated as Hoare-llike inference rules which derive invariants from the assignment statements, from the control structure of the program, or, heuristically, from suggested invariants. The application of these rules is demonstrated by two examples which have run on an experimental implementation.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- October 01, 1977
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), October 1, 1977
- Genre:
- technical reports
- Identifier:
- CS-TR-1977-631
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2
- Title:
- The evolution of programs: a system for automatic program modification
- Author:
- Dershowitz, Nachum and Manna, Zohar
- Author (no Collectors):
- Dershowitz, Nachum and Manna, Zohar
- Description:
- An attempt is made to formulate techniques of program modification, whereby a program that achieves one result can be transformed into a new program that uses the same principles to achieve a different goal. For example, a program that uses the binary search paradigm to calculate the square-root of a number may be modified to divide two numbers in a similar manner, or vice versa. Program debugging is considered as a special case of modification: if a program computes wrong results, it must be modified to achieve the intended results. The application of abstract program schemata to concrete problems is also viewed from the perspective of modification techniques. We have embedded this approach in a running implementation; our methods are illustrated with several examples that have been performed by it.
- Topic:
- Computer science
- Subject:
- Stanford University. Computer Science Department
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- cau and Stanford (Calif.)
- Date:
- December 01, 1976
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), December 1, 1976
- Genre:
- technical reports
- Identifier:
- CS-TR-1976-586
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- 3840/2