Functional Abstraction in LISP and PLANNER

dc.creator	Hewitt, Carl
dc.date	2004-10-04T14:43:35Z
dc.date	2004-10-04T14:43:35Z
dc.date	1968-01-01
dc.date.accessioned	2013-10-09T02:43:34Z
dc.date.available	2013-10-09T02:43:34Z
dc.date.issued	2013-10-09
dc.identifier	AIM-151
dc.identifier	http://hdl.handle.net/1721.1/6157
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	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.
dc.format	3382180 bytes
dc.format	233396 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AIM-151
dc.title	Functional Abstraction in LISP and PLANNER

Files in this item

Files	Size	Format	View
There are no files associated with this item.