Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Memos (1959 - 2004)
  5. Functional Abstraction in LISP and PLANNER

Functional Abstraction in LISP and PLANNER

Thumbnail Image
Download
Name

AIM-151.pdf

Size

227.93 KB

Format

Adobe PDF

Checksum (MD5)

b933ea837f827cd287eaf30075517481

Thumbnail Image
Download
Name

AIM-151.ps

Size

3.23 MB

Format

PostScript

Checksum (MD5)

6504d4f3bf1a39fd021b87530e40f66d

Author(s)
Hewitt, Carl
Date Issued
January 1, 1968
Series/Report no.
AIM-151
Abstract
Presented here is part of the graduate work that I am doing in the much broader area of protocol analysis (see A.I. memo 137). The goal of the function abstraction is to find a procedure that satisfies a given set of fragmentary protocols. Thus functional abstraction is the inverse operation to taking a set of protocols of a routine. The basis technique in functional abstraction (which we shall call IMAGE) is to find a minimal homomorphic image of a set of fragmentary protocols. It is interesting to note that the technique of finding a minimal homomorphic image is the same one used to compute the schematized goal tree in A.I. memo 137. We define (a less than b) to mean that a is erased and b is written in its place. We shall use (a:b) to mean that the value of b is a.
Persistent DSpace Link
http://hdl.handle.net/1721.1/6157
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.