Browse Prior Art Database

TRAMP: A RELATIONAL MEMORY WITH AN ASSOCIATIVE BASE

IP.com Disclosure Number: IPCOM000128394D
Original Publication Date: 1968-May-01
Included in the Prior Art Database: 2005-Sep-15

Publishing Venue

Software Patent Institute

Related People

Ash, William: AUTHOR [+4]

Abstract

This report describes the theory and implementation of an experimental language called TRAMP, which is a software simulation of a content-addressable memory. The system consists of an associative data structure embedded in an interpretive language, allowing great flexibility and strong recursive power. The system has further been extended with a logical inference capability by superimposing a relational structure over the associative memory. The resulting language has already proved to be extremely powerful in several applications, and can be termed a language for developing question-answering and interactive communication systems.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 4% of the total text.

Page 1 of 36

THIS DOCUMENT IS AN APPROXIMATE REPRESENTATION OF THE ORIGINAL.

TRAMP: A RELATIONAL MEMORY WITH AN ASSOCIATIVE BASE

THE UNIVERSITY OF MICHIGAN Technical Report 5 William Ash and Edgar Sibley

CONCOMP: Research in Conversational Use of Computers F.H. Westervelt, Project Director ORA Project 07449

supported by: ADVANCED RESEARCH PROJECTS AGENCY DEPARTMENT OF DEFENSE WASHINGTON, D.C.

CONTRACT NO. DA-49-083 OSA-3050 ARPA ORDER NO. 716

administered through: OFFICE OF RESEARCH ADMINISTRATION ANN ARBOR May 1968

TRAMP: A RELATIONAL MEMORY WITH AN ASSOCIATIVE BASE ABSTRACT [ title ]

This report describes the theory and implementation of an experimental language called TRAMP, which is a software simulation of a content-addressable memory. The system consists of an associative data structure embedded in an interpretive language, allowing great flexibility and strong recursive power. The system has further been extended with a logical inference capability by superimposing a relational structure over the associative memory. The resulting language has already proved to be extremely powerful in several applications, and can be termed a language for developing question-answering and interactive communication systems.

This report discusses the theory and design considerations, details of machine implementation, and details of operation with examples.

TABLE OF CONTENTS

ABSTRACT.....iii
LIST OF FIGURES.....vii
I. INTRODUCTION.....1
II. BACKGROUND.....4

University of Michigan Page 1 May 01, 1968

Page 2 of 36

TRAMP: A RELATIONAL MEMORY WITH AN ASSOCIATIVE BASE

III. TRAMP.....12
The Associative Data Structure.....14
Data Structure Storage.....16
Data Retrieval.....17
Data Structure-General Strategy.....19
IV. LOGICAL INFERENCE PACKAGE.....23
Implementation of Inference.....26
V. TRAMP INTERNAL ORGANIZATION.....28
APPENDIX A. UMIST.....A-1
APPENDIX B. TRAMP FUNCTIONS.....C-1
APPENDIX C. EXAMPLES OF TRAMP.....C-1
REFERENCES.....R-1

LIST OF FIGURES

Figure

1 Association by Tables.....5
2 Association by Lists.....7
3 Association by Rings.....9
4 Addition of Association with Rings.....10
5 Binary 4 Generation Male Relational Tree.....13 Name Table Structure.....20
7 Associated Tables.....22
8 Defined Relation Name Table.....33
9 "F0" Questions.....C-2
10a Family Relationships/Nested Questions.....C-3
10b Relational Example, Associations Between Siblings.....C-3
11a Output of Question Answering Program.....C-5
11b Question Answering Program.....C-6

[ chapter 1 ] I. INTRODUCTION

In recent years, the need for a content-addressable computer memory has become increasingly clear. Larger and larger programs are being written which require a structured data base to operate with any efficiency. Many of these could well benefit by replacing tedious searches with a fast, efficient, "content addressable" access of the data store. A good example is the "key- word" library search. If we ask for a list of the books written by J. von Neumann, we do not expect the system to...