Graduate Thesis Or Dissertation
 

An investigation of the search space of Lenat's AM program

Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/cr56n398h

Descriptions

Attribute NameValues
Creator
Abstract
  • AM is a computer program written by Doug Lenat that discovers elementary mathematics starting from some initial knowledge of set theory. The success of this program is not clearly understood. This work is an attempt to explore the search space of AM in order to understand the success and eventual failure of AM. We show that operators play an important role in AM. Operators of AM can be divided into critical and unnecessary. The critical operators can be further divided into implosive and explosive. Heuristics are needed only for the explosive operators. Most heuristics and operators in AM can be removed without significant effects. Only three operators (Coalesce, Invert, Repeat) and one initial concept (Bag Union) are enough to discover most of the elementary math concepts that AM discovered.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Publisher
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6670 in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces

Relationships

Parents:

This work has no parents.

In Collection:

Items

Thumbnail Title Date Uploaded Visibility Actions
file details MishraPrafullaK1988.pdf 2017-08-09 Public Download