Functional Abstraction in LISP and PLANNER
| dc.date.accessioned | 2004-10-04T14:43:35Z | |
| dc.date.accessioned | 2018-11-24T10:12:10Z | |
| dc.date.available | 2004-10-04T14:43:35Z | |
| dc.date.available | 2018-11-24T10:12:10Z | |
| dc.date.issued | 1968-01-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6157 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6157 | |
| dc.description.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. | en_US |
| dc.format.extent | 3382180 bytes | |
| dc.format.extent | 233396 bytes | |
| dc.language.iso | en_US | |
| dc.title | Functional Abstraction in LISP and PLANNER | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-151.pdf | 233.3Kb | application/pdf | View/ |
| AIM-151.ps | 3.382Mb | application/postscript | View/ |